TSTP Solution File: SWC117-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC117-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:25 EDT 2023
% Result : Unsatisfiable 6.62s 1.30s
% Output : CNFRefutation 6.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 56
% Syntax : Number of clauses : 206 ( 66 unt; 30 nHn; 179 RR)
% Number of literals : 533 ( 146 equ; 321 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 5 con; 0-2 aty)
% Number of variables : 269 ( 41 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',co1_6) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',co1_5) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',co1_2) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',co1_1) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause8) ).
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.bVkqnYIXPb/E---3.1_7488.p',clause168) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause73) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause85) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause49) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause60) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause48) ).
cnf(clause137,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause137) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause131) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause50) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause74) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause132) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause58) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause51) ).
cnf(clause136,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause136) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause144) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause123) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause138) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause101) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause76) ).
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.bVkqnYIXPb/E---3.1_7488.p',clause179) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause47) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause145) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause104) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause118) ).
cnf(co1_10,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',co1_10) ).
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.bVkqnYIXPb/E---3.1_7488.p',clause169) ).
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.bVkqnYIXPb/E---3.1_7488.p',clause149) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause109) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause53) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause72) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause99) ).
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.bVkqnYIXPb/E---3.1_7488.p',clause157) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause96) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause13) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause116) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause86) ).
cnf(clause81,axiom,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause81) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause97) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause120) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause151) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause75) ).
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.bVkqnYIXPb/E---3.1_7488.p',clause173) ).
cnf(co1_9,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ equalelemsP(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',co1_9) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause56) ).
cnf(clause64,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bVkqnYIXPb/E---3.1_7488.p',clause64) ).
cnf(c_0_56,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_57,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_58,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
co1_11 ).
cnf(c_0_59,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_60,negated_conjecture,
segmentP(sk4,sk1),
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_62,negated_conjecture,
~ neq(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_60])]) ).
cnf(c_0_63,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_64,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_65,axiom,
ssList(nil),
clause8 ).
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,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_61,c_0_59]) ).
cnf(c_0_68,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_69,negated_conjecture,
nil = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65])]) ).
cnf(c_0_70,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_71,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_72,negated_conjecture,
app(app(skaf47(sk4,sk1),sk1),skaf48(sk1,sk4)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_60]),c_0_64]),c_0_67])]) ).
cnf(c_0_73,plain,
( app(X1,sk1) = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_74,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_75,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
clause60 ).
cnf(c_0_76,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_70]),c_0_71]) ).
cnf(c_0_77,negated_conjecture,
app(skaf47(sk4,sk1),skaf48(sk1,sk4)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_78,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_79,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause137 ).
cnf(c_0_80,plain,
( frontsegP(X1,sk1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_75,c_0_69]) ).
cnf(c_0_81,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_82,negated_conjecture,
rearsegP(sk4,skaf48(sk1,sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]),c_0_74])]) ).
cnf(c_0_83,plain,
( frontsegP(app(X1,X2),sk1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_64])]) ).
cnf(c_0_84,negated_conjecture,
app(skaf46(sk4,skaf48(sk1,sk4)),skaf48(sk1,sk4)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_78]),c_0_67])]) ).
cnf(c_0_85,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_86,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_87,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_88,negated_conjecture,
frontsegP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_78]),c_0_85])]) ).
cnf(c_0_89,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
clause58 ).
cnf(c_0_90,plain,
( app(sk1,X1) = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_86,c_0_69]) ).
cnf(c_0_91,negated_conjecture,
app(sk1,skaf45(sk4,sk1)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_64]),c_0_67])]) ).
cnf(c_0_92,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_93,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause136 ).
cnf(c_0_94,plain,
( rearsegP(X1,sk1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_89,c_0_69]) ).
cnf(c_0_95,negated_conjecture,
skaf45(sk4,sk1) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92])]) ).
cnf(c_0_96,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_97,plain,
( rearsegP(app(X1,X2),sk1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_64])]) ).
cnf(c_0_98,negated_conjecture,
app(sk1,sk4) = sk4,
inference(rw,[status(thm)],[c_0_91,c_0_95]) ).
cnf(c_0_99,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_96]),c_0_71]) ).
cnf(c_0_100,negated_conjecture,
rearsegP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_64]),c_0_67])]) ).
cnf(c_0_101,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause123 ).
cnf(c_0_102,negated_conjecture,
frontsegP(sk4,skaf47(sk4,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_77]),c_0_78]),c_0_74])]) ).
cnf(c_0_103,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_104,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_105,negated_conjecture,
app(skaf46(sk4,sk1),sk1) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_100]),c_0_64]),c_0_67])]) ).
cnf(c_0_106,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_107,plain,
( hd(app(X1,X2)) = hd(X1)
| sk1 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[c_0_101,c_0_69]) ).
cnf(c_0_108,negated_conjecture,
app(skaf47(sk4,sk1),skaf45(sk4,skaf47(sk4,sk1))) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_102]),c_0_74]),c_0_67])]) ).
cnf(c_0_109,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_110,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_103]) ).
cnf(c_0_111,plain,
( cons(skaf44(X1),sk1) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_104,c_0_69]) ).
cnf(c_0_112,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_113,negated_conjecture,
skaf46(sk4,sk1) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_105]),c_0_85])]) ).
cnf(c_0_114,plain,
( sk1 = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_106,c_0_69]) ).
cnf(c_0_115,negated_conjecture,
( hd(skaf47(sk4,sk1)) = hd(sk4)
| skaf47(sk4,sk1) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_74]),c_0_92])]) ).
cnf(c_0_116,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_117,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_119,negated_conjecture,
( nil != sk2
| nil != sk1 ),
co1_10 ).
cnf(c_0_120,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_109]) ).
cnf(c_0_121,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_122,plain,
( memberP(X1,skaf44(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112]),c_0_64])]) ).
cnf(c_0_123,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_124,negated_conjecture,
app(sk4,sk1) = sk4,
inference(rw,[status(thm)],[c_0_105,c_0_113]) ).
cnf(c_0_125,negated_conjecture,
( skaf47(sk4,sk1) = sk1
| ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_74])]) ).
cnf(c_0_126,plain,
app(sk1,sk1) = sk1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_116])]),c_0_65])]),c_0_69]),c_0_69]),c_0_69]) ).
cnf(c_0_127,plain,
( cons(hd(X1),tl(X1)) = X1
| sk1 = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_117,c_0_69]) ).
cnf(c_0_128,plain,
( sk1 = X1
| app(X1,X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_118,c_0_69]),c_0_69]) ).
cnf(c_0_129,negated_conjecture,
( nil != sk1
| nil != sk4 ),
inference(rw,[status(thm)],[c_0_119,c_0_59]) ).
cnf(c_0_130,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_131,plain,
( ~ singletonP(X1)
| ~ ssList(app(app(X2,cons(skaf44(X1),X3)),X1))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(app(X2,cons(skaf44(X1),X3)),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_111]),c_0_112]),c_0_64])]) ).
cnf(c_0_132,plain,
( app(skaf42(X1,skaf44(X1)),cons(skaf44(X1),skaf43(skaf44(X1),X1))) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_112])]) ).
cnf(c_0_133,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_134,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_135,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_136,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_137,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_138,negated_conjecture,
( app(sk4,app(sk1,X1)) = app(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_67]),c_0_64])]) ).
cnf(c_0_139,negated_conjecture,
( app(sk1,skaf48(sk1,sk4)) = sk4
| ssItem(hd(sk4)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_125]),c_0_126]) ).
cnf(c_0_140,plain,
( cons(hd(X1),tl(app(X1,X2))) = app(X1,X2)
| sk1 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_107]),c_0_71]),c_0_128]) ).
cnf(c_0_141,negated_conjecture,
sk4 != sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_69]),c_0_69])]) ).
cnf(c_0_142,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_143,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| sk1 = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_130,c_0_69]) ).
cnf(c_0_144,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_145,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_146,plain,
( ~ singletonP(X1)
| ~ ssList(app(X1,X1))
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133]),c_0_134])]) ).
cnf(c_0_147,plain,
( ssItem(X1)
| duplicatefreeP(app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_135,c_0_71]) ).
cnf(c_0_148,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_149,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_150,plain,
( app(cons(X1,X2),X3) != app(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_71]) ).
cnf(c_0_151,axiom,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause81 ).
cnf(c_0_152,negated_conjecture,
( app(sk4,skaf48(sk1,sk4)) = app(sk4,sk4)
| ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_78])]) ).
cnf(c_0_153,negated_conjecture,
cons(hd(sk4),tl(sk4)) = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_124]),c_0_67]),c_0_64])]),c_0_141]) ).
cnf(c_0_154,plain,
( tl(X1) = skaf82(X1)
| sk1 = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_144]),c_0_145])]) ).
cnf(c_0_155,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_156,plain,
( ssItem(X1)
| ~ singletonP(X2)
| ~ ssList(app(X2,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_146,c_0_147]) ).
cnf(c_0_157,plain,
( singletonP(cons(X1,sk1))
| ~ ssItem(X1)
| ~ ssList(cons(X1,sk1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_148]),c_0_69]),c_0_69]) ).
cnf(c_0_158,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_137]),c_0_71]) ).
cnf(c_0_159,plain,
( app(cons(X1,sk1),sk1) = cons(X1,sk1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_126]),c_0_64])]) ).
cnf(c_0_160,plain,
( cons(X1,X2) != app(X2,sk1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_73]),c_0_64])]),c_0_149]) ).
cnf(c_0_161,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_162,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause151 ).
cnf(c_0_163,plain,
rearsegP(sk1,sk1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_151]),c_0_65])]),c_0_69]),c_0_69]) ).
cnf(c_0_164,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_165,negated_conjecture,
( hd(app(sk4,sk4)) = hd(sk4)
| ssItem(hd(sk4)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_152]),c_0_67]),c_0_78])]),c_0_141]) ).
cnf(c_0_166,negated_conjecture,
( ssItem(hd(sk4))
| ssList(app(sk4,sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_152]),c_0_67]),c_0_78])]) ).
cnf(c_0_167,negated_conjecture,
( ssItem(hd(sk4))
| app(sk4,sk4) != sk1 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_152]),c_0_78]),c_0_67])]),c_0_141]) ).
cnf(c_0_168,negated_conjecture,
cons(hd(sk4),skaf82(sk4)) = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_67])]),c_0_141]) ).
cnf(c_0_169,plain,
( hd(X1) = skaf83(X1)
| sk1 = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_143]),c_0_144]),c_0_145])]) ).
cnf(c_0_170,plain,
( ssItem(X1)
| ~ singletonP(X2)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_156,c_0_71]) ).
cnf(c_0_171,plain,
( singletonP(cons(X1,sk1))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_149]),c_0_64])]) ).
cnf(c_0_172,plain,
( ssList(cons(X1,sk1))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_159]),c_0_64])]) ).
cnf(c_0_173,plain,
( app(cons(X1,sk1),X2) != app(X2,sk1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_161]),c_0_69]) ).
cnf(c_0_174,plain,
( app(skaf46(X1,sk1),sk1) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_94]),c_0_64])]) ).
cnf(c_0_175,plain,
( sk1 = X1
| app(X1,sk1) != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_126]),c_0_64])]) ).
cnf(c_0_176,plain,
app(skaf46(sk1,sk1),sk1) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_163]),c_0_64])]) ).
cnf(c_0_177,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_178,plain,
( sk1 = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_164,c_0_69]) ).
cnf(c_0_179,negated_conjecture,
ssItem(hd(sk4)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_165]),c_0_166]),c_0_167]) ).
cnf(c_0_180,negated_conjecture,
cons(skaf83(sk4),skaf82(sk4)) = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_169]),c_0_67])]),c_0_141]) ).
cnf(c_0_181,plain,
( ssItem(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_171]),c_0_172]) ).
cnf(c_0_182,plain,
( app(cons(X1,sk1),skaf46(X2,sk1)) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_173,c_0_174]),c_0_85])]) ).
cnf(c_0_183,plain,
skaf46(sk1,sk1) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_175,c_0_176]),c_0_85])]) ).
cnf(c_0_184,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ equalelemsP(X1) ),
co1_9 ).
cnf(c_0_185,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_186,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_177]) ).
cnf(c_0_187,plain,
( app(cons(hd(X1),sk1),tl(X1)) = X1
| sk1 = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_127]),c_0_69]),c_0_178]),c_0_114]) ).
cnf(c_0_188,negated_conjecture,
tl(sk4) = skaf82(sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_168]),c_0_179]),c_0_145])]) ).
cnf(c_0_189,negated_conjecture,
hd(sk4) = skaf83(sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_180]),c_0_144]),c_0_145])]) ).
cnf(c_0_190,plain,
ssItem(X1),
inference(spm,[status(thm)],[c_0_181,c_0_112]) ).
cnf(c_0_191,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
clause64 ).
cnf(c_0_192,plain,
( app(cons(X1,sk1),sk1) != sk1
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_183]),c_0_64])]) ).
cnf(c_0_193,negated_conjecture,
( app(cons(X1,sk1),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_161,c_0_69]) ).
cnf(c_0_194,negated_conjecture,
( ~ neq(sk1,X1)
| ~ segmentP(X1,sk1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1)
| ~ equalelemsP(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_184,c_0_57]),c_0_57]) ).
cnf(c_0_195,plain,
( segmentP(X1,sk1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_185,c_0_69]) ).
cnf(c_0_196,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_186,c_0_90]),c_0_64])]),c_0_71]) ).
cnf(c_0_197,negated_conjecture,
app(cons(skaf83(sk4),sk1),skaf82(sk4)) = sk4,
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_187,c_0_188]),c_0_67])]),c_0_141]),c_0_189]) ).
cnf(c_0_198,plain,
ssList(cons(X1,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_172,c_0_190])]) ).
cnf(c_0_199,negated_conjecture,
( equalelemsP(cons(X1,sk1))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_191,c_0_69]) ).
cnf(c_0_200,negated_conjecture,
( cons(X1,sk1) != sk1
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_192,c_0_193]),c_0_64])]) ).
cnf(c_0_201,negated_conjecture,
( X1 = sk1
| ~ segmentP(sk4,X1)
| ~ ssList(X1)
| ~ equalelemsP(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_194,c_0_63]),c_0_64])]),c_0_195]) ).
cnf(c_0_202,negated_conjecture,
segmentP(sk4,cons(skaf83(sk4),sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_196,c_0_197]),c_0_145]),c_0_198])]) ).
cnf(c_0_203,negated_conjecture,
equalelemsP(cons(X1,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_199,c_0_190])]) ).
cnf(c_0_204,negated_conjecture,
cons(X1,sk1) != sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_200,c_0_190])]) ).
cnf(c_0_205,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_201,c_0_202]),c_0_198]),c_0_203])]),c_0_204]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWC117-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n026.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 02:13:44 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.bVkqnYIXPb/E---3.1_7488.p
% 6.62/1.30 # Version: 3.1pre001
% 6.62/1.30 # Preprocessing class: FSLSSMSSSSSNFFN.
% 6.62/1.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.62/1.30 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 6.62/1.30 # Starting new_bool_3 with 300s (1) cores
% 6.62/1.30 # Starting new_bool_1 with 300s (1) cores
% 6.62/1.30 # Starting sh5l with 300s (1) cores
% 6.62/1.30 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 7566 completed with status 0
% 6.62/1.30 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 6.62/1.30 # Preprocessing class: FSLSSMSSSSSNFFN.
% 6.62/1.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.62/1.30 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 6.62/1.30 # No SInE strategy applied
% 6.62/1.30 # Search class: FGHSM-FSLM21-MFFFFFNN
% 6.62/1.30 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 6.62/1.30 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 6.62/1.30 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 6.62/1.30 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 6.62/1.30 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 6.62/1.30 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 6.62/1.30 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 7574 completed with status 0
% 6.62/1.30 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 6.62/1.30 # Preprocessing class: FSLSSMSSSSSNFFN.
% 6.62/1.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.62/1.30 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 6.62/1.30 # No SInE strategy applied
% 6.62/1.30 # Search class: FGHSM-FSLM21-MFFFFFNN
% 6.62/1.30 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 6.62/1.30 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 6.62/1.30 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 6.62/1.30 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 6.62/1.30 # Preprocessing time : 0.003 s
% 6.62/1.30
% 6.62/1.30 # Proof found!
% 6.62/1.30 # SZS status Unsatisfiable
% 6.62/1.30 # SZS output start CNFRefutation
% See solution above
% 6.62/1.30 # Parsed axioms : 196
% 6.62/1.30 # Removed by relevancy pruning/SinE : 0
% 6.62/1.30 # Initial clauses : 196
% 6.62/1.30 # Removed in clause preprocessing : 0
% 6.62/1.30 # Initial clauses in saturation : 196
% 6.62/1.30 # Processed clauses : 5873
% 6.62/1.30 # ...of these trivial : 104
% 6.62/1.30 # ...subsumed : 3837
% 6.62/1.30 # ...remaining for further processing : 1932
% 6.62/1.30 # Other redundant clauses eliminated : 637
% 6.62/1.30 # Clauses deleted for lack of memory : 0
% 6.62/1.30 # Backward-subsumed : 100
% 6.62/1.30 # Backward-rewritten : 592
% 6.62/1.30 # Generated clauses : 30087
% 6.62/1.30 # ...of the previous two non-redundant : 27368
% 6.62/1.30 # ...aggressively subsumed : 0
% 6.62/1.30 # Contextual simplify-reflections : 241
% 6.62/1.30 # Paramodulations : 29439
% 6.62/1.30 # Factorizations : 0
% 6.62/1.30 # NegExts : 0
% 6.62/1.30 # Equation resolutions : 649
% 6.62/1.30 # Total rewrite steps : 34432
% 6.62/1.30 # Propositional unsat checks : 0
% 6.62/1.30 # Propositional check models : 0
% 6.62/1.30 # Propositional check unsatisfiable : 0
% 6.62/1.30 # Propositional clauses : 0
% 6.62/1.30 # Propositional clauses after purity: 0
% 6.62/1.30 # Propositional unsat core size : 0
% 6.62/1.30 # Propositional preprocessing time : 0.000
% 6.62/1.30 # Propositional encoding time : 0.000
% 6.62/1.30 # Propositional solver time : 0.000
% 6.62/1.30 # Success case prop preproc time : 0.000
% 6.62/1.30 # Success case prop encoding time : 0.000
% 6.62/1.30 # Success case prop solver time : 0.000
% 6.62/1.30 # Current number of processed clauses : 1217
% 6.62/1.30 # Positive orientable unit clauses : 178
% 6.62/1.30 # Positive unorientable unit clauses: 0
% 6.62/1.30 # Negative unit clauses : 40
% 6.62/1.30 # Non-unit-clauses : 999
% 6.62/1.30 # Current number of unprocessed clauses: 21139
% 6.62/1.30 # ...number of literals in the above : 134512
% 6.62/1.30 # Current number of archived formulas : 0
% 6.62/1.30 # Current number of archived clauses : 692
% 6.62/1.30 # Clause-clause subsumption calls (NU) : 388598
% 6.62/1.30 # Rec. Clause-clause subsumption calls : 67307
% 6.62/1.30 # Non-unit clause-clause subsumptions : 2503
% 6.62/1.30 # Unit Clause-clause subsumption calls : 12489
% 6.62/1.30 # Rewrite failures with RHS unbound : 0
% 6.62/1.30 # BW rewrite match attempts : 112
% 6.62/1.30 # BW rewrite match successes : 78
% 6.62/1.30 # Condensation attempts : 0
% 6.62/1.30 # Condensation successes : 0
% 6.62/1.30 # Termbank termtop insertions : 716186
% 6.62/1.30
% 6.62/1.30 # -------------------------------------------------
% 6.62/1.30 # User time : 0.840 s
% 6.62/1.30 # System time : 0.019 s
% 6.62/1.30 # Total time : 0.859 s
% 6.62/1.30 # Maximum resident set size: 2152 pages
% 6.62/1.30
% 6.62/1.30 # -------------------------------------------------
% 6.62/1.30 # User time : 4.153 s
% 6.62/1.30 # System time : 0.128 s
% 6.62/1.30 # Total time : 4.281 s
% 6.62/1.30 # Maximum resident set size: 1852 pages
% 6.62/1.30 % E---3.1 exiting
% 6.62/1.31 % E---3.1 exiting
%------------------------------------------------------------------------------