TSTP Solution File: SWC045-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC045-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:39:02 EDT 2023
% Result : Unsatisfiable 1108.11s 139.78s
% Output : CNFRefutation 1108.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 32
% Syntax : Number of clauses : 111 ( 35 unt; 10 nHn; 86 RR)
% Number of literals : 294 ( 76 equ; 188 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-2 aty)
% Number of variables : 163 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause179) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause53) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause138) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause72) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',co1_1) ).
cnf(co1_7,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',co1_7) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause13) ).
cnf(co1_8,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',co1_8) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause157) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause86) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause120) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause47) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause116) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause145) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause8) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause97) ).
cnf(co1_6,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',co1_6) ).
cnf(co1_5,negated_conjecture,
nil = sk2,
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',co1_5) ).
cnf(co1_11,negated_conjecture,
( segmentP(sk4,app(app(cons(X1,nil),sk5(X1)),cons(X1,nil)))
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',co1_11) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause98) ).
cnf(clause127,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause127) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause56) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause149) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause74) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',clause119) ).
cnf(co1_10,negated_conjecture,
( ssList(sk5(X1))
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p',co1_10) ).
cnf(c_0_32,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
clause179 ).
cnf(c_0_33,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_34,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_35,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_36,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_37,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_38,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_39,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_40,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_41,negated_conjecture,
sk1 = sk3,
co1_7 ).
cnf(c_0_42,plain,
( ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,cons(X2,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_43,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_44,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_45,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_46,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_47,plain,
( ssItem(X1)
| duplicatefreeP(app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
( nil = X1
| ~ memberP(X2,skaf83(X1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(X2,X1)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45])]),c_0_39]) ).
cnf(c_0_50,plain,
( nil = X1
| memberP(X1,skaf83(X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_43]),c_0_44]),c_0_45])]) ).
cnf(c_0_51,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk3,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
nil != sk1,
co1_8 ).
cnf(c_0_53,plain,
( nil = X1
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,X1)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk3,sk3)) ),
inference(spm,[status(thm)],[c_0_51,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
sk3 != nil,
inference(rw,[status(thm)],[c_0_52,c_0_41]) ).
cnf(c_0_56,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_57,negated_conjecture,
ssItem(X1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_48])]),c_0_55]) ).
cnf(c_0_58,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_59,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_60,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_61,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_62,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_63,plain,
( app(cons(X1,X2),X3) = cons(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]) ).
cnf(c_0_64,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_57])]) ).
cnf(c_0_65,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_66,axiom,
ssList(nil),
clause8 ).
cnf(c_0_67,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_57])]) ).
cnf(c_0_68,plain,
( cons(skaf44(X1),X2) = app(X1,X2)
| ~ singletonP(X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]) ).
cnf(c_0_69,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_70,plain,
( ssList(cons(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_63]),c_0_64]) ).
cnf(c_0_71,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_65])]),c_0_66])]) ).
cnf(c_0_72,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_73,negated_conjecture,
sk2 = sk4,
co1_6 ).
cnf(c_0_74,negated_conjecture,
nil = sk2,
co1_5 ).
cnf(c_0_75,plain,
( cons(skaf44(X1),X2) = app(app(X1,nil),X2)
| ~ singletonP(X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_66])]) ).
cnf(c_0_76,plain,
( singletonP(cons(X1,nil))
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_57])]) ).
cnf(c_0_77,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_66])]) ).
cnf(c_0_78,plain,
( skaf44(X1) = hd(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_60]),c_0_61]),c_0_66])]) ).
cnf(c_0_79,negated_conjecture,
( segmentP(sk4,app(app(cons(X1,nil),sk5(X1)),cons(X1,nil)))
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
co1_11 ).
cnf(c_0_80,negated_conjecture,
sk4 = nil,
inference(rw,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_81,plain,
( app(app(X1,nil),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_75]),c_0_66])]) ).
cnf(c_0_82,plain,
singletonP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]) ).
cnf(c_0_83,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_84,plain,
( cons(hd(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_78]) ).
cnf(c_0_85,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause127 ).
cnf(c_0_86,negated_conjecture,
( segmentP(nil,app(app(cons(X1,nil),sk5(X1)),cons(X1,nil)))
| ~ memberP(sk3,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_87,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_88,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_89,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_90,plain,
app(app(cons(X1,nil),nil),nil) = cons(X1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_77])]) ).
cnf(c_0_91,plain,
( cons(X1,X2) != nil
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_57])]) ).
cnf(c_0_92,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_84,c_0_76]) ).
cnf(c_0_93,negated_conjecture,
( app(app(cons(X1,nil),sk5(X1)),cons(X1,nil)) = nil
| ~ memberP(sk3,X1)
| ~ ssItem(X1)
| ~ ssList(app(app(cons(X1,nil),sk5(X1)),cons(X1,nil))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_66])]),c_0_87]) ).
cnf(c_0_94,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_95,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_66])]) ).
cnf(c_0_96,plain,
app(cons(X1,nil),nil) = cons(X1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_90]),c_0_71]),c_0_77]),c_0_66])]) ).
cnf(c_0_97,plain,
( cons(X1,nil) != nil
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_66])]) ).
cnf(c_0_98,negated_conjecture,
( app(app(cons(X1,nil),sk5(X1)),cons(X1,nil)) = nil
| ~ memberP(sk3,X1)
| ~ ssList(app(app(cons(X1,nil),sk5(X1)),cons(X1,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_57])]) ).
cnf(c_0_99,plain,
( nil = X1
| app(X2,app(X3,X1)) != nil
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_88]),c_0_39]) ).
cnf(c_0_100,plain,
app(nil,cons(X1,nil)) = cons(X1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_77]),c_0_66])]) ).
cnf(c_0_101,plain,
cons(X1,nil) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_64]),c_0_66])]) ).
cnf(c_0_102,negated_conjecture,
( app(app(cons(X1,nil),sk5(X1)),cons(X1,nil)) = nil
| ~ memberP(sk3,X1)
| ~ ssList(app(cons(X1,nil),sk5(X1)))
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_98,c_0_39]) ).
cnf(c_0_103,plain,
( app(X1,cons(X2,nil)) != nil
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_77]),c_0_66])]),c_0_101]) ).
cnf(c_0_104,negated_conjecture,
( ssList(sk5(X1))
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
co1_10 ).
cnf(c_0_105,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssList(app(cons(X1,nil),sk5(X1))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_77])]),c_0_103]) ).
cnf(c_0_106,negated_conjecture,
( ssList(sk5(X1))
| ~ memberP(sk3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_57])]) ).
cnf(c_0_107,plain,
( skaf83(X1) = hd(X1)
| nil = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_43]),c_0_44]),c_0_45])]) ).
cnf(c_0_108,negated_conjecture,
~ memberP(sk3,X1),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_39]),c_0_77])]),c_0_106]) ).
cnf(c_0_109,plain,
( nil = X1
| memberP(X1,hd(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_107]) ).
cnf(c_0_110,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_48])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC045-1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n008.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 01:47:44 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.myBb4scZFo/E---3.1_24362.p
% 1108.11/139.78 # Version: 3.1pre001
% 1108.11/139.78 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1108.11/139.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1108.11/139.78 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1108.11/139.78 # Starting new_bool_3 with 300s (1) cores
% 1108.11/139.78 # Starting new_bool_1 with 300s (1) cores
% 1108.11/139.78 # Starting sh5l with 300s (1) cores
% 1108.11/139.78 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 24440 completed with status 0
% 1108.11/139.78 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1108.11/139.78 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1108.11/139.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1108.11/139.78 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1108.11/139.78 # No SInE strategy applied
% 1108.11/139.78 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1108.11/139.78 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1108.11/139.78 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1108.11/139.78 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1108.11/139.78 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1108.11/139.78 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1108.11/139.78 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1108.11/139.78 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 24450 completed with status 7
% 1108.11/139.78 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 1108.11/139.78 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 24449 completed with status 7
% 1108.11/139.78 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1108.11/139.78 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 24451 completed with status 7
% 1108.11/139.78 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 1108.11/139.78 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 29288 completed with status 0
% 1108.11/139.78 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 1108.11/139.78 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1108.11/139.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1108.11/139.78 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1108.11/139.78 # No SInE strategy applied
% 1108.11/139.78 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1108.11/139.78 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1108.11/139.78 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1108.11/139.78 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1108.11/139.78 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1108.11/139.78 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1108.11/139.78 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1108.11/139.78 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 24450 completed with status 7
% 1108.11/139.78 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 1108.11/139.78 # Preprocessing time : 0.003 s
% 1108.11/139.78 # Presaturation interreduction done
% 1108.11/139.78
% 1108.11/139.78 # Proof found!
% 1108.11/139.78 # SZS status Unsatisfiable
% 1108.11/139.78 # SZS output start CNFRefutation
% See solution above
% 1108.11/139.78 # Parsed axioms : 196
% 1108.11/139.78 # Removed by relevancy pruning/SinE : 0
% 1108.11/139.78 # Initial clauses : 196
% 1108.11/139.78 # Removed in clause preprocessing : 0
% 1108.11/139.78 # Initial clauses in saturation : 196
% 1108.11/139.79 # Processed clauses : 14231
% 1108.11/139.79 # ...of these trivial : 90
% 1108.11/139.79 # ...subsumed : 11651
% 1108.11/139.79 # ...remaining for further processing : 2490
% 1108.11/139.79 # Other redundant clauses eliminated : 786
% 1108.11/139.79 # Clauses deleted for lack of memory : 0
% 1108.11/139.79 # Backward-subsumed : 103
% 1108.11/139.79 # Backward-rewritten : 401
% 1108.11/139.79 # Generated clauses : 80818
% 1108.11/139.79 # ...of the previous two non-redundant : 75030
% 1108.11/139.79 # ...aggressively subsumed : 0
% 1108.11/139.79 # Contextual simplify-reflections : 473
% 1108.11/139.79 # Paramodulations : 80019
% 1108.11/139.79 # Factorizations : 0
% 1108.11/139.79 # NegExts : 0
% 1108.11/139.79 # Equation resolutions : 800
% 1108.11/139.79 # Total rewrite steps : 75905
% 1108.11/139.79 # Propositional unsat checks : 0
% 1108.11/139.79 # Propositional check models : 0
% 1108.11/139.79 # Propositional check unsatisfiable : 0
% 1108.11/139.79 # Propositional clauses : 0
% 1108.11/139.79 # Propositional clauses after purity: 0
% 1108.11/139.79 # Propositional unsat core size : 0
% 1108.11/139.79 # Propositional preprocessing time : 0.000
% 1108.11/139.79 # Propositional encoding time : 0.000
% 1108.11/139.79 # Propositional solver time : 0.000
% 1108.11/139.79 # Success case prop preproc time : 0.000
% 1108.11/139.79 # Success case prop encoding time : 0.000
% 1108.11/139.79 # Success case prop solver time : 0.000
% 1108.11/139.79 # Current number of processed clauses : 1775
% 1108.11/139.79 # Positive orientable unit clauses : 80
% 1108.11/139.79 # Positive unorientable unit clauses: 0
% 1108.11/139.79 # Negative unit clauses : 66
% 1108.11/139.79 # Non-unit-clauses : 1629
% 1108.11/139.79 # Current number of unprocessed clauses: 60150
% 1108.11/139.79 # ...number of literals in the above : 377248
% 1108.11/139.79 # Current number of archived formulas : 0
% 1108.11/139.79 # Current number of archived clauses : 691
% 1108.11/139.79 # Clause-clause subsumption calls (NU) : 1063513
% 1108.11/139.79 # Rec. Clause-clause subsumption calls : 140316
% 1108.11/139.79 # Non-unit clause-clause subsumptions : 7375
% 1108.11/139.79 # Unit Clause-clause subsumption calls : 4442
% 1108.11/139.79 # Rewrite failures with RHS unbound : 0
% 1108.11/139.79 # BW rewrite match attempts : 53
% 1108.11/139.79 # BW rewrite match successes : 34
% 1108.11/139.79 # Condensation attempts : 0
% 1108.11/139.79 # Condensation successes : 0
% 1108.11/139.79 # Termbank termtop insertions : 1859147
% 1108.11/139.79
% 1108.11/139.79 # -------------------------------------------------
% 1108.11/139.79 # User time : 404.910 s
% 1108.11/139.79 # System time : 5.833 s
% 1108.11/139.79 # Total time : 410.743 s
% 1108.11/139.79 # Maximum resident set size: 2128 pages
% 1108.11/139.79
% 1108.11/139.79 # -------------------------------------------------
% 1108.11/139.79 # User time : 682.826 s
% 1108.11/139.79 # System time : 9.743 s
% 1108.11/139.79 # Total time : 692.569 s
% 1108.11/139.79 # Maximum resident set size: 1848 pages
% 1108.11/139.79 % E---3.1 exiting
% 1108.11/139.79 % E---3.1 exiting
%------------------------------------------------------------------------------