TSTP Solution File: SWC264-1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SWC264-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n006.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 31 12:39:50 EDT 2023

% Result   : Unsatisfiable 4.82s 1.01s
% Output   : CNFRefutation 4.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   77 (  27 unt;   0 def)
%            Number of atoms       :  184 (  10 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :  195 (  88   ~;  96   |;   0   &)
%                                         (  11 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :   19 (  17 usr;  12 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-2 aty)
%            Number of variables   :   41 (;  41   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f27,axiom,
    ! [U] : ssList(skaf68(U)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f28,axiom,
    ! [U] : ssList(skaf67(U)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f29,axiom,
    ! [U] : ssList(skaf66(U)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f30,axiom,
    ! [U] : ssItem(skaf65(U)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f31,axiom,
    ! [U] : ssItem(skaf64(U)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f91,axiom,
    ! [U] :
      ( ~ leq(skaf64(U),skaf65(U))
      | ~ ssList(U)
      | totalorderedP(U) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f103,axiom,
    ! [U,V] :
      ( ~ lt(U,V)
      | ~ ssItem(V)
      | ~ ssItem(U)
      | leq(U,V) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f164,axiom,
    ! [U] :
      ( ~ ssList(U)
      | totalorderedP(U)
      | app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U))) = U ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f181,axiom,
    ! [U,V,W,X,Y,Z] :
      ( app(app(U,cons(V,W)),cons(X,Y)) != Z
      | ~ ssList(Y)
      | ~ ssList(W)
      | ~ ssList(U)
      | ~ ssItem(X)
      | ~ ssItem(V)
      | ~ strictorderedP(Z)
      | ~ ssList(Z)
      | lt(V,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f186,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f191,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f192,negated_conjecture,
    strictorderedP(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f193,negated_conjecture,
    ~ totalorderedP(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f220,plain,
    ! [X0] : ssList(skaf68(X0)),
    inference(cnf_transformation,[status(esa)],[f27]) ).

fof(f221,plain,
    ! [X0] : ssList(skaf67(X0)),
    inference(cnf_transformation,[status(esa)],[f28]) ).

fof(f222,plain,
    ! [X0] : ssList(skaf66(X0)),
    inference(cnf_transformation,[status(esa)],[f29]) ).

fof(f223,plain,
    ! [X0] : ssItem(skaf65(X0)),
    inference(cnf_transformation,[status(esa)],[f30]) ).

fof(f224,plain,
    ! [X0] : ssItem(skaf64(X0)),
    inference(cnf_transformation,[status(esa)],[f31]) ).

fof(f285,plain,
    ! [X0] :
      ( ~ leq(skaf64(X0),skaf65(X0))
      | ~ ssList(X0)
      | totalorderedP(X0) ),
    inference(cnf_transformation,[status(esa)],[f91]) ).

fof(f299,plain,
    ! [X0,X1] :
      ( ~ lt(X0,X1)
      | ~ ssItem(X1)
      | ~ ssItem(X0)
      | leq(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f103]) ).

fof(f388,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | totalorderedP(X0)
      | app(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))),cons(skaf65(X0),skaf68(X0))) = X0 ),
    inference(cnf_transformation,[status(esa)],[f164]) ).

fof(f414,plain,
    ! [V,X] :
      ( ! [Z] :
          ( ! [U] :
              ( ! [W] :
                  ( ! [Y] :
                      ( app(app(U,cons(V,W)),cons(X,Y)) != Z
                      | ~ ssList(Y) )
                  | ~ ssList(W) )
              | ~ ssList(U) )
          | ~ ssItem(X)
          | ~ ssItem(V)
          | ~ strictorderedP(Z)
          | ~ ssList(Z) )
      | lt(V,X) ),
    inference(miniscoping,[status(esa)],[f181]) ).

fof(f415,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( app(app(X0,cons(X1,X2)),cons(X3,X4)) != X5
      | ~ ssList(X4)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X3)
      | ~ ssItem(X1)
      | ~ strictorderedP(X5)
      | ~ ssList(X5)
      | lt(X1,X3) ),
    inference(cnf_transformation,[status(esa)],[f414]) ).

fof(f424,plain,
    ssList(sk1),
    inference(cnf_transformation,[status(esa)],[f186]) ).

fof(f429,plain,
    sk1 = sk3,
    inference(cnf_transformation,[status(esa)],[f191]) ).

fof(f430,plain,
    strictorderedP(sk3),
    inference(cnf_transformation,[status(esa)],[f192]) ).

fof(f431,plain,
    ~ totalorderedP(sk1),
    inference(cnf_transformation,[status(esa)],[f193]) ).

fof(f463,plain,
    ! [X0,X1,X2,X3,X4] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssItem(X3)
      | ~ ssItem(X4)
      | ~ strictorderedP(app(app(X2,cons(X4,X1)),cons(X3,X0)))
      | ~ ssList(app(app(X2,cons(X4,X1)),cons(X3,X0)))
      | lt(X4,X3) ),
    inference(destructive_equality_resolution,[status(esa)],[f415]) ).

fof(f470,plain,
    strictorderedP(sk1),
    inference(forward_demodulation,[status(thm)],[f429,f430]) ).

fof(f1263,plain,
    ( spl0_42
  <=> ssList(sk1) ),
    introduced(split_symbol_definition) ).

fof(f1265,plain,
    ( ~ ssList(sk1)
    | spl0_42 ),
    inference(component_clause,[status(thm)],[f1263]) ).

fof(f1323,plain,
    ( $false
    | spl0_42 ),
    inference(forward_subsumption_resolution,[status(thm)],[f1265,f424]) ).

fof(f1324,plain,
    spl0_42,
    inference(contradiction_clause,[status(thm)],[f1323]) ).

fof(f1606,plain,
    ( spl0_61
  <=> totalorderedP(sk1) ),
    introduced(split_symbol_definition) ).

fof(f1607,plain,
    ( totalorderedP(sk1)
    | ~ spl0_61 ),
    inference(component_clause,[status(thm)],[f1606]) ).

fof(f11102,plain,
    ( spl0_751
  <=> app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))) = sk1 ),
    introduced(split_symbol_definition) ).

fof(f11103,plain,
    ( app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))) = sk1
    | ~ spl0_751 ),
    inference(component_clause,[status(thm)],[f11102]) ).

fof(f11105,plain,
    ( totalorderedP(sk1)
    | app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))) = sk1 ),
    inference(resolution,[status(thm)],[f388,f424]) ).

fof(f11106,plain,
    ( spl0_61
    | spl0_751 ),
    inference(split_clause,[status(thm)],[f11105,f1606,f11102]) ).

fof(f11525,plain,
    ( spl0_810
  <=> ssList(skaf68(sk1)) ),
    introduced(split_symbol_definition) ).

fof(f11527,plain,
    ( ~ ssList(skaf68(sk1))
    | spl0_810 ),
    inference(component_clause,[status(thm)],[f11525]) ).

fof(f11528,plain,
    ( spl0_811
  <=> ssList(skaf67(sk1)) ),
    introduced(split_symbol_definition) ).

fof(f11530,plain,
    ( ~ ssList(skaf67(sk1))
    | spl0_811 ),
    inference(component_clause,[status(thm)],[f11528]) ).

fof(f11531,plain,
    ( spl0_812
  <=> ssList(skaf66(sk1)) ),
    introduced(split_symbol_definition) ).

fof(f11533,plain,
    ( ~ ssList(skaf66(sk1))
    | spl0_812 ),
    inference(component_clause,[status(thm)],[f11531]) ).

fof(f11534,plain,
    ( spl0_813
  <=> ssItem(skaf65(sk1)) ),
    introduced(split_symbol_definition) ).

fof(f11536,plain,
    ( ~ ssItem(skaf65(sk1))
    | spl0_813 ),
    inference(component_clause,[status(thm)],[f11534]) ).

fof(f11537,plain,
    ( spl0_814
  <=> ssItem(skaf64(sk1)) ),
    introduced(split_symbol_definition) ).

fof(f11539,plain,
    ( ~ ssItem(skaf64(sk1))
    | spl0_814 ),
    inference(component_clause,[status(thm)],[f11537]) ).

fof(f11543,plain,
    ( spl0_816
  <=> leq(skaf64(sk1),skaf65(sk1)) ),
    introduced(split_symbol_definition) ).

fof(f11544,plain,
    ( leq(skaf64(sk1),skaf65(sk1))
    | ~ spl0_816 ),
    inference(component_clause,[status(thm)],[f11543]) ).

fof(f11548,plain,
    ( spl0_817
  <=> strictorderedP(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1)))) ),
    introduced(split_symbol_definition) ).

fof(f11550,plain,
    ( ~ strictorderedP(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))))
    | spl0_817 ),
    inference(component_clause,[status(thm)],[f11548]) ).

fof(f11551,plain,
    ( spl0_818
  <=> lt(skaf64(sk1),skaf65(sk1)) ),
    introduced(split_symbol_definition) ).

fof(f11552,plain,
    ( lt(skaf64(sk1),skaf65(sk1))
    | ~ spl0_818 ),
    inference(component_clause,[status(thm)],[f11551]) ).

fof(f11554,plain,
    ( ~ ssList(skaf68(sk1))
    | ~ ssList(skaf67(sk1))
    | ~ ssList(skaf66(sk1))
    | ~ ssItem(skaf65(sk1))
    | ~ ssItem(skaf64(sk1))
    | ~ strictorderedP(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))))
    | ~ ssList(sk1)
    | lt(skaf64(sk1),skaf65(sk1))
    | ~ spl0_751 ),
    inference(paramodulation,[status(thm)],[f11103,f463]) ).

fof(f11555,plain,
    ( ~ spl0_810
    | ~ spl0_811
    | ~ spl0_812
    | ~ spl0_813
    | ~ spl0_814
    | ~ spl0_817
    | ~ spl0_42
    | spl0_818
    | ~ spl0_751 ),
    inference(split_clause,[status(thm)],[f11554,f11525,f11528,f11531,f11534,f11537,f11548,f1263,f11551,f11102]) ).

fof(f11590,plain,
    ( ~ strictorderedP(sk1)
    | ~ spl0_751
    | spl0_817 ),
    inference(forward_demodulation,[status(thm)],[f11103,f11550]) ).

fof(f11591,plain,
    ( $false
    | ~ spl0_751
    | spl0_817 ),
    inference(forward_subsumption_resolution,[status(thm)],[f11590,f470]) ).

fof(f11592,plain,
    ( ~ spl0_751
    | spl0_817 ),
    inference(contradiction_clause,[status(thm)],[f11591]) ).

fof(f11602,plain,
    ( $false
    | spl0_814 ),
    inference(forward_subsumption_resolution,[status(thm)],[f11539,f224]) ).

fof(f11603,plain,
    spl0_814,
    inference(contradiction_clause,[status(thm)],[f11602]) ).

fof(f11604,plain,
    ( $false
    | spl0_811 ),
    inference(forward_subsumption_resolution,[status(thm)],[f11530,f221]) ).

fof(f11605,plain,
    spl0_811,
    inference(contradiction_clause,[status(thm)],[f11604]) ).

fof(f11606,plain,
    ( $false
    | spl0_812 ),
    inference(forward_subsumption_resolution,[status(thm)],[f11533,f222]) ).

fof(f11607,plain,
    spl0_812,
    inference(contradiction_clause,[status(thm)],[f11606]) ).

fof(f11609,plain,
    ( $false
    | spl0_813 ),
    inference(forward_subsumption_resolution,[status(thm)],[f11536,f223]) ).

fof(f11610,plain,
    spl0_813,
    inference(contradiction_clause,[status(thm)],[f11609]) ).

fof(f11611,plain,
    ( $false
    | spl0_810 ),
    inference(forward_subsumption_resolution,[status(thm)],[f11527,f220]) ).

fof(f11612,plain,
    spl0_810,
    inference(contradiction_clause,[status(thm)],[f11611]) ).

fof(f11628,plain,
    ( ~ ssItem(skaf65(sk1))
    | ~ ssItem(skaf64(sk1))
    | leq(skaf64(sk1),skaf65(sk1))
    | ~ spl0_818 ),
    inference(resolution,[status(thm)],[f11552,f299]) ).

fof(f11629,plain,
    ( ~ spl0_813
    | ~ spl0_814
    | spl0_816
    | ~ spl0_818 ),
    inference(split_clause,[status(thm)],[f11628,f11534,f11537,f11543,f11551]) ).

fof(f11630,plain,
    ( ~ ssList(sk1)
    | totalorderedP(sk1)
    | ~ spl0_816 ),
    inference(resolution,[status(thm)],[f11544,f285]) ).

fof(f11631,plain,
    ( ~ spl0_42
    | spl0_61
    | ~ spl0_816 ),
    inference(split_clause,[status(thm)],[f11630,f1263,f1606,f11543]) ).

fof(f11654,plain,
    ( $false
    | ~ spl0_61 ),
    inference(forward_subsumption_resolution,[status(thm)],[f1607,f431]) ).

fof(f11655,plain,
    ~ spl0_61,
    inference(contradiction_clause,[status(thm)],[f11654]) ).

fof(f11656,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f1324,f11106,f11555,f11592,f11603,f11605,f11607,f11610,f11612,f11629,f11631,f11655]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC264-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34  % Computer : n006.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Tue May 30 11:15:32 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.14/0.35  % Drodi V3.5.1
% 4.82/1.01  % Refutation found
% 4.82/1.01  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 4.82/1.01  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 4.82/1.05  % Elapsed time: 0.692721 seconds
% 4.82/1.05  % CPU time: 5.232685 seconds
% 4.82/1.05  % Memory used: 100.193 MB
%------------------------------------------------------------------------------