TSTP Solution File: SWC383-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC383-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:40:44 EDT 2023
% Result : Unsatisfiable 2011.28s 253.60s
% Output : CNFRefutation 2011.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 38
% Syntax : Number of clauses : 110 ( 31 unt; 21 nHn; 100 RR)
% Number of literals : 287 ( 80 equ; 166 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-2 aty)
% Number of variables : 139 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause97) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause47) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause8) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause116) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',co1_6) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause104) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause96) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause86) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause98) ).
cnf(co1_10,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',co1_10) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',co1_8) ).
cnf(clause175,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause175) ).
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.x0d5nVbAIG/E---3.1_10016.p',clause157) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause85) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause173) ).
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.x0d5nVbAIG/E---3.1_10016.p',clause149) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause120) ).
cnf(co1_13,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',co1_13) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',co1_9) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause143) ).
cnf(clause168,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause168) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause73) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause49) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause56) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause48) ).
cnf(co1_16,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',co1_16) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',co1_5) ).
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.x0d5nVbAIG/E---3.1_10016.p',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause53) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',co1_2) ).
cnf(clause82,axiom,
( nil = X1
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause82) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause71) ).
cnf(co1_14,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',co1_14) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',co1_7) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.x0d5nVbAIG/E---3.1_10016.p',clause115) ).
cnf(c_0_38,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_39,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_40,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_41,axiom,
ssList(nil),
clause8 ).
cnf(c_0_42,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_43,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_44,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_45,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_46,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_47,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_48,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_49,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_38,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_50,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_10 ).
cnf(c_0_52,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_53,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_8 ).
cnf(c_0_54,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
clause175 ).
cnf(c_0_55,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_56,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_57,plain,
( cons(hd(cons(X1,X2)),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]) ).
cnf(c_0_58,plain,
( ssItem(hd(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_49]) ).
cnf(c_0_59,negated_conjecture,
( sk4 = nil
| singletonP(sk3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),c_0_53]) ).
cnf(c_0_60,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_61,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_62,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_63,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_13 ).
cnf(c_0_64,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_9 ).
cnf(c_0_65,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_66,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause168 ).
cnf(c_0_67,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_68,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_69,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_70,plain,
( memberP(X1,X2)
| app(X3,app(cons(X2,X4),X5)) != X1
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_71,negated_conjecture,
( cons(hd(sk3),nil) = sk3
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_51]),c_0_41])]),c_0_53]) ).
cnf(c_0_72,negated_conjecture,
( sk4 = nil
| ssItem(hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_52])]) ).
cnf(c_0_73,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_74,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
co1_16 ).
cnf(c_0_75,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_76,plain,
( segmentP(X1,X2)
| app(X3,app(X2,X4)) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_77,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| sk3 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_78,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_65]),c_0_56]) ).
cnf(c_0_79,plain,
( app(skaf47(X1,nil),skaf48(nil,X1)) = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_41]),c_0_68])]),c_0_69]) ).
cnf(c_0_80,negated_conjecture,
( sk4 = nil
| memberP(X1,hd(sk3))
| app(X2,app(sk3,X3)) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_41])]),c_0_72]) ).
cnf(c_0_81,plain,
( app(skaf47(X1,X2),app(X2,skaf48(X2,X1))) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_66]),c_0_68]),c_0_73])]) ).
cnf(c_0_82,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ singletonP(sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_44]),c_0_75]),c_0_44]) ).
cnf(c_0_83,negated_conjecture,
( sk3 = nil
| singletonP(X1)
| sk3 != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_63]),c_0_64]) ).
cnf(c_0_84,negated_conjecture,
( sk3 = nil
| segmentP(X1,sk3)
| app(X2,cons(sk5,X3)) != X1
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_52])]) ).
cnf(c_0_85,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_86,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_87,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_88,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_89,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_67]),c_0_41])]),c_0_56]) ).
cnf(c_0_90,axiom,
( nil = X1
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
clause82 ).
cnf(c_0_91,plain,
( rearsegP(X1,skaf48(nil,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_73]),c_0_68])]) ).
cnf(c_0_92,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_93,negated_conjecture,
( sk4 = nil
| memberP(X1,hd(sk3))
| ~ segmentP(X1,sk3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_68]),c_0_73]),c_0_52])])]) ).
cnf(c_0_94,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk4,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_52])]) ).
cnf(c_0_95,negated_conjecture,
( sk3 = nil
| segmentP(X1,sk3)
| ~ memberP(X1,sk5)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_87])])]),c_0_64]) ).
cnf(c_0_96,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_88,c_0_75]) ).
cnf(c_0_97,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
co1_14 ).
cnf(c_0_98,plain,
( segmentP(X1,skaf48(nil,X1))
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_79]),c_0_73]),c_0_68])])]) ).
cnf(c_0_99,plain,
skaf48(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_73]),c_0_41])]) ).
cnf(c_0_100,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_101,negated_conjecture,
( sk4 = nil
| ~ segmentP(nil,sk3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_41])]),c_0_72]) ).
cnf(c_0_102,negated_conjecture,
sk3 = nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96])]),c_0_97]) ).
cnf(c_0_103,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_41])]) ).
cnf(c_0_104,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_105,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_100,c_0_75]) ).
cnf(c_0_106,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_102]),c_0_103])]) ).
cnf(c_0_107,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_104]) ).
cnf(c_0_108,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_109,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SWC383-1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n003.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:59:33 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.x0d5nVbAIG/E---3.1_10016.p
% 2011.28/253.60 # Version: 3.1pre001
% 2011.28/253.60 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2011.28/253.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2011.28/253.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2011.28/253.60 # Starting new_bool_3 with 300s (1) cores
% 2011.28/253.60 # Starting new_bool_1 with 300s (1) cores
% 2011.28/253.60 # Starting sh5l with 300s (1) cores
% 2011.28/253.60 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10094 completed with status 0
% 2011.28/253.60 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2011.28/253.60 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2011.28/253.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2011.28/253.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2011.28/253.60 # No SInE strategy applied
% 2011.28/253.60 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2011.28/253.60 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2011.28/253.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2011.28/253.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2011.28/253.60 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2011.28/253.60 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2011.28/253.60 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 2011.28/253.60 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 10102 completed with status 7
% 2011.28/253.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 2011.28/253.60 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 10104 completed with status 7
% 2011.28/253.60 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 2011.28/253.60 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 10103 completed with status 7
% 2011.28/253.60 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 2011.28/253.60 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10101 completed with status 7
% 2011.28/253.60 # Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 127s (1) cores
% 2011.28/253.60 # G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 10192 completed with status 0
% 2011.28/253.60 # Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 2011.28/253.60 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2011.28/253.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2011.28/253.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2011.28/253.60 # No SInE strategy applied
% 2011.28/253.60 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2011.28/253.60 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2011.28/253.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2011.28/253.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2011.28/253.60 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2011.28/253.60 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2011.28/253.60 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 2011.28/253.60 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 10102 completed with status 7
% 2011.28/253.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 2011.28/253.60 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 10104 completed with status 7
% 2011.28/253.60 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 2011.28/253.60 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 10103 completed with status 7
% 2011.28/253.60 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 2011.28/253.60 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10101 completed with status 7
% 2011.28/253.60 # Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 127s (1) cores
% 2011.28/253.60 # Preprocessing time : 0.003 s
% 2011.28/253.60 # Presaturation interreduction done
% 2011.28/253.60
% 2011.28/253.60 # Proof found!
% 2011.28/253.60 # SZS status Unsatisfiable
% 2011.28/253.60 # SZS output start CNFRefutation
% See solution above
% 2011.28/253.60 # Parsed axioms : 201
% 2011.28/253.60 # Removed by relevancy pruning/SinE : 0
% 2011.28/253.60 # Initial clauses : 201
% 2011.28/253.60 # Removed in clause preprocessing : 0
% 2011.28/253.60 # Initial clauses in saturation : 201
% 2011.28/253.60 # Processed clauses : 85647
% 2011.28/253.60 # ...of these trivial : 1188
% 2011.28/253.60 # ...subsumed : 73640
% 2011.28/253.60 # ...remaining for further processing : 10819
% 2011.28/253.60 # Other redundant clauses eliminated : 21410
% 2011.28/253.60 # Clauses deleted for lack of memory : 26663
% 2011.28/253.60 # Backward-subsumed : 492
% 2011.28/253.60 # Backward-rewritten : 4443
% 2011.28/253.60 # Generated clauses : 3791542
% 2011.28/253.60 # ...of the previous two non-redundant : 3693468
% 2011.28/253.60 # ...aggressively subsumed : 0
% 2011.28/253.60 # Contextual simplify-reflections : 5458
% 2011.28/253.60 # Paramodulations : 3769017
% 2011.28/253.60 # Factorizations : 0
% 2011.28/253.60 # NegExts : 0
% 2011.28/253.60 # Equation resolutions : 22274
% 2011.28/253.60 # Total rewrite steps : 2228212
% 2011.28/253.60 # Propositional unsat checks : 0
% 2011.28/253.60 # Propositional check models : 0
% 2011.28/253.60 # Propositional check unsatisfiable : 0
% 2011.28/253.60 # Propositional clauses : 0
% 2011.28/253.60 # Propositional clauses after purity: 0
% 2011.28/253.60 # Propositional unsat core size : 0
% 2011.28/253.60 # Propositional preprocessing time : 0.000
% 2011.28/253.60 # Propositional encoding time : 0.000
% 2011.28/253.60 # Propositional solver time : 0.000
% 2011.28/253.60 # Success case prop preproc time : 0.000
% 2011.28/253.60 # Success case prop encoding time : 0.000
% 2011.28/253.60 # Success case prop solver time : 0.000
% 2011.28/253.60 # Current number of processed clauses : 5558
% 2011.28/253.60 # Positive orientable unit clauses : 69
% 2011.28/253.60 # Positive unorientable unit clauses: 0
% 2011.28/253.60 # Negative unit clauses : 123
% 2011.28/253.60 # Non-unit-clauses : 5366
% 2011.28/253.60 # Current number of unprocessed clauses: 928244
% 2011.28/253.60 # ...number of literals in the above : 6333372
% 2011.28/253.60 # Current number of archived formulas : 0
% 2011.28/253.60 # Current number of archived clauses : 5132
% 2011.28/253.60 # Clause-clause subsumption calls (NU) : 12684322
% 2011.28/253.60 # Rec. Clause-clause subsumption calls : 2659556
% 2011.28/253.60 # Non-unit clause-clause subsumptions : 77910
% 2011.28/253.60 # Unit Clause-clause subsumption calls : 606849
% 2011.28/253.60 # Rewrite failures with RHS unbound : 0
% 2011.28/253.60 # BW rewrite match attempts : 9
% 2011.28/253.60 # BW rewrite match successes : 9
% 2011.28/253.60 # Condensation attempts : 0
% 2011.28/253.60 # Condensation successes : 0
% 2011.28/253.60 # Termbank termtop insertions : 110674986
% 2011.28/253.60
% 2011.28/253.60 # -------------------------------------------------
% 2011.28/253.60 # User time : 647.690 s
% 2011.28/253.60 # System time : 9.996 s
% 2011.28/253.60 # Total time : 657.685 s
% 2011.28/253.60 # Maximum resident set size: 2132 pages
% 2011.28/253.60
% 2011.28/253.60 # -------------------------------------------------
% 2011.28/253.60 # User time : 1236.892 s
% 2011.28/253.60 # System time : 18.234 s
% 2011.28/253.60 # Total time : 1255.126 s
% 2011.28/253.60 # Maximum resident set size: 1852 pages
% 2011.28/253.60 % E---3.1 exiting
% 2011.28/253.60 % E---3.1 exiting
%------------------------------------------------------------------------------