TSTP Solution File: SWC114-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC114-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:24 EDT 2023
% Result : Unsatisfiable 0.19s 0.71s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 36
% Syntax : Number of clauses : 121 ( 44 unt; 16 nHn; 108 RR)
% Number of literals : 297 ( 69 equ; 175 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 145 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',co1_5) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause99) ).
cnf(co1_10,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',co1_10) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause8) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',co1_8) ).
cnf(co1_13,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',co1_13) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.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.9AopE4Usyv/E---3.1_31539.p',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause85) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause120) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',co1_1) ).
cnf(clause136,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause136) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause131) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause86) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause144) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause73) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause50) ).
cnf(clause154,axiom,
( frontsegP(X1,X3)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause154) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause132) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause51) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause96) ).
cnf(co1_14,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',co1_14) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',co1_2) ).
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.9AopE4Usyv/E---3.1_31539.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.9AopE4Usyv/E---3.1_31539.p',clause169) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause133) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause53) ).
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.9AopE4Usyv/E---3.1_31539.p',clause173) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause72) ).
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause172) ).
cnf(co1_16,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',co1_16) ).
cnf(clause61,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause61) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.9AopE4Usyv/E---3.1_31539.p',clause100) ).
cnf(c_0_36,negated_conjecture,
( nil != sk2
| nil != sk1 ),
co1_7 ).
cnf(c_0_37,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_38,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_39,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_40,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_10 ).
cnf(c_0_41,axiom,
ssList(nil),
clause8 ).
cnf(c_0_42,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_8 ).
cnf(c_0_43,negated_conjecture,
( sk3 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_13 ).
cnf(c_0_45,negated_conjecture,
sk3 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),c_0_42]),c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_9 ).
cnf(c_0_47,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_48,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_49,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_50,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_46,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_53,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_47]),c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_55,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_52,c_0_37]) ).
cnf(c_0_56,negated_conjecture,
( rearsegP(cons(sk5,X1),X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]) ).
cnf(c_0_57,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause136 ).
cnf(c_0_58,negated_conjecture,
rearsegP(sk3,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_50]),c_0_41])]) ).
cnf(c_0_59,negated_conjecture,
( rearsegP(app(X1,sk3),nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_41]),c_0_55])]) ).
cnf(c_0_60,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_61,negated_conjecture,
rearsegP(cons(sk5,sk3),nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_54]),c_0_55])]) ).
cnf(c_0_62,negated_conjecture,
( app(skaf46(cons(sk5,sk3),nil),nil) = cons(sk5,sk3)
| ~ ssList(cons(sk5,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_41])]) ).
cnf(c_0_63,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_64,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_65,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_66,negated_conjecture,
app(skaf46(cons(sk5,sk3),nil),nil) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_51]),c_0_55])]) ).
cnf(c_0_67,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_68,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_64]),c_0_48]) ).
cnf(c_0_69,negated_conjecture,
skaf46(cons(sk5,sk3),nil) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_70,axiom,
( frontsegP(X1,X3)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause154 ).
cnf(c_0_71,negated_conjecture,
( frontsegP(cons(sk5,X1),sk3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_54]),c_0_55])]) ).
cnf(c_0_72,negated_conjecture,
( ssList(cons(sk5,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_54]),c_0_55])]) ).
cnf(c_0_73,negated_conjecture,
app(cons(sk5,sk3),nil) = cons(sk5,sk3),
inference(rw,[status(thm)],[c_0_66,c_0_69]) ).
cnf(c_0_74,negated_conjecture,
ssList(cons(sk5,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_66]),c_0_67]),c_0_41])]) ).
cnf(c_0_75,negated_conjecture,
( frontsegP(X1,sk3)
| ~ frontsegP(X1,cons(sk5,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_55])]),c_0_72]) ).
cnf(c_0_76,negated_conjecture,
frontsegP(cons(sk5,sk3),cons(sk5,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_73]),c_0_41]),c_0_74])]) ).
cnf(c_0_77,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_78,negated_conjecture,
frontsegP(cons(sk5,sk3),sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_74]),c_0_55])]) ).
cnf(c_0_79,negated_conjecture,
app(sk3,skaf45(cons(sk5,sk3),sk3)) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_55]),c_0_74])]) ).
cnf(c_0_80,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_81,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_82,negated_conjecture,
cons(sk5,skaf45(cons(sk5,sk3),sk3)) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_79]),c_0_80])]) ).
cnf(c_0_83,negated_conjecture,
skaf45(cons(sk5,sk3),sk3) = tl(cons(sk5,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_51]),c_0_80])]) ).
cnf(c_0_84,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
co1_14 ).
cnf(c_0_85,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_86,negated_conjecture,
app(sk3,tl(cons(sk5,sk3))) = cons(sk5,sk3),
inference(rw,[status(thm)],[c_0_79,c_0_83]) ).
cnf(c_0_87,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_88,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_89,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[c_0_84,c_0_45]) ).
cnf(c_0_90,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_85,c_0_38]) ).
cnf(c_0_91,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause133 ).
cnf(c_0_92,negated_conjecture,
app(sk3,sk3) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_81]),c_0_51]),c_0_55])]) ).
cnf(c_0_93,negated_conjecture,
tl(sk3) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_50]),c_0_51]),c_0_41])]) ).
cnf(c_0_94,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_87]) ).
cnf(c_0_95,negated_conjecture,
app(skaf42(sk4,sk5),cons(sk5,skaf43(sk5,sk4))) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_51]),c_0_90])]) ).
cnf(c_0_96,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_97,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_98,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_99,negated_conjecture,
tl(cons(sk5,sk3)) = app(nil,sk3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),c_0_55])]),c_0_45]) ).
cnf(c_0_100,negated_conjecture,
( ~ ssList(app(sk4,cons(sk5,X1)))
| ~ ssList(X1)
| ~ duplicatefreeP(app(sk4,cons(sk5,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_51]),c_0_96]),c_0_97])]) ).
cnf(c_0_101,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_98]) ).
cnf(c_0_102,negated_conjecture,
app(nil,sk3) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_99]),c_0_51]),c_0_55])]) ).
cnf(c_0_103,negated_conjecture,
( ~ ssList(app(sk4,sk3))
| ~ duplicatefreeP(app(sk4,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_50]),c_0_41])]) ).
cnf(c_0_104,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_105,negated_conjecture,
( segmentP(app(sk3,X1),sk3)
| ~ ssList(app(sk3,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_55]),c_0_41])]) ).
cnf(c_0_106,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk4,sk3)) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_107,negated_conjecture,
( segmentP(app(sk3,X1),sk3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_48]),c_0_55])]) ).
cnf(c_0_108,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_48]),c_0_90]),c_0_55])]) ).
cnf(c_0_109,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause172 ).
cnf(c_0_110,negated_conjecture,
( segmentP(cons(sk5,X1),sk3)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_107,c_0_54]) ).
cnf(c_0_111,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_108])]) ).
cnf(c_0_112,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
co1_16 ).
cnf(c_0_113,negated_conjecture,
( segmentP(app(app(X1,cons(sk5,X2)),X3),sk3)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_55])]),c_0_111]) ).
cnf(c_0_114,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
clause61 ).
cnf(c_0_115,negated_conjecture,
( ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_112,c_0_38]),c_0_37]),c_0_37]) ).
cnf(c_0_116,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_117,negated_conjecture,
( segmentP(app(sk4,X1),sk3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_95]),c_0_97]),c_0_96])]) ).
cnf(c_0_118,plain,
( app(X1,skaf45(X1,X1)) = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_114]) ).
cnf(c_0_119,negated_conjecture,
~ segmentP(sk4,sk3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_55]),c_0_41])]),c_0_45]) ).
cnf(c_0_120,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_117,c_0_118]),c_0_80]),c_0_90])]),c_0_119]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : SWC114-1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n032.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 01:44:04 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.44 Running first-order theorem proving
% 0.19/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.9AopE4Usyv/E---3.1_31539.p
% 0.19/0.71 # Version: 3.1pre001
% 0.19/0.71 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.71 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.71 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.71 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.71 # Starting sh5l with 300s (1) cores
% 0.19/0.71 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 31675 completed with status 0
% 0.19/0.71 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.71 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.71 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.71 # No SInE strategy applied
% 0.19/0.71 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.71 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.71 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.19/0.71 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.71 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.19/0.71 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.19/0.71 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.19/0.71 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 31681 completed with status 0
% 0.19/0.71 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.19/0.71 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.71 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.71 # No SInE strategy applied
% 0.19/0.71 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.71 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.71 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.19/0.71 # Preprocessing time : 0.002 s
% 0.19/0.71 # Presaturation interreduction done
% 0.19/0.71
% 0.19/0.71 # Proof found!
% 0.19/0.71 # SZS status Unsatisfiable
% 0.19/0.71 # SZS output start CNFRefutation
% See solution above
% 0.19/0.71 # Parsed axioms : 201
% 0.19/0.71 # Removed by relevancy pruning/SinE : 0
% 0.19/0.71 # Initial clauses : 201
% 0.19/0.71 # Removed in clause preprocessing : 0
% 0.19/0.71 # Initial clauses in saturation : 201
% 0.19/0.71 # Processed clauses : 3076
% 0.19/0.71 # ...of these trivial : 81
% 0.19/0.71 # ...subsumed : 1541
% 0.19/0.71 # ...remaining for further processing : 1454
% 0.19/0.71 # Other redundant clauses eliminated : 129
% 0.19/0.71 # Clauses deleted for lack of memory : 0
% 0.19/0.71 # Backward-subsumed : 92
% 0.19/0.71 # Backward-rewritten : 294
% 0.19/0.71 # Generated clauses : 10990
% 0.19/0.71 # ...of the previous two non-redundant : 9271
% 0.19/0.71 # ...aggressively subsumed : 0
% 0.19/0.71 # Contextual simplify-reflections : 110
% 0.19/0.71 # Paramodulations : 10832
% 0.19/0.71 # Factorizations : 0
% 0.19/0.71 # NegExts : 0
% 0.19/0.71 # Equation resolutions : 147
% 0.19/0.71 # Total rewrite steps : 13762
% 0.19/0.71 # Propositional unsat checks : 0
% 0.19/0.71 # Propositional check models : 0
% 0.19/0.71 # Propositional check unsatisfiable : 0
% 0.19/0.71 # Propositional clauses : 0
% 0.19/0.71 # Propositional clauses after purity: 0
% 0.19/0.71 # Propositional unsat core size : 0
% 0.19/0.71 # Propositional preprocessing time : 0.000
% 0.19/0.71 # Propositional encoding time : 0.000
% 0.19/0.71 # Propositional solver time : 0.000
% 0.19/0.71 # Success case prop preproc time : 0.000
% 0.19/0.71 # Success case prop encoding time : 0.000
% 0.19/0.71 # Success case prop solver time : 0.000
% 0.19/0.71 # Current number of processed clauses : 840
% 0.19/0.71 # Positive orientable unit clauses : 233
% 0.19/0.71 # Positive unorientable unit clauses: 0
% 0.19/0.71 # Negative unit clauses : 91
% 0.19/0.71 # Non-unit-clauses : 516
% 0.19/0.71 # Current number of unprocessed clauses: 5735
% 0.19/0.71 # ...number of literals in the above : 23957
% 0.19/0.71 # Current number of archived formulas : 0
% 0.19/0.71 # Current number of archived clauses : 591
% 0.19/0.71 # Clause-clause subsumption calls (NU) : 66947
% 0.19/0.71 # Rec. Clause-clause subsumption calls : 24163
% 0.19/0.71 # Non-unit clause-clause subsumptions : 927
% 0.19/0.71 # Unit Clause-clause subsumption calls : 5308
% 0.19/0.71 # Rewrite failures with RHS unbound : 0
% 0.19/0.71 # BW rewrite match attempts : 168
% 0.19/0.71 # BW rewrite match successes : 102
% 0.19/0.71 # Condensation attempts : 0
% 0.19/0.71 # Condensation successes : 0
% 0.19/0.71 # Termbank termtop insertions : 207119
% 0.19/0.71
% 0.19/0.71 # -------------------------------------------------
% 0.19/0.71 # User time : 0.243 s
% 0.19/0.71 # System time : 0.007 s
% 0.19/0.71 # Total time : 0.250 s
% 0.19/0.71 # Maximum resident set size: 2116 pages
% 0.19/0.71
% 0.19/0.71 # -------------------------------------------------
% 0.19/0.71 # User time : 1.134 s
% 0.19/0.71 # System time : 0.046 s
% 0.19/0.71 # Total time : 1.179 s
% 0.19/0.71 # Maximum resident set size: 1852 pages
% 0.19/0.71 % E---3.1 exiting
% 0.19/0.71 % E---3.1 exiting
%------------------------------------------------------------------------------