TSTP Solution File: SWC124+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC124+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n025.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:21 EDT 2023
% Result : Theorem 0.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC124+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 11:33:42 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.36 % Drodi V3.5.1
% 0.20/0.38 % Refutation found
% 0.20/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.38 % SZS output start CNFRefutation for theBenchmark
% 0.20/0.38 fof(f7,axiom,(
% 0.20/0.38 (! [U] :( ssList(U)=> (! [V] :( ssList(V)=> ( segmentP(U,V)<=> (? [W] :( ssList(W)& (? [X] :( ssList(X)& app(app(W,V),X) = U ) )) )) ) )) )),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.38 fof(f15,axiom,(
% 0.20/0.38 (! [U] :( ssList(U)=> (! [V] :( ssList(V)=> ( neq(U,V)<=> U != V ) ) )) )),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.38 fof(f17,axiom,(
% 0.20/0.38 ssList(nil) ),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.38 fof(f28,axiom,(
% 0.20/0.38 (! [U] :( ssList(U)=> app(nil,U) = U ) )),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.38 fof(f84,axiom,(
% 0.20/0.38 (! [U] :( ssList(U)=> app(U,nil) = U ) )),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.38 fof(f96,conjecture,(
% 0.20/0.38 (! [U] :( ssList(U)=> (! [V] :( ssList(V)=> (! [W] :( ssList(W)=> (! [X] :( ssList(X)=> ( V != X| U != W| ~ neq(V,nil)| (! [Y] :( ssList(Y)=> ( app(W,Y) != X| ~ totalorderedP(W)| (? [Z] :( ssItem(Z)& (? [X1] :( ssList(X1)& app(cons(Z,nil),X1) = Y& (? [X2] :( ssItem(X2)& (? [X3] :( ssList(X3)& app(X3,cons(X2,nil)) = W& leq(X2,Z) ) )) )) )) )) ))| ( nil != X& nil = W )| ( neq(U,nil)& segmentP(V,U) ) ) ) )) )) )) )),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.38 fof(f97,negated_conjecture,(
% 0.20/0.38 ~((! [U] :( ssList(U)=> (! [V] :( ssList(V)=> (! [W] :( ssList(W)=> (! [X] :( ssList(X)=> ( V != X| U != W| ~ neq(V,nil)| (! [Y] :( ssList(Y)=> ( app(W,Y) != X| ~ totalorderedP(W)| (? [Z] :( ssItem(Z)& (? [X1] :( ssList(X1)& app(cons(Z,nil),X1) = Y& (? [X2] :( ssItem(X2)& (? [X3] :( ssList(X3)& app(X3,cons(X2,nil)) = W& leq(X2,Z) ) )) )) )) )) ))| ( nil != X& nil = W )| ( neq(U,nil)& segmentP(V,U) ) ) ) )) )) )) ))),
% 0.20/0.38 inference(negated_conjecture,[status(cth)],[f96])).
% 0.20/0.38 fof(f131,plain,(
% 0.20/0.38 ![U]: (~ssList(U)|(![V]: (~ssList(V)|(segmentP(U,V)<=>(?[W]: (ssList(W)&(?[X]: (ssList(X)&app(app(W,V),X)=U))))))))),
% 0.20/0.38 inference(pre_NNF_transformation,[status(esa)],[f7])).
% 0.20/0.38 fof(f132,plain,(
% 0.20/0.38 ![U]: (~ssList(U)|(![V]: (~ssList(V)|((~segmentP(U,V)|(?[W]: (ssList(W)&(?[X]: (ssList(X)&app(app(W,V),X)=U)))))&(segmentP(U,V)|(![W]: (~ssList(W)|(![X]: (~ssList(X)|~app(app(W,V),X)=U)))))))))),
% 0.20/0.38 inference(NNF_transformation,[status(esa)],[f131])).
% 0.20/0.38 fof(f133,plain,(
% 0.20/0.38 ![U]: (~ssList(U)|(![V]: (~ssList(V)|((~segmentP(U,V)|(ssList(sk0_7(V,U))&(ssList(sk0_8(V,U))&app(app(sk0_7(V,U),V),sk0_8(V,U))=U)))&(segmentP(U,V)|(![W]: (~ssList(W)|(![X]: (~ssList(X)|~app(app(W,V),X)=U)))))))))),
% 0.20/0.38 inference(skolemization,[status(esa)],[f132])).
% 0.20/0.38 fof(f137,plain,(
% 0.20/0.38 ![X0,X1,X2,X3]: (~ssList(X0)|~ssList(X1)|segmentP(X0,X1)|~ssList(X2)|~ssList(X3)|~app(app(X2,X1),X3)=X0)),
% 0.20/0.38 inference(cnf_transformation,[status(esa)],[f133])).
% 0.20/0.38 fof(f217,plain,(
% 0.20/0.38 ![U]: (~ssList(U)|(![V]: (~ssList(V)|(neq(U,V)<=>~U=V))))),
% 0.20/0.38 inference(pre_NNF_transformation,[status(esa)],[f15])).
% 0.20/0.38 fof(f218,plain,(
% 0.20/0.38 ![U]: (~ssList(U)|(![V]: (~ssList(V)|((~neq(U,V)|~U=V)&(neq(U,V)|U=V)))))),
% 0.20/0.38 inference(NNF_transformation,[status(esa)],[f217])).
% 0.20/0.38 fof(f219,plain,(
% 0.20/0.38 ![X0,X1]: (~ssList(X0)|~ssList(X1)|~neq(X0,X1)|~X0=X1)),
% 0.20/0.38 inference(cnf_transformation,[status(esa)],[f218])).
% 0.20/0.38 fof(f220,plain,(
% 0.20/0.38 ![X0,X1]: (~ssList(X0)|~ssList(X1)|neq(X0,X1)|X0=X1)),
% 0.20/0.38 inference(cnf_transformation,[status(esa)],[f218])).
% 0.20/0.38 fof(f223,plain,(
% 0.20/0.38 ssList(nil)),
% 0.20/0.38 inference(cnf_transformation,[status(esa)],[f17])).
% 0.20/0.38 fof(f248,plain,(
% 0.20/0.38 ![U]: (~ssList(U)|app(nil,U)=U)),
% 0.20/0.38 inference(pre_NNF_transformation,[status(esa)],[f28])).
% 0.20/0.38 fof(f249,plain,(
% 0.20/0.38 ![X0]: (~ssList(X0)|app(nil,X0)=X0)),
% 0.20/0.38 inference(cnf_transformation,[status(esa)],[f248])).
% 0.20/0.38 fof(f388,plain,(
% 0.20/0.38 ![U]: (~ssList(U)|app(U,nil)=U)),
% 0.20/0.38 inference(pre_NNF_transformation,[status(esa)],[f84])).
% 0.20/0.38 fof(f389,plain,(
% 0.20/0.38 ![X0]: (~ssList(X0)|app(X0,nil)=X0)),
% 0.20/0.38 inference(cnf_transformation,[status(esa)],[f388])).
% 0.20/0.38 fof(f415,plain,(
% 0.20/0.38 (?[U]: (ssList(U)&(?[V]: (ssList(V)&(?[W]: (ssList(W)&(?[X]: (ssList(X)&(((((V=X&U=W)&neq(V,nil))&(?[Y]: (ssList(Y)&((app(W,Y)=X&totalorderedP(W))&(![Z]: (~ssItem(Z)|(![X1]: ((~ssList(X1)|~app(cons(Z,nil),X1)=Y)|(![X2]: (~ssItem(X2)|(![X3]: ((~ssList(X3)|~app(X3,cons(X2,nil))=W)|~leq(X2,Z)))))))))))))&(nil=X|~nil=W))&(~neq(U,nil)|~segmentP(V,U)))))))))))),
% 0.20/0.48 inference(pre_NNF_transformation,[status(esa)],[f97])).
% 0.20/0.48 fof(f416,plain,(
% 0.20/0.48 ?[U]: (ssList(U)&(?[V]: (ssList(V)&(?[W]: (ssList(W)&(?[X]: (ssList(X)&(((((V=X&U=W)&neq(V,nil))&(?[Y]: (ssList(Y)&((app(W,Y)=X&totalorderedP(W))&(![Z]: (~ssItem(Z)|((![X1]: (~ssList(X1)|~app(cons(Z,nil),X1)=Y))|(![X2]: (~ssItem(X2)|((![X3]: (~ssList(X3)|~app(X3,cons(X2,nil))=W))|~leq(X2,Z)))))))))))&(nil=X|~nil=W))&(~neq(U,nil)|~segmentP(V,U))))))))))),
% 0.20/0.48 inference(miniscoping,[status(esa)],[f415])).
% 0.20/0.48 fof(f417,plain,(
% 0.20/0.48 (ssList(sk0_47)&(ssList(sk0_48)&(ssList(sk0_49)&(ssList(sk0_50)&(((((sk0_48=sk0_50&sk0_47=sk0_49)&neq(sk0_48,nil))&(ssList(sk0_51)&((app(sk0_49,sk0_51)=sk0_50&totalorderedP(sk0_49))&(![Z]: (~ssItem(Z)|((![X1]: (~ssList(X1)|~app(cons(Z,nil),X1)=sk0_51))|(![X2]: (~ssItem(X2)|((![X3]: (~ssList(X3)|~app(X3,cons(X2,nil))=sk0_49))|~leq(X2,Z))))))))))&(nil=sk0_50|~nil=sk0_49))&(~neq(sk0_47,nil)|~segmentP(sk0_48,sk0_47)))))))),
% 0.20/0.48 inference(skolemization,[status(esa)],[f416])).
% 0.20/0.48 fof(f418,plain,(
% 0.20/0.48 ssList(sk0_47)),
% 0.20/0.48 inference(cnf_transformation,[status(esa)],[f417])).
% 0.20/0.48 fof(f419,plain,(
% 0.20/0.48 ssList(sk0_48)),
% 0.20/0.48 inference(cnf_transformation,[status(esa)],[f417])).
% 0.20/0.48 fof(f422,plain,(
% 0.20/0.48 sk0_48=sk0_50),
% 0.20/0.48 inference(cnf_transformation,[status(esa)],[f417])).
% 0.20/0.48 fof(f423,plain,(
% 0.20/0.48 sk0_47=sk0_49),
% 0.20/0.48 inference(cnf_transformation,[status(esa)],[f417])).
% 0.20/0.48 fof(f424,plain,(
% 0.20/0.48 neq(sk0_48,nil)),
% 0.20/0.48 inference(cnf_transformation,[status(esa)],[f417])).
% 0.20/0.48 fof(f425,plain,(
% 0.20/0.48 ssList(sk0_51)),
% 0.20/0.48 inference(cnf_transformation,[status(esa)],[f417])).
% 0.20/0.48 fof(f426,plain,(
% 0.20/0.48 app(sk0_49,sk0_51)=sk0_50),
% 0.20/0.48 inference(cnf_transformation,[status(esa)],[f417])).
% 0.20/0.48 fof(f429,plain,(
% 0.20/0.48 nil=sk0_50|~nil=sk0_49),
% 0.20/0.48 inference(cnf_transformation,[status(esa)],[f417])).
% 0.20/0.48 fof(f430,plain,(
% 0.20/0.48 ~neq(sk0_47,nil)|~segmentP(sk0_48,sk0_47)),
% 0.20/0.48 inference(cnf_transformation,[status(esa)],[f417])).
% 0.20/0.48 fof(f431,plain,(
% 0.20/0.48 spl0_0 <=> nil=sk0_50),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f432,plain,(
% 0.20/0.48 nil=sk0_50|~spl0_0),
% 0.20/0.48 inference(component_clause,[status(thm)],[f431])).
% 0.20/0.48 fof(f434,plain,(
% 0.20/0.48 spl0_1 <=> nil=sk0_49),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f436,plain,(
% 0.20/0.48 ~nil=sk0_49|spl0_1),
% 0.20/0.48 inference(component_clause,[status(thm)],[f434])).
% 0.20/0.48 fof(f437,plain,(
% 0.20/0.48 spl0_0|~spl0_1),
% 0.20/0.48 inference(split_clause,[status(thm)],[f429,f431,f434])).
% 0.20/0.48 fof(f438,plain,(
% 0.20/0.48 spl0_2 <=> neq(sk0_47,nil)),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f440,plain,(
% 0.20/0.48 ~neq(sk0_47,nil)|spl0_2),
% 0.20/0.48 inference(component_clause,[status(thm)],[f438])).
% 0.20/0.48 fof(f441,plain,(
% 0.20/0.48 spl0_3 <=> segmentP(sk0_48,sk0_47)),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f444,plain,(
% 0.20/0.48 ~spl0_2|~spl0_3),
% 0.20/0.48 inference(split_clause,[status(thm)],[f430,f438,f441])).
% 0.20/0.48 fof(f451,plain,(
% 0.20/0.48 ![X0,X1,X2]: (~ssList(app(app(X0,X1),X2))|~ssList(X1)|segmentP(app(app(X0,X1),X2),X1)|~ssList(X0)|~ssList(X2))),
% 0.20/0.48 inference(destructive_equality_resolution,[status(esa)],[f137])).
% 0.20/0.48 fof(f460,plain,(
% 0.20/0.48 ![X1]: (~ssList(X1)|~ssList(X1)|~neq(X1,X1))),
% 0.20/0.48 inference(destructive_equality_resolution,[status(esa)],[f219])).
% 0.20/0.48 fof(f461,plain,(
% 0.20/0.48 ![X0]: (~ssList(X0)|~neq(X0,X0))),
% 0.20/0.48 inference(duplicate_literals_removal,[status(esa)],[f460])).
% 0.20/0.48 fof(f484,plain,(
% 0.20/0.48 ~nil=sk0_47|spl0_1),
% 0.20/0.48 inference(forward_demodulation,[status(thm)],[f423,f436])).
% 0.20/0.48 fof(f485,plain,(
% 0.20/0.48 app(sk0_47,sk0_51)=sk0_50),
% 0.20/0.48 inference(forward_demodulation,[status(thm)],[f423,f426])).
% 0.20/0.48 fof(f486,plain,(
% 0.20/0.48 app(sk0_47,sk0_51)=sk0_48),
% 0.20/0.48 inference(forward_demodulation,[status(thm)],[f422,f485])).
% 0.20/0.48 fof(f490,plain,(
% 0.20/0.48 spl0_5 <=> ssList(sk0_51)),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f492,plain,(
% 0.20/0.48 ~ssList(sk0_51)|spl0_5),
% 0.20/0.48 inference(component_clause,[status(thm)],[f490])).
% 0.20/0.48 fof(f493,plain,(
% 0.20/0.48 spl0_6 <=> ssList(sk0_47)),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f495,plain,(
% 0.20/0.48 ~ssList(sk0_47)|spl0_6),
% 0.20/0.48 inference(component_clause,[status(thm)],[f493])).
% 0.20/0.48 fof(f498,plain,(
% 0.20/0.48 $false|spl0_6),
% 0.20/0.48 inference(forward_subsumption_resolution,[status(thm)],[f495,f418])).
% 0.20/0.48 fof(f499,plain,(
% 0.20/0.48 spl0_6),
% 0.20/0.48 inference(contradiction_clause,[status(thm)],[f498])).
% 0.20/0.48 fof(f500,plain,(
% 0.20/0.48 $false|spl0_5),
% 0.20/0.48 inference(forward_subsumption_resolution,[status(thm)],[f492,f425])).
% 0.20/0.48 fof(f501,plain,(
% 0.20/0.48 spl0_5),
% 0.20/0.48 inference(contradiction_clause,[status(thm)],[f500])).
% 0.20/0.48 fof(f557,plain,(
% 0.20/0.48 app(nil,sk0_47)=sk0_47),
% 0.20/0.48 inference(resolution,[status(thm)],[f249,f418])).
% 0.20/0.48 fof(f561,plain,(
% 0.20/0.48 spl0_16 <=> ssList(nil)),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f563,plain,(
% 0.20/0.48 ~ssList(nil)|spl0_16),
% 0.20/0.48 inference(component_clause,[status(thm)],[f561])).
% 0.20/0.48 fof(f566,plain,(
% 0.20/0.48 $false|spl0_16),
% 0.20/0.48 inference(forward_subsumption_resolution,[status(thm)],[f563,f223])).
% 0.20/0.48 fof(f567,plain,(
% 0.20/0.48 spl0_16),
% 0.20/0.48 inference(contradiction_clause,[status(thm)],[f566])).
% 0.20/0.48 fof(f580,plain,(
% 0.20/0.48 spl0_19 <=> ~ssList(app(sk0_47,X0))|segmentP(app(app(nil,sk0_47),X0),sk0_47)|~ssList(X0)),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f581,plain,(
% 0.20/0.48 ![X0]: (~ssList(app(sk0_47,X0))|segmentP(app(app(nil,sk0_47),X0),sk0_47)|~ssList(X0)|~spl0_19)),
% 0.20/0.48 inference(component_clause,[status(thm)],[f580])).
% 0.20/0.48 fof(f583,plain,(
% 0.20/0.48 ![X0]: (~ssList(app(sk0_47,X0))|~ssList(sk0_47)|segmentP(app(app(nil,sk0_47),X0),sk0_47)|~ssList(nil)|~ssList(X0))),
% 0.20/0.48 inference(paramodulation,[status(thm)],[f557,f451])).
% 0.20/0.48 fof(f584,plain,(
% 0.20/0.48 spl0_19|~spl0_6|~spl0_16),
% 0.20/0.48 inference(split_clause,[status(thm)],[f583,f580,f493,f561])).
% 0.20/0.48 fof(f585,plain,(
% 0.20/0.48 ![X0]: (~ssList(app(sk0_47,X0))|segmentP(app(sk0_47,X0),sk0_47)|~ssList(X0)|~spl0_19)),
% 0.20/0.48 inference(forward_demodulation,[status(thm)],[f557,f581])).
% 0.20/0.48 fof(f586,plain,(
% 0.20/0.48 spl0_20 <=> ssList(app(sk0_47,sk0_51))),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f588,plain,(
% 0.20/0.48 ~ssList(app(sk0_47,sk0_51))|spl0_20),
% 0.20/0.48 inference(component_clause,[status(thm)],[f586])).
% 0.20/0.48 fof(f589,plain,(
% 0.20/0.48 ~ssList(app(sk0_47,sk0_51))|segmentP(sk0_48,sk0_47)|~ssList(sk0_51)|~spl0_19),
% 0.20/0.48 inference(paramodulation,[status(thm)],[f486,f585])).
% 0.20/0.48 fof(f590,plain,(
% 0.20/0.48 ~spl0_20|spl0_3|~spl0_5|~spl0_19),
% 0.20/0.48 inference(split_clause,[status(thm)],[f589,f586,f441,f490,f580])).
% 0.20/0.48 fof(f591,plain,(
% 0.20/0.48 ~ssList(sk0_48)|spl0_20),
% 0.20/0.48 inference(forward_demodulation,[status(thm)],[f486,f588])).
% 0.20/0.48 fof(f592,plain,(
% 0.20/0.48 $false|spl0_20),
% 0.20/0.48 inference(forward_subsumption_resolution,[status(thm)],[f591,f419])).
% 0.20/0.48 fof(f593,plain,(
% 0.20/0.48 spl0_20),
% 0.20/0.48 inference(contradiction_clause,[status(thm)],[f592])).
% 0.20/0.48 fof(f603,plain,(
% 0.20/0.48 app(sk0_51,nil)=sk0_51),
% 0.20/0.48 inference(resolution,[status(thm)],[f389,f425])).
% 0.20/0.48 fof(f605,plain,(
% 0.20/0.48 app(sk0_48,nil)=sk0_48),
% 0.20/0.48 inference(resolution,[status(thm)],[f389,f419])).
% 0.20/0.48 fof(f606,plain,(
% 0.20/0.48 app(sk0_47,nil)=sk0_47),
% 0.20/0.48 inference(resolution,[status(thm)],[f389,f418])).
% 0.20/0.48 fof(f607,plain,(
% 0.20/0.48 spl0_22 <=> ssList(app(sk0_51,nil))),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f609,plain,(
% 0.20/0.48 ~ssList(app(sk0_51,nil))|spl0_22),
% 0.20/0.48 inference(component_clause,[status(thm)],[f607])).
% 0.20/0.48 fof(f620,plain,(
% 0.20/0.48 ~ssList(sk0_51)|spl0_22),
% 0.20/0.48 inference(forward_demodulation,[status(thm)],[f603,f609])).
% 0.20/0.48 fof(f621,plain,(
% 0.20/0.48 $false|spl0_22),
% 0.20/0.48 inference(forward_subsumption_resolution,[status(thm)],[f620,f425])).
% 0.20/0.48 fof(f622,plain,(
% 0.20/0.48 spl0_22),
% 0.20/0.48 inference(contradiction_clause,[status(thm)],[f621])).
% 0.20/0.48 fof(f625,plain,(
% 0.20/0.48 spl0_25 <=> ssList(app(sk0_48,nil))),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f627,plain,(
% 0.20/0.48 ~ssList(app(sk0_48,nil))|spl0_25),
% 0.20/0.48 inference(component_clause,[status(thm)],[f625])).
% 0.20/0.48 fof(f643,plain,(
% 0.20/0.48 ~ssList(sk0_48)|spl0_25),
% 0.20/0.48 inference(forward_demodulation,[status(thm)],[f605,f627])).
% 0.20/0.48 fof(f644,plain,(
% 0.20/0.48 $false|spl0_25),
% 0.20/0.48 inference(forward_subsumption_resolution,[status(thm)],[f643,f419])).
% 0.20/0.48 fof(f645,plain,(
% 0.20/0.48 spl0_25),
% 0.20/0.48 inference(contradiction_clause,[status(thm)],[f644])).
% 0.20/0.48 fof(f648,plain,(
% 0.20/0.48 spl0_29 <=> ssList(app(sk0_47,nil))),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f650,plain,(
% 0.20/0.48 ~ssList(app(sk0_47,nil))|spl0_29),
% 0.20/0.48 inference(component_clause,[status(thm)],[f648])).
% 0.20/0.48 fof(f661,plain,(
% 0.20/0.48 ~ssList(sk0_47)|spl0_29),
% 0.20/0.48 inference(forward_demodulation,[status(thm)],[f606,f650])).
% 0.20/0.48 fof(f662,plain,(
% 0.20/0.48 $false|spl0_29),
% 0.20/0.48 inference(forward_subsumption_resolution,[status(thm)],[f661,f418])).
% 0.20/0.48 fof(f663,plain,(
% 0.20/0.48 spl0_29),
% 0.20/0.48 inference(contradiction_clause,[status(thm)],[f662])).
% 0.20/0.48 fof(f697,plain,(
% 0.20/0.48 spl0_35 <=> sk0_47=nil),
% 0.20/0.48 introduced(split_symbol_definition)).
% 0.20/0.48 fof(f698,plain,(
% 0.20/0.48 sk0_47=nil|~spl0_35),
% 0.20/0.48 inference(component_clause,[status(thm)],[f697])).
% 0.20/0.48 fof(f700,plain,(
% 0.20/0.48 ~ssList(sk0_47)|~ssList(nil)|sk0_47=nil|spl0_2),
% 0.20/0.48 inference(resolution,[status(thm)],[f220,f440])).
% 0.20/0.48 fof(f701,plain,(
% 0.20/0.48 ~spl0_6|~spl0_16|spl0_35|spl0_2),
% 0.20/0.48 inference(split_clause,[status(thm)],[f700,f493,f561,f697,f438])).
% 0.20/0.48 fof(f712,plain,(
% 0.20/0.48 $false|spl0_1|~spl0_35),
% 0.20/0.48 inference(forward_subsumption_resolution,[status(thm)],[f698,f484])).
% 0.20/0.48 fof(f713,plain,(
% 0.20/0.48 spl0_1|~spl0_35),
% 0.20/0.48 inference(contradiction_clause,[status(thm)],[f712])).
% 0.20/0.48 fof(f714,plain,(
% 0.20/0.48 nil=sk0_48|~spl0_0),
% 0.20/0.48 inference(forward_demodulation,[status(thm)],[f422,f432])).
% 0.20/0.48 fof(f733,plain,(
% 0.20/0.48 neq(nil,nil)|~spl0_0),
% 0.20/0.48 inference(backward_demodulation,[status(thm)],[f714,f424])).
% 0.20/0.48 fof(f792,plain,(
% 0.20/0.48 ~ssList(nil)|~spl0_0),
% 0.20/0.48 inference(resolution,[status(thm)],[f733,f461])).
% 0.20/0.48 fof(f793,plain,(
% 0.20/0.48 ~spl0_16|~spl0_0),
% 0.20/0.48 inference(split_clause,[status(thm)],[f792,f561,f431])).
% 0.20/0.48 fof(f794,plain,(
% 0.20/0.48 $false),
% 0.20/0.48 inference(sat_refutation,[status(thm)],[f437,f444,f499,f501,f567,f584,f590,f593,f622,f645,f663,f701,f713,f793])).
% 0.20/0.48 % SZS output end CNFRefutation for theBenchmark.p
% 0.35/0.71 % Elapsed time: 0.135636 seconds
% 0.35/0.71 % CPU time: 0.060658 seconds
% 0.35/0.71 % Memory used: 6.241 MB
%------------------------------------------------------------------------------