TSTP Solution File: SWC273+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC273+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.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:10 EDT 2024
% Result : Theorem 23.83s 3.32s
% Output : CNFRefutation 23.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of formulae : 106 ( 17 unt; 0 def)
% Number of atoms : 401 ( 44 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 464 ( 169 ~; 179 |; 71 &)
% ( 21 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 25 ( 23 usr; 16 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 7 con; 0-2 aty)
% Number of variables : 113 ( 91 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
? [U] :
( ssItem(U)
& ? [V] :
( ssItem(V)
& U != V ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [U] :
( ssList(U)
=> ( totalorderedP(U)
<=> ! [V] :
( ssItem(V)
=> ! [W] :
( ssItem(W)
=> ! [X] :
( ssList(X)
=> ! [Y] :
( ssList(Y)
=> ! [Z] :
( ssList(Z)
=> ( app(app(X,cons(V,Y)),cons(W,Z)) = U
=> leq(V,W) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [U] :
( ssList(U)
=> ( strictorderedP(U)
<=> ! [V] :
( ssItem(V)
=> ! [W] :
( ssItem(W)
=> ! [X] :
( ssList(X)
=> ! [Y] :
( ssList(Y)
=> ! [Z] :
( ssList(Z)
=> ( app(app(X,cons(V,Y)),cons(W,Z)) = U
=> lt(V,W) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,axiom,
! [U] :
( ssList(U)
=> app(nil,U) = U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f84,axiom,
! [U] :
( ssList(U)
=> app(U,nil) = U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f93,axiom,
! [U] :
( ssItem(U)
=> ! [V] :
( ssItem(V)
=> ( lt(U,V)
<=> ( U != V
& leq(U,V) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ~ ssList(X)
| V != X
| U != W
| ~ segmentP(X,W)
| ~ strictorderedP(W)
| ? [Y] :
( ssList(Y)
& neq(W,Y)
& segmentP(X,Y)
& segmentP(Y,W)
& strictorderedP(Y) )
| totalorderedP(U) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ~ ssList(X)
| V != X
| U != W
| ~ segmentP(X,W)
| ~ strictorderedP(W)
| ? [Y] :
( ssList(Y)
& neq(W,Y)
& segmentP(X,Y)
& segmentP(Y,W)
& strictorderedP(Y) )
| totalorderedP(U) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f102,plain,
( ssItem(sk0_0)
& ssItem(sk0_1)
& sk0_0 != sk0_1 ),
inference(skolemization,[status(esa)],[f2]) ).
fof(f104,plain,
ssItem(sk0_1),
inference(cnf_transformation,[status(esa)],[f102]) ).
fof(f174,plain,
! [U] :
( ~ ssList(U)
| ( totalorderedP(U)
<=> ! [V] :
( ~ ssItem(V)
| ! [W] :
( ~ ssItem(W)
| ! [X] :
( ~ ssList(X)
| ! [Y] :
( ~ ssList(Y)
| ! [Z] :
( ~ ssList(Z)
| app(app(X,cons(V,Y)),cons(W,Z)) != U
| leq(V,W) ) ) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f11]) ).
fof(f175,plain,
! [U] :
( ~ ssList(U)
| ( ( ~ totalorderedP(U)
| ! [V] :
( ~ ssItem(V)
| ! [W] :
( ~ ssItem(W)
| ! [X] :
( ~ ssList(X)
| ! [Y] :
( ~ ssList(Y)
| ! [Z] :
( ~ ssList(Z)
| app(app(X,cons(V,Y)),cons(W,Z)) != U
| leq(V,W) ) ) ) ) ) )
& ( totalorderedP(U)
| ? [V] :
( ssItem(V)
& ? [W] :
( ssItem(W)
& ? [X] :
( ssList(X)
& ? [Y] :
( ssList(Y)
& ? [Z] :
( ssList(Z)
& app(app(X,cons(V,Y)),cons(W,Z)) = U
& ~ leq(V,W) ) ) ) ) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f174]) ).
fof(f176,plain,
! [U] :
( ~ ssList(U)
| ( ( ~ totalorderedP(U)
| ! [V] :
( ~ ssItem(V)
| ! [W] :
( ~ ssItem(W)
| ! [X] :
( ~ ssList(X)
| ! [Y] :
( ~ ssList(Y)
| ! [Z] :
( ~ ssList(Z)
| app(app(X,cons(V,Y)),cons(W,Z)) != U
| leq(V,W) ) ) ) ) ) )
& ( totalorderedP(U)
| ( ssItem(sk0_24(U))
& ssItem(sk0_25(U))
& ssList(sk0_26(U))
& ssList(sk0_27(U))
& ssList(sk0_28(U))
& app(app(sk0_26(U),cons(sk0_24(U),sk0_27(U))),cons(sk0_25(U),sk0_28(U))) = U
& ~ leq(sk0_24(U),sk0_25(U)) ) ) ) ),
inference(skolemization,[status(esa)],[f175]) ).
fof(f178,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ssItem(sk0_24(X0)) ),
inference(cnf_transformation,[status(esa)],[f176]) ).
fof(f179,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ssItem(sk0_25(X0)) ),
inference(cnf_transformation,[status(esa)],[f176]) ).
fof(f180,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ssList(sk0_26(X0)) ),
inference(cnf_transformation,[status(esa)],[f176]) ).
fof(f181,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ssList(sk0_27(X0)) ),
inference(cnf_transformation,[status(esa)],[f176]) ).
fof(f182,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ssList(sk0_28(X0)) ),
inference(cnf_transformation,[status(esa)],[f176]) ).
fof(f183,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| app(app(sk0_26(X0),cons(sk0_24(X0),sk0_27(X0))),cons(sk0_25(X0),sk0_28(X0))) = X0 ),
inference(cnf_transformation,[status(esa)],[f176]) ).
fof(f184,plain,
! [X0] :
( ~ ssList(X0)
| totalorderedP(X0)
| ~ leq(sk0_24(X0),sk0_25(X0)) ),
inference(cnf_transformation,[status(esa)],[f176]) ).
fof(f185,plain,
! [U] :
( ~ ssList(U)
| ( strictorderedP(U)
<=> ! [V] :
( ~ ssItem(V)
| ! [W] :
( ~ ssItem(W)
| ! [X] :
( ~ ssList(X)
| ! [Y] :
( ~ ssList(Y)
| ! [Z] :
( ~ ssList(Z)
| app(app(X,cons(V,Y)),cons(W,Z)) != U
| lt(V,W) ) ) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f12]) ).
fof(f186,plain,
! [U] :
( ~ ssList(U)
| ( ( ~ strictorderedP(U)
| ! [V] :
( ~ ssItem(V)
| ! [W] :
( ~ ssItem(W)
| ! [X] :
( ~ ssList(X)
| ! [Y] :
( ~ ssList(Y)
| ! [Z] :
( ~ ssList(Z)
| app(app(X,cons(V,Y)),cons(W,Z)) != U
| lt(V,W) ) ) ) ) ) )
& ( strictorderedP(U)
| ? [V] :
( ssItem(V)
& ? [W] :
( ssItem(W)
& ? [X] :
( ssList(X)
& ? [Y] :
( ssList(Y)
& ? [Z] :
( ssList(Z)
& app(app(X,cons(V,Y)),cons(W,Z)) = U
& ~ lt(V,W) ) ) ) ) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f185]) ).
fof(f187,plain,
! [U] :
( ~ ssList(U)
| ( ( ~ strictorderedP(U)
| ! [V] :
( ~ ssItem(V)
| ! [W] :
( ~ ssItem(W)
| ! [X] :
( ~ ssList(X)
| ! [Y] :
( ~ ssList(Y)
| ! [Z] :
( ~ ssList(Z)
| app(app(X,cons(V,Y)),cons(W,Z)) != U
| lt(V,W) ) ) ) ) ) )
& ( strictorderedP(U)
| ( ssItem(sk0_29(U))
& ssItem(sk0_30(U))
& ssList(sk0_31(U))
& ssList(sk0_32(U))
& ssList(sk0_33(U))
& app(app(sk0_31(U),cons(sk0_29(U),sk0_32(U))),cons(sk0_30(U),sk0_33(U))) = U
& ~ lt(sk0_29(U),sk0_30(U)) ) ) ) ),
inference(skolemization,[status(esa)],[f186]) ).
fof(f188,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ ssList(X0)
| ~ strictorderedP(X0)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| lt(X1,X2) ),
inference(cnf_transformation,[status(esa)],[f187]) ).
fof(f248,plain,
! [U] :
( ~ ssList(U)
| app(nil,U) = U ),
inference(pre_NNF_transformation,[status(esa)],[f28]) ).
fof(f249,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[status(esa)],[f248]) ).
fof(f339,plain,
totalorderedP(nil),
inference(cnf_transformation,[status(esa)],[f66]) ).
fof(f388,plain,
! [U] :
( ~ ssList(U)
| app(U,nil) = U ),
inference(pre_NNF_transformation,[status(esa)],[f84]) ).
fof(f389,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[status(esa)],[f388]) ).
fof(f406,plain,
! [U] :
( ~ ssItem(U)
| ! [V] :
( ~ ssItem(V)
| ( lt(U,V)
<=> ( U != V
& leq(U,V) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f93]) ).
fof(f407,plain,
! [U] :
( ~ ssItem(U)
| ! [V] :
( ~ ssItem(V)
| ( ( ~ lt(U,V)
| ( U != V
& leq(U,V) ) )
& ( lt(U,V)
| U = V
| ~ leq(U,V) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f406]) ).
fof(f409,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ lt(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f407]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& segmentP(X,W)
& strictorderedP(W)
& ! [Y] :
( ~ ssList(Y)
| ~ neq(W,Y)
| ~ segmentP(X,Y)
| ~ segmentP(Y,W)
| ~ strictorderedP(Y) )
& ~ totalorderedP(U) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& segmentP(X,W)
& strictorderedP(W)
& ! [Y] :
( ~ ssList(Y)
| ~ neq(W,Y)
| ~ segmentP(X,Y)
| ~ segmentP(Y,W)
| ~ strictorderedP(Y) ) )
& ~ totalorderedP(U) ) ) ),
inference(miniscoping,[status(esa)],[f415]) ).
fof(f417,plain,
( ssList(sk0_47)
& ssList(sk0_48)
& ssList(sk0_49)
& ssList(sk0_50)
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& segmentP(sk0_50,sk0_49)
& strictorderedP(sk0_49)
& ! [Y] :
( ~ ssList(Y)
| ~ neq(sk0_49,Y)
| ~ segmentP(sk0_50,Y)
| ~ segmentP(Y,sk0_49)
| ~ strictorderedP(Y) )
& ~ totalorderedP(sk0_47) ),
inference(skolemization,[status(esa)],[f416]) ).
fof(f418,plain,
ssList(sk0_47),
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f423,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f425,plain,
strictorderedP(sk0_49),
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f427,plain,
~ totalorderedP(sk0_47),
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f439,plain,
! [X0,X1,X2,X3,X4] :
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X4)
| lt(X1,X3) ),
inference(destructive_equality_resolution,[status(esa)],[f188]) ).
fof(f460,plain,
strictorderedP(sk0_47),
inference(forward_demodulation,[status(thm)],[f423,f425]) ).
fof(f468,plain,
( spl0_0
<=> ssList(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f470,plain,
( ~ ssList(sk0_47)
| spl0_0 ),
inference(component_clause,[status(thm)],[f468]) ).
fof(f477,plain,
( spl0_3
<=> strictorderedP(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f479,plain,
( ~ strictorderedP(sk0_47)
| spl0_3 ),
inference(component_clause,[status(thm)],[f477]) ).
fof(f498,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f479,f460]) ).
fof(f499,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f498]) ).
fof(f506,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f470,f418]) ).
fof(f507,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f506]) ).
fof(f588,plain,
( spl0_24
<=> nil = sk0_47 ),
introduced(split_symbol_definition) ).
fof(f589,plain,
( nil = sk0_47
| ~ spl0_24 ),
inference(component_clause,[status(thm)],[f588]) ).
fof(f775,plain,
( spl0_50
<=> ssItem(sk0_1) ),
introduced(split_symbol_definition) ).
fof(f777,plain,
( ~ ssItem(sk0_1)
| spl0_50 ),
inference(component_clause,[status(thm)],[f775]) ).
fof(f1266,plain,
( spl0_139
<=> strictorderedP(app(app(nil,sk0_47),nil)) ),
introduced(split_symbol_definition) ).
fof(f1268,plain,
( ~ strictorderedP(app(app(nil,sk0_47),nil))
| spl0_139 ),
inference(component_clause,[status(thm)],[f1266]) ).
fof(f1349,plain,
app(nil,sk0_47) = sk0_47,
inference(resolution,[status(thm)],[f249,f418]) ).
fof(f1412,plain,
app(sk0_47,nil) = sk0_47,
inference(resolution,[status(thm)],[f389,f418]) ).
fof(f1517,plain,
( spl0_167
<=> totalorderedP(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f1518,plain,
( totalorderedP(sk0_47)
| ~ spl0_167 ),
inference(component_clause,[status(thm)],[f1517]) ).
fof(f1520,plain,
( spl0_168
<=> ssList(sk0_26(sk0_47)) ),
introduced(split_symbol_definition) ).
fof(f1523,plain,
( totalorderedP(sk0_47)
| ssList(sk0_26(sk0_47)) ),
inference(resolution,[status(thm)],[f180,f418]) ).
fof(f1524,plain,
( spl0_167
| spl0_168 ),
inference(split_clause,[status(thm)],[f1523,f1517,f1520]) ).
fof(f1530,plain,
( $false
| ~ spl0_167 ),
inference(forward_subsumption_resolution,[status(thm)],[f1518,f427]) ).
fof(f1531,plain,
~ spl0_167,
inference(contradiction_clause,[status(thm)],[f1530]) ).
fof(f1532,plain,
( spl0_170
<=> ssList(sk0_27(sk0_47)) ),
introduced(split_symbol_definition) ).
fof(f1535,plain,
( totalorderedP(sk0_47)
| ssList(sk0_27(sk0_47)) ),
inference(resolution,[status(thm)],[f181,f418]) ).
fof(f1536,plain,
( spl0_167
| spl0_170 ),
inference(split_clause,[status(thm)],[f1535,f1517,f1532]) ).
fof(f1542,plain,
( spl0_172
<=> ssList(sk0_28(sk0_47)) ),
introduced(split_symbol_definition) ).
fof(f1545,plain,
( totalorderedP(sk0_47)
| ssList(sk0_28(sk0_47)) ),
inference(resolution,[status(thm)],[f182,f418]) ).
fof(f1546,plain,
( spl0_167
| spl0_172 ),
inference(split_clause,[status(thm)],[f1545,f1517,f1542]) ).
fof(f1592,plain,
( $false
| spl0_50 ),
inference(forward_subsumption_resolution,[status(thm)],[f777,f104]) ).
fof(f1593,plain,
spl0_50,
inference(contradiction_clause,[status(thm)],[f1592]) ).
fof(f7866,plain,
( spl0_1072
<=> ssItem(sk0_24(sk0_47)) ),
introduced(split_symbol_definition) ).
fof(f7869,plain,
( totalorderedP(sk0_47)
| ssItem(sk0_24(sk0_47)) ),
inference(resolution,[status(thm)],[f178,f418]) ).
fof(f7870,plain,
( spl0_167
| spl0_1072 ),
inference(split_clause,[status(thm)],[f7869,f1517,f7866]) ).
fof(f7936,plain,
( spl0_1084
<=> ssItem(sk0_25(sk0_47)) ),
introduced(split_symbol_definition) ).
fof(f7939,plain,
( totalorderedP(sk0_47)
| ssItem(sk0_25(sk0_47)) ),
inference(resolution,[status(thm)],[f179,f418]) ).
fof(f7940,plain,
( spl0_167
| spl0_1084 ),
inference(split_clause,[status(thm)],[f7939,f1517,f7936]) ).
fof(f8126,plain,
( spl0_1120
<=> app(app(sk0_26(sk0_47),cons(sk0_24(sk0_47),sk0_27(sk0_47))),cons(sk0_25(sk0_47),sk0_28(sk0_47))) = sk0_47 ),
introduced(split_symbol_definition) ).
fof(f8127,plain,
( app(app(sk0_26(sk0_47),cons(sk0_24(sk0_47),sk0_27(sk0_47))),cons(sk0_25(sk0_47),sk0_28(sk0_47))) = sk0_47
| ~ spl0_1120 ),
inference(component_clause,[status(thm)],[f8126]) ).
fof(f8129,plain,
( totalorderedP(sk0_47)
| app(app(sk0_26(sk0_47),cons(sk0_24(sk0_47),sk0_27(sk0_47))),cons(sk0_25(sk0_47),sk0_28(sk0_47))) = sk0_47 ),
inference(resolution,[status(thm)],[f183,f418]) ).
fof(f8130,plain,
( spl0_167
| spl0_1120 ),
inference(split_clause,[status(thm)],[f8129,f1517,f8126]) ).
fof(f8957,plain,
( spl0_1275
<=> lt(sk0_24(sk0_47),sk0_25(sk0_47)) ),
introduced(split_symbol_definition) ).
fof(f8958,plain,
( lt(sk0_24(sk0_47),sk0_25(sk0_47))
| ~ spl0_1275 ),
inference(component_clause,[status(thm)],[f8957]) ).
fof(f8965,plain,
( spl0_1277
<=> leq(sk0_24(sk0_47),sk0_25(sk0_47)) ),
introduced(split_symbol_definition) ).
fof(f8966,plain,
( leq(sk0_24(sk0_47),sk0_25(sk0_47))
| ~ spl0_1277 ),
inference(component_clause,[status(thm)],[f8965]) ).
fof(f9329,plain,
( ~ strictorderedP(app(sk0_47,nil))
| spl0_139 ),
inference(forward_demodulation,[status(thm)],[f1349,f1268]) ).
fof(f9330,plain,
( ~ strictorderedP(sk0_47)
| spl0_139 ),
inference(forward_demodulation,[status(thm)],[f1412,f9329]) ).
fof(f9331,plain,
( $false
| spl0_139 ),
inference(forward_subsumption_resolution,[status(thm)],[f9330,f460]) ).
fof(f9332,plain,
spl0_139,
inference(contradiction_clause,[status(thm)],[f9331]) ).
fof(f11262,plain,
( ~ totalorderedP(nil)
| ~ spl0_24 ),
inference(backward_demodulation,[status(thm)],[f589,f427]) ).
fof(f11263,plain,
( $false
| ~ spl0_24 ),
inference(forward_subsumption_resolution,[status(thm)],[f11262,f339]) ).
fof(f11264,plain,
~ spl0_24,
inference(contradiction_clause,[status(thm)],[f11263]) ).
fof(f11637,plain,
( ~ ssItem(sk0_24(sk0_47))
| ~ ssItem(sk0_25(sk0_47))
| leq(sk0_24(sk0_47),sk0_25(sk0_47))
| ~ spl0_1275 ),
inference(resolution,[status(thm)],[f8958,f409]) ).
fof(f11638,plain,
( ~ spl0_1072
| ~ spl0_1084
| spl0_1277
| ~ spl0_1275 ),
inference(split_clause,[status(thm)],[f11637,f7866,f7936,f8965,f8957]) ).
fof(f13382,plain,
( spl0_1852
<=> ssList(app(app(sk0_26(sk0_47),cons(sk0_24(sk0_47),sk0_27(sk0_47))),cons(sk0_25(sk0_47),sk0_28(sk0_47)))) ),
introduced(split_symbol_definition) ).
fof(f13384,plain,
( ~ ssList(app(app(sk0_26(sk0_47),cons(sk0_24(sk0_47),sk0_27(sk0_47))),cons(sk0_25(sk0_47),sk0_28(sk0_47))))
| spl0_1852 ),
inference(component_clause,[status(thm)],[f13382]) ).
fof(f13391,plain,
( ~ ssList(app(app(sk0_26(sk0_47),cons(sk0_24(sk0_47),sk0_27(sk0_47))),cons(sk0_25(sk0_47),sk0_28(sk0_47))))
| ~ strictorderedP(sk0_47)
| ~ ssItem(sk0_24(sk0_47))
| ~ ssItem(sk0_25(sk0_47))
| ~ ssList(sk0_26(sk0_47))
| ~ ssList(sk0_27(sk0_47))
| ~ ssList(sk0_28(sk0_47))
| lt(sk0_24(sk0_47),sk0_25(sk0_47))
| ~ spl0_1120 ),
inference(paramodulation,[status(thm)],[f8127,f439]) ).
fof(f13392,plain,
( ~ spl0_1852
| ~ spl0_3
| ~ spl0_1072
| ~ spl0_1084
| ~ spl0_168
| ~ spl0_170
| ~ spl0_172
| spl0_1275
| ~ spl0_1120 ),
inference(split_clause,[status(thm)],[f13391,f13382,f477,f7866,f7936,f1520,f1532,f1542,f8957,f8126]) ).
fof(f13440,plain,
( ~ ssList(sk0_47)
| ~ spl0_1120
| spl0_1852 ),
inference(forward_demodulation,[status(thm)],[f8127,f13384]) ).
fof(f13441,plain,
( $false
| ~ spl0_1120
| spl0_1852 ),
inference(forward_subsumption_resolution,[status(thm)],[f13440,f418]) ).
fof(f13442,plain,
( ~ spl0_1120
| spl0_1852 ),
inference(contradiction_clause,[status(thm)],[f13441]) ).
fof(f14754,plain,
( ~ ssList(sk0_47)
| totalorderedP(sk0_47)
| ~ spl0_1277 ),
inference(resolution,[status(thm)],[f8966,f184]) ).
fof(f14755,plain,
( ~ spl0_0
| spl0_167
| ~ spl0_1277 ),
inference(split_clause,[status(thm)],[f14754,f468,f1517,f8965]) ).
fof(f14766,plain,
$false,
inference(sat_refutation,[status(thm)],[f499,f507,f1524,f1531,f1536,f1546,f1593,f7870,f7940,f8130,f9332,f11264,f11638,f13392,f13442,f14755]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SWC273+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.29 % Computer : n009.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue Apr 30 00:05:26 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % Drodi V3.6.0
% 23.83/3.32 % Refutation found
% 23.83/3.32 % SZS status Theorem for theBenchmark: Theorem is valid
% 23.83/3.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 23.91/3.37 % Elapsed time: 3.059996 seconds
% 23.91/3.37 % CPU time: 24.099926 seconds
% 23.91/3.37 % Total memory used: 160.242 MB
% 23.91/3.37 % Net memory used: 156.459 MB
%------------------------------------------------------------------------------