TSTP Solution File: SWC264-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% 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 : n013.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 : Tue Apr 30 20:45:08 EDT 2024
% Result : Unsatisfiable 16.35s 2.43s
% Output : CNFRefutation 16.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 50 ( 22 unt; 0 def)
% Number of atoms : 159 ( 7 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 207 ( 98 ~; 107 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f27,axiom,
! [U] : ssList(skaf68(U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f28,axiom,
! [U] : ssList(skaf67(U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f29,axiom,
! [U] : ssList(skaf66(U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f30,axiom,
! [U] : ssItem(skaf65(U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f31,axiom,
! [U] : ssItem(skaf64(U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f91,axiom,
! [U] :
( ~ leq(skaf64(U),skaf65(U))
| ~ ssList(U)
| totalorderedP(U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f103,axiom,
! [U,V] :
( ~ lt(U,V)
| ~ ssItem(V)
| ~ ssItem(U)
| leq(U,V) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p') ).
fof(f186,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f191,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f192,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f193,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox2/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(f450,plain,
strictorderedP(sk1),
inference(backward_demodulation,[status(thm)],[f429,f430]) ).
fof(f2611,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ~ ssList(skaf68(X0))
| ~ ssList(skaf67(X0))
| ~ ssList(skaf66(X0))
| ~ ssItem(skaf65(X0))
| ~ ssItem(skaf64(X0))
| ~ strictorderedP(X0)
| ~ ssList(X0)
| lt(skaf64(X0),skaf65(X0)) ),
inference(resolution,[status(thm)],[f388,f415]) ).
fof(f2612,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ~ ssList(skaf68(X0))
| ~ ssList(skaf67(X0))
| ~ ssList(skaf66(X0))
| ~ ssItem(skaf65(X0))
| ~ ssItem(skaf64(X0))
| ~ strictorderedP(X0)
| lt(skaf64(X0),skaf65(X0)) ),
inference(duplicate_literals_removal,[status(esa)],[f2611]) ).
fof(f2613,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ~ ssList(skaf67(X0))
| ~ ssList(skaf66(X0))
| ~ ssItem(skaf65(X0))
| ~ ssItem(skaf64(X0))
| ~ strictorderedP(X0)
| lt(skaf64(X0),skaf65(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[f2612,f220]) ).
fof(f4840,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ~ ssList(skaf66(X0))
| ~ ssItem(skaf65(X0))
| ~ ssItem(skaf64(X0))
| ~ strictorderedP(X0)
| lt(skaf64(X0),skaf65(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[f2613,f221]) ).
fof(f4841,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ~ ssList(skaf66(X0))
| ~ ssItem(skaf65(X0))
| ~ ssItem(skaf64(X0))
| ~ strictorderedP(X0)
| ~ ssItem(skaf65(X0))
| ~ ssItem(skaf64(X0))
| leq(skaf64(X0),skaf65(X0)) ),
inference(resolution,[status(thm)],[f4840,f299]) ).
fof(f4842,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ~ ssList(skaf66(X0))
| ~ ssItem(skaf65(X0))
| ~ ssItem(skaf64(X0))
| ~ strictorderedP(X0)
| leq(skaf64(X0),skaf65(X0)) ),
inference(duplicate_literals_removal,[status(esa)],[f4841]) ).
fof(f4843,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ~ ssItem(skaf65(X0))
| ~ ssItem(skaf64(X0))
| ~ strictorderedP(X0)
| leq(skaf64(X0),skaf65(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[f4842,f222]) ).
fof(f4856,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ~ ssItem(skaf64(X0))
| ~ strictorderedP(X0)
| leq(skaf64(X0),skaf65(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[f4843,f223]) ).
fof(f4857,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ~ ssItem(skaf64(X0))
| ~ strictorderedP(X0)
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(resolution,[status(thm)],[f4856,f285]) ).
fof(f4858,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ~ ssItem(skaf64(X0))
| ~ strictorderedP(X0) ),
inference(duplicate_literals_removal,[status(esa)],[f4857]) ).
fof(f4859,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ~ strictorderedP(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f4858,f224]) ).
fof(f4960,plain,
( spl0_209
<=> totalorderedP(sk1) ),
introduced(split_symbol_definition) ).
fof(f4961,plain,
( totalorderedP(sk1)
| ~ spl0_209 ),
inference(component_clause,[status(thm)],[f4960]) ).
fof(f4963,plain,
( spl0_210
<=> strictorderedP(sk1) ),
introduced(split_symbol_definition) ).
fof(f4965,plain,
( ~ strictorderedP(sk1)
| spl0_210 ),
inference(component_clause,[status(thm)],[f4963]) ).
fof(f4966,plain,
( totalorderedP(sk1)
| ~ strictorderedP(sk1) ),
inference(resolution,[status(thm)],[f4859,f424]) ).
fof(f4967,plain,
( spl0_209
| ~ spl0_210 ),
inference(split_clause,[status(thm)],[f4966,f4960,f4963]) ).
fof(f4968,plain,
( $false
| spl0_210 ),
inference(forward_subsumption_resolution,[status(thm)],[f4965,f450]) ).
fof(f4969,plain,
spl0_210,
inference(contradiction_clause,[status(thm)],[f4968]) ).
fof(f4970,plain,
( $false
| ~ spl0_209 ),
inference(forward_subsumption_resolution,[status(thm)],[f4961,f431]) ).
fof(f4971,plain,
~ spl0_209,
inference(contradiction_clause,[status(thm)],[f4970]) ).
fof(f4972,plain,
$false,
inference(sat_refutation,[status(thm)],[f4967,f4969,f4971]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC264-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 29 23:54:19 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.36 % Drodi V3.6.0
% 16.35/2.43 % Refutation found
% 16.35/2.43 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 16.35/2.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 16.56/2.49 % Elapsed time: 2.125262 seconds
% 16.56/2.49 % CPU time: 16.677886 seconds
% 16.56/2.49 % Total memory used: 196.511 MB
% 16.56/2.49 % Net memory used: 189.307 MB
%------------------------------------------------------------------------------