TSTP Solution File: SWC271-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC271-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n018.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:09 EDT 2024
% Result : Unsatisfiable 58.63s 7.78s
% Output : CNFRefutation 59.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 24
% Syntax : Number of formulae : 75 ( 28 unt; 0 def)
% Number of atoms : 171 ( 10 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 173 ( 77 ~; 85 |; 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 : 36 ( 36 !; 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(f193,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f195,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f222,plain,
! [X0] : ssList(skaf68(X0)),
inference(cnf_transformation,[status(esa)],[f27]) ).
fof(f223,plain,
! [X0] : ssList(skaf67(X0)),
inference(cnf_transformation,[status(esa)],[f28]) ).
fof(f224,plain,
! [X0] : ssList(skaf66(X0)),
inference(cnf_transformation,[status(esa)],[f29]) ).
fof(f225,plain,
! [X0] : ssItem(skaf65(X0)),
inference(cnf_transformation,[status(esa)],[f30]) ).
fof(f226,plain,
! [X0] : ssItem(skaf64(X0)),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f287,plain,
! [X0] :
( ~ leq(skaf64(X0),skaf65(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[status(esa)],[f91]) ).
fof(f301,plain,
! [X0,X1] :
( ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f103]) ).
fof(f390,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(f416,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(f417,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)],[f416]) ).
fof(f426,plain,
ssList(sk1),
inference(cnf_transformation,[status(esa)],[f186]) ).
fof(f431,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f433,plain,
strictorderedP(sk3),
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f435,plain,
~ totalorderedP(sk1),
inference(cnf_transformation,[status(esa)],[f195]) ).
fof(f457,plain,
strictorderedP(sk1),
inference(forward_demodulation,[status(thm)],[f431,f433]) ).
fof(f587,plain,
( spl0_19
<=> ssList(sk1) ),
introduced(split_symbol_definition) ).
fof(f589,plain,
( ~ ssList(sk1)
| spl0_19 ),
inference(component_clause,[status(thm)],[f587]) ).
fof(f603,plain,
( $false
| spl0_19 ),
inference(forward_subsumption_resolution,[status(thm)],[f589,f426]) ).
fof(f604,plain,
spl0_19,
inference(contradiction_clause,[status(thm)],[f603]) ).
fof(f9638,plain,
( spl0_740
<=> totalorderedP(sk1) ),
introduced(split_symbol_definition) ).
fof(f9639,plain,
( totalorderedP(sk1)
| ~ spl0_740 ),
inference(component_clause,[status(thm)],[f9638]) ).
fof(f16995,plain,
( spl0_1654
<=> strictorderedP(sk1) ),
introduced(split_symbol_definition) ).
fof(f16997,plain,
( ~ strictorderedP(sk1)
| spl0_1654 ),
inference(component_clause,[status(thm)],[f16995]) ).
fof(f17059,plain,
( spl0_1657
<=> app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))) = sk1 ),
introduced(split_symbol_definition) ).
fof(f17060,plain,
( app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))) = sk1
| ~ spl0_1657 ),
inference(component_clause,[status(thm)],[f17059]) ).
fof(f17062,plain,
( totalorderedP(sk1)
| app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))) = sk1 ),
inference(resolution,[status(thm)],[f390,f426]) ).
fof(f17063,plain,
( spl0_740
| spl0_1657 ),
inference(split_clause,[status(thm)],[f17062,f9638,f17059]) ).
fof(f18135,plain,
( spl0_1687
<=> ssList(skaf68(sk1)) ),
introduced(split_symbol_definition) ).
fof(f18137,plain,
( ~ ssList(skaf68(sk1))
| spl0_1687 ),
inference(component_clause,[status(thm)],[f18135]) ).
fof(f18138,plain,
( spl0_1688
<=> ssList(skaf67(sk1)) ),
introduced(split_symbol_definition) ).
fof(f18140,plain,
( ~ ssList(skaf67(sk1))
| spl0_1688 ),
inference(component_clause,[status(thm)],[f18138]) ).
fof(f18141,plain,
( spl0_1689
<=> ssList(skaf66(sk1)) ),
introduced(split_symbol_definition) ).
fof(f18143,plain,
( ~ ssList(skaf66(sk1))
| spl0_1689 ),
inference(component_clause,[status(thm)],[f18141]) ).
fof(f18144,plain,
( spl0_1690
<=> ssItem(skaf65(sk1)) ),
introduced(split_symbol_definition) ).
fof(f18146,plain,
( ~ ssItem(skaf65(sk1))
| spl0_1690 ),
inference(component_clause,[status(thm)],[f18144]) ).
fof(f18147,plain,
( spl0_1691
<=> ssItem(skaf64(sk1)) ),
introduced(split_symbol_definition) ).
fof(f18149,plain,
( ~ ssItem(skaf64(sk1))
| spl0_1691 ),
inference(component_clause,[status(thm)],[f18147]) ).
fof(f18150,plain,
( spl0_1692
<=> lt(skaf64(sk1),skaf65(sk1)) ),
introduced(split_symbol_definition) ).
fof(f18151,plain,
( lt(skaf64(sk1),skaf65(sk1))
| ~ spl0_1692 ),
inference(component_clause,[status(thm)],[f18150]) ).
fof(f18153,plain,
( ~ ssList(skaf68(sk1))
| ~ ssList(skaf67(sk1))
| ~ ssList(skaf66(sk1))
| ~ ssItem(skaf65(sk1))
| ~ ssItem(skaf64(sk1))
| ~ strictorderedP(sk1)
| ~ ssList(sk1)
| lt(skaf64(sk1),skaf65(sk1))
| ~ spl0_1657 ),
inference(resolution,[status(thm)],[f17060,f417]) ).
fof(f18154,plain,
( ~ spl0_1687
| ~ spl0_1688
| ~ spl0_1689
| ~ spl0_1690
| ~ spl0_1691
| ~ spl0_1654
| ~ spl0_19
| spl0_1692
| ~ spl0_1657 ),
inference(split_clause,[status(thm)],[f18153,f18135,f18138,f18141,f18144,f18147,f16995,f587,f18150,f17059]) ).
fof(f18155,plain,
( spl0_1693
<=> leq(skaf64(sk1),skaf65(sk1)) ),
introduced(split_symbol_definition) ).
fof(f18156,plain,
( leq(skaf64(sk1),skaf65(sk1))
| ~ spl0_1693 ),
inference(component_clause,[status(thm)],[f18155]) ).
fof(f18238,plain,
( $false
| spl0_1691 ),
inference(forward_subsumption_resolution,[status(thm)],[f18149,f226]) ).
fof(f18239,plain,
spl0_1691,
inference(contradiction_clause,[status(thm)],[f18238]) ).
fof(f18240,plain,
( $false
| spl0_1688 ),
inference(forward_subsumption_resolution,[status(thm)],[f18140,f223]) ).
fof(f18241,plain,
spl0_1688,
inference(contradiction_clause,[status(thm)],[f18240]) ).
fof(f18242,plain,
( $false
| spl0_1690 ),
inference(forward_subsumption_resolution,[status(thm)],[f18146,f225]) ).
fof(f18243,plain,
spl0_1690,
inference(contradiction_clause,[status(thm)],[f18242]) ).
fof(f18244,plain,
( $false
| spl0_1687 ),
inference(forward_subsumption_resolution,[status(thm)],[f18137,f222]) ).
fof(f18245,plain,
spl0_1687,
inference(contradiction_clause,[status(thm)],[f18244]) ).
fof(f18246,plain,
( $false
| spl0_1689 ),
inference(forward_subsumption_resolution,[status(thm)],[f18143,f224]) ).
fof(f18247,plain,
spl0_1689,
inference(contradiction_clause,[status(thm)],[f18246]) ).
fof(f18353,plain,
( $false
| spl0_1654 ),
inference(forward_subsumption_resolution,[status(thm)],[f16997,f457]) ).
fof(f18354,plain,
spl0_1654,
inference(contradiction_clause,[status(thm)],[f18353]) ).
fof(f18642,plain,
( ~ ssItem(skaf65(sk1))
| ~ ssItem(skaf64(sk1))
| leq(skaf64(sk1),skaf65(sk1))
| ~ spl0_1692 ),
inference(resolution,[status(thm)],[f18151,f301]) ).
fof(f18643,plain,
( ~ spl0_1690
| ~ spl0_1691
| spl0_1693
| ~ spl0_1692 ),
inference(split_clause,[status(thm)],[f18642,f18144,f18147,f18155,f18150]) ).
fof(f18651,plain,
( ~ ssList(sk1)
| totalorderedP(sk1)
| ~ spl0_1693 ),
inference(resolution,[status(thm)],[f18156,f287]) ).
fof(f18652,plain,
( ~ spl0_19
| spl0_740
| ~ spl0_1693 ),
inference(split_clause,[status(thm)],[f18651,f587,f9638,f18155]) ).
fof(f18723,plain,
( $false
| ~ spl0_740 ),
inference(forward_subsumption_resolution,[status(thm)],[f9639,f435]) ).
fof(f18724,plain,
~ spl0_740,
inference(contradiction_clause,[status(thm)],[f18723]) ).
fof(f18725,plain,
$false,
inference(sat_refutation,[status(thm)],[f604,f17063,f18154,f18239,f18241,f18243,f18245,f18247,f18354,f18643,f18652,f18724]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC271-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 00:20:13 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % Drodi V3.6.0
% 58.63/7.78 % Refutation found
% 58.63/7.78 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 58.63/7.78 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 59.16/7.87 % Elapsed time: 7.501912 seconds
% 59.16/7.87 % CPU time: 59.398524 seconds
% 59.16/7.87 % Total memory used: 395.356 MB
% 59.16/7.87 % Net memory used: 378.262 MB
%------------------------------------------------------------------------------