TSTP Solution File: SWC126-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC126-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:28 EDT 2023
% Result : Unsatisfiable 138.99s 18.07s
% Output : CNFRefutation 138.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 48
% Syntax : Number of clauses : 182 ( 56 unt; 26 nHn; 170 RR)
% Number of literals : 459 ( 129 equ; 271 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 : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 227 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',co1_7) ).
cnf(co1_14,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',co1_5) ).
cnf(co1_13,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',co1_13) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause144) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause85) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause120) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',co1_1) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause8) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause132) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause51) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause96) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause143) ).
cnf(clause136,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause136) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause131) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause86) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause97) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause99) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause73) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause50) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause123) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause118) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause104) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause133) ).
cnf(clause176,axiom,
( X1 = X3
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause176) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause76) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause60) ).
cnf(clause137,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause137) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause157) ).
cnf(co1_15,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',co1_15) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause138) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause98) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause58) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause169) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.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/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause179) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause53) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause52) ).
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause172) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause57) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause119) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause149) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause72) ).
cnf(clause61,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause61) ).
cnf(co1_16,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',co1_16) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p',clause100) ).
cnf(c_0_48,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_49,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
co1_14 ).
cnf(c_0_50,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_51,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_52,negated_conjecture,
neq(sk2,nil),
c_0_48 ).
cnf(c_0_53,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_13 ).
cnf(c_0_54,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_55,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_56,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_57,negated_conjecture,
cons(sk5,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52])]) ).
cnf(c_0_58,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_51]),c_0_52])]) ).
cnf(c_0_59,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_54]),c_0_55]) ).
cnf(c_0_60,negated_conjecture,
( app(sk1,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_61,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_62,negated_conjecture,
( frontsegP(cons(sk5,X1),sk1)
| ~ 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_63,axiom,
ssList(nil),
clause8 ).
cnf(c_0_64,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_65,negated_conjecture,
frontsegP(sk1,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_57]),c_0_63])]) ).
cnf(c_0_66,negated_conjecture,
app(sk1,skaf45(sk1,sk1)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_61])]) ).
cnf(c_0_67,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_68,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_69,negated_conjecture,
cons(sk5,skaf45(sk1,sk1)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_66]),c_0_67])]) ).
cnf(c_0_70,negated_conjecture,
tl(sk1) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_57]),c_0_58]),c_0_63])]) ).
cnf(c_0_71,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_72,negated_conjecture,
skaf45(sk1,sk1) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_58]),c_0_67])]) ).
cnf(c_0_73,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_71]),c_0_55]) ).
cnf(c_0_74,negated_conjecture,
app(sk1,nil) = sk1,
inference(rw,[status(thm)],[c_0_66,c_0_72]) ).
cnf(c_0_75,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause136 ).
cnf(c_0_76,negated_conjecture,
rearsegP(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_63]),c_0_61])]) ).
cnf(c_0_77,negated_conjecture,
( rearsegP(app(X1,sk1),nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_63]),c_0_61])]) ).
cnf(c_0_78,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_79,negated_conjecture,
rearsegP(cons(sk5,sk1),nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_60]),c_0_61])]) ).
cnf(c_0_80,negated_conjecture,
( app(skaf46(cons(sk5,sk1),nil),nil) = cons(sk5,sk1)
| ~ ssList(cons(sk5,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_63])]) ).
cnf(c_0_81,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_82,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_83,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_84,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_85,negated_conjecture,
app(skaf46(cons(sk5,sk1),nil),nil) = cons(sk5,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_58]),c_0_61])]) ).
cnf(c_0_86,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_87,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause123 ).
cnf(c_0_88,negated_conjecture,
hd(sk1) = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_57]),c_0_58]),c_0_63])]) ).
cnf(c_0_89,negated_conjecture,
sk1 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_57]),c_0_58]),c_0_63])]) ).
cnf(c_0_90,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_91,negated_conjecture,
skaf46(cons(sk5,sk1),nil) = cons(sk5,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86])]) ).
cnf(c_0_92,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_93,negated_conjecture,
( hd(cons(sk5,X1)) = sk5
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_60]),c_0_88]),c_0_61])]),c_0_89]) ).
cnf(c_0_94,negated_conjecture,
( ssList(cons(sk5,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_60]),c_0_61])]) ).
cnf(c_0_95,negated_conjecture,
( cons(sk5,X1) != nil
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_60]),c_0_61])]),c_0_89]) ).
cnf(c_0_96,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause133 ).
cnf(c_0_97,axiom,
( X1 = X3
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
clause176 ).
cnf(c_0_98,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_99,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_100,negated_conjecture,
app(cons(sk5,sk1),nil) = cons(sk5,sk1),
inference(rw,[status(thm)],[c_0_85,c_0_91]) ).
cnf(c_0_101,negated_conjecture,
ssList(cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_85]),c_0_86]),c_0_63])]) ).
cnf(c_0_102,negated_conjecture,
( cons(sk5,tl(cons(sk5,X1))) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94]),c_0_95]) ).
cnf(c_0_103,negated_conjecture,
( tl(cons(sk5,X1)) = app(nil,X1)
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_60]),c_0_70]),c_0_61])]),c_0_89]) ).
cnf(c_0_104,plain,
( X1 = hd(X2)
| nil = X2
| ~ frontsegP(cons(X1,X3),X2)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_92]),c_0_98]),c_0_99]) ).
cnf(c_0_105,negated_conjecture,
frontsegP(cons(sk5,sk1),cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_100]),c_0_63]),c_0_101])]) ).
cnf(c_0_106,negated_conjecture,
( cons(sk5,app(nil,X1)) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_107,negated_conjecture,
( ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_103]),c_0_94]),c_0_95]) ).
cnf(c_0_108,negated_conjecture,
( hd(cons(sk5,sk1)) = sk5
| cons(sk5,sk1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_58]),c_0_61]),c_0_101])]) ).
cnf(c_0_109,negated_conjecture,
( tl(cons(sk5,X1)) = app(nil,app(nil,X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_106]),c_0_107]) ).
cnf(c_0_110,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
clause60 ).
cnf(c_0_111,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause137 ).
cnf(c_0_112,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_113,negated_conjecture,
( cons(sk5,tl(cons(sk5,sk1))) = cons(sk5,sk1)
| cons(sk5,sk1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_108]),c_0_101])]) ).
cnf(c_0_114,negated_conjecture,
( cons(sk5,app(nil,app(nil,X1))) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_109]) ).
cnf(c_0_115,plain,
( app(nil,skaf45(X1,nil)) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_110]),c_0_63])]) ).
cnf(c_0_116,plain,
( frontsegP(app(X1,X2),nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_110]),c_0_63])]) ).
cnf(c_0_117,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
co1_15 ).
cnf(c_0_118,negated_conjecture,
( cons(sk5,app(nil,X1)) = app(sk1,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_57]),c_0_58]),c_0_63])]) ).
cnf(c_0_119,negated_conjecture,
( cons(sk5,app(nil,sk1)) = cons(sk5,sk1)
| cons(sk5,sk1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_103]),c_0_61])]) ).
cnf(c_0_120,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_121,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_122,negated_conjecture,
( cons(sk5,skaf45(X1,nil)) = cons(sk5,app(nil,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_67])]) ).
cnf(c_0_123,negated_conjecture,
frontsegP(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_74]),c_0_63]),c_0_61])]) ).
cnf(c_0_124,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
clause58 ).
cnf(c_0_125,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_126,negated_conjecture,
memberP(sk2,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_117,c_0_51]),c_0_51]),c_0_52])]) ).
cnf(c_0_127,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_128,negated_conjecture,
( app(sk1,sk1) = cons(sk5,sk1)
| cons(sk5,sk1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_61])]) ).
cnf(c_0_129,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_130,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_120]) ).
cnf(c_0_131,negated_conjecture,
( cons(sk5,app(nil,X1)) != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_58]),c_0_67])]) ).
cnf(c_0_132,negated_conjecture,
app(nil,skaf45(sk1,nil)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_123]),c_0_63]),c_0_61])]) ).
cnf(c_0_133,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_124]),c_0_63])]) ).
cnf(c_0_134,negated_conjecture,
app(skaf42(sk2,sk5),cons(sk5,skaf43(sk5,sk2))) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_58]),c_0_127])]) ).
cnf(c_0_135,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_136,negated_conjecture,
( tl(cons(sk5,sk1)) = app(nil,sk1)
| cons(sk5,sk1) = nil ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_128]),c_0_70]),c_0_61])]),c_0_89]) ).
cnf(c_0_137,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_129]) ).
cnf(c_0_138,negated_conjecture,
memberP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_57]),c_0_58]),c_0_63])]) ).
cnf(c_0_139,negated_conjecture,
cons(sk5,sk1) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_67])]) ).
cnf(c_0_140,negated_conjecture,
( rearsegP(sk2,nil)
| ~ ssList(cons(sk5,skaf43(sk5,sk2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_135])]) ).
cnf(c_0_141,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_142,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause172 ).
cnf(c_0_143,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
clause57 ).
cnf(c_0_144,negated_conjecture,
( cons(sk5,sk1) = nil
| app(nil,sk1) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_136]),c_0_58]),c_0_61])]) ).
cnf(c_0_145,negated_conjecture,
( ~ ssList(app(app(X1,cons(sk5,X2)),sk1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(app(X1,cons(sk5,X2)),sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_57]),c_0_58]),c_0_63])]) ).
cnf(c_0_146,negated_conjecture,
app(skaf42(sk1,sk5),cons(sk5,skaf43(sk5,sk1))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_138]),c_0_58]),c_0_61])]) ).
cnf(c_0_147,negated_conjecture,
app(sk1,sk1) = cons(sk5,sk1),
inference(sr,[status(thm)],[c_0_128,c_0_139]) ).
cnf(c_0_148,negated_conjecture,
rearsegP(sk2,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_81]),c_0_58]),c_0_141])]) ).
cnf(c_0_149,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_150,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_151,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_142,c_0_143]) ).
cnf(c_0_152,negated_conjecture,
app(nil,sk1) = sk1,
inference(sr,[status(thm)],[c_0_144,c_0_139]) ).
cnf(c_0_153,negated_conjecture,
~ duplicatefreeP(cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_147]),c_0_101]),c_0_141]),c_0_135]),c_0_147])]) ).
cnf(c_0_154,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_155,negated_conjecture,
app(skaf46(sk2,nil),nil) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_148]),c_0_63]),c_0_127])]) ).
cnf(c_0_156,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_149,c_0_150]),c_0_55]) ).
cnf(c_0_157,negated_conjecture,
( segmentP(app(sk1,X1),sk1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_63]),c_0_61])]) ).
cnf(c_0_158,negated_conjecture,
( app(sk1,skaf45(cons(sk5,X1),sk1)) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_62]),c_0_61])]),c_0_94]) ).
cnf(c_0_159,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_101])]) ).
cnf(c_0_160,negated_conjecture,
skaf46(sk2,nil) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_155]),c_0_86])]) ).
cnf(c_0_161,plain,
( app(X1,X2) = nil
| app(X1,app(X2,X3)) != nil
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_150]),c_0_55]) ).
cnf(c_0_162,negated_conjecture,
( app(X1,sk1) != 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_156,c_0_152]),c_0_61]),c_0_63])]),c_0_89]) ).
cnf(c_0_163,negated_conjecture,
( segmentP(cons(sk5,X1),sk1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_158]),c_0_67])]) ).
cnf(c_0_164,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_159])]) ).
cnf(c_0_165,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
clause61 ).
cnf(c_0_166,plain,
( cons(hd(X1),tl(app(X1,X2))) = app(X1,X2)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_87]),c_0_55]),c_0_90]) ).
cnf(c_0_167,negated_conjecture,
app(sk2,nil) = sk2,
inference(rw,[status(thm)],[c_0_155,c_0_160]) ).
cnf(c_0_168,negated_conjecture,
( app(X1,cons(sk5,X2)) != nil
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_158]),c_0_67]),c_0_61])]),c_0_162]) ).
cnf(c_0_169,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
co1_16 ).
cnf(c_0_170,negated_conjecture,
( segmentP(app(app(X1,cons(sk5,X2)),X3),sk1)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_163]),c_0_61])]),c_0_164]) ).
cnf(c_0_171,plain,
( cons(hd(X1),app(tl(X1),X2)) = app(X1,X2)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_92]),c_0_98]),c_0_99]) ).
cnf(c_0_172,plain,
( app(X1,skaf45(X1,X1)) = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_64,c_0_165]) ).
cnf(c_0_173,negated_conjecture,
( cons(hd(sk2),tl(sk2)) = sk2
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_167]),c_0_127]),c_0_63])]) ).
cnf(c_0_174,negated_conjecture,
sk2 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_134]),c_0_135]),c_0_141])]) ).
cnf(c_0_175,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_169,c_0_51]),c_0_52])]) ).
cnf(c_0_176,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_177,negated_conjecture,
( segmentP(app(sk2,X1),sk1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_134]),c_0_135]),c_0_141])]) ).
cnf(c_0_178,plain,
( app(X1,skaf45(tl(X1),tl(X1))) = cons(hd(X1),tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_171,c_0_172]),c_0_67])]),c_0_98]) ).
cnf(c_0_179,negated_conjecture,
cons(hd(sk2),tl(sk2)) = sk2,
inference(sr,[status(thm)],[c_0_173,c_0_174]) ).
cnf(c_0_180,negated_conjecture,
~ segmentP(sk2,sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_175,c_0_176]),c_0_61]),c_0_63])]),c_0_89]) ).
cnf(c_0_181,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_177,c_0_178]),c_0_179]),c_0_67]),c_0_127])]),c_0_180]),c_0_174]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC126-1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n023.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 02:01:22 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.ifkpqK6OU0/E---3.1_28318.p
% 138.99/18.07 # Version: 3.1pre001
% 138.99/18.07 # Preprocessing class: FSLSSMSMSSSNFFN.
% 138.99/18.07 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 138.99/18.07 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 138.99/18.07 # Starting new_bool_3 with 300s (1) cores
% 138.99/18.07 # Starting new_bool_1 with 300s (1) cores
% 138.99/18.07 # Starting sh5l with 300s (1) cores
% 138.99/18.07 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 28396 completed with status 0
% 138.99/18.07 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 138.99/18.07 # Preprocessing class: FSLSSMSMSSSNFFN.
% 138.99/18.07 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 138.99/18.07 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 138.99/18.07 # No SInE strategy applied
% 138.99/18.07 # Search class: FGHSM-FSLM21-MFFFFFNN
% 138.99/18.07 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 138.99/18.07 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 138.99/18.07 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 138.99/18.07 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 138.99/18.07 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 138.99/18.07 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 138.99/18.07 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 28402 completed with status 0
% 138.99/18.07 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 138.99/18.07 # Preprocessing class: FSLSSMSMSSSNFFN.
% 138.99/18.07 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 138.99/18.07 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 138.99/18.07 # No SInE strategy applied
% 138.99/18.07 # Search class: FGHSM-FSLM21-MFFFFFNN
% 138.99/18.07 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 138.99/18.07 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 138.99/18.07 # Preprocessing time : 0.002 s
% 138.99/18.07 # Presaturation interreduction done
% 138.99/18.07
% 138.99/18.07 # Proof found!
% 138.99/18.07 # SZS status Unsatisfiable
% 138.99/18.07 # SZS output start CNFRefutation
% See solution above
% 138.99/18.07 # Parsed axioms : 201
% 138.99/18.07 # Removed by relevancy pruning/SinE : 0
% 138.99/18.07 # Initial clauses : 201
% 138.99/18.07 # Removed in clause preprocessing : 0
% 138.99/18.07 # Initial clauses in saturation : 201
% 138.99/18.07 # Processed clauses : 53324
% 138.99/18.07 # ...of these trivial : 991
% 138.99/18.07 # ...subsumed : 45140
% 138.99/18.07 # ...remaining for further processing : 7193
% 138.99/18.07 # Other redundant clauses eliminated : 2997
% 138.99/18.07 # Clauses deleted for lack of memory : 0
% 138.99/18.07 # Backward-subsumed : 599
% 138.99/18.07 # Backward-rewritten : 1021
% 138.99/18.07 # Generated clauses : 739802
% 138.99/18.07 # ...of the previous two non-redundant : 706202
% 138.99/18.07 # ...aggressively subsumed : 0
% 138.99/18.07 # Contextual simplify-reflections : 1500
% 138.99/18.07 # Paramodulations : 736587
% 138.99/18.07 # Factorizations : 1
% 138.99/18.07 # NegExts : 0
% 138.99/18.07 # Equation resolutions : 3087
% 138.99/18.07 # Total rewrite steps : 890244
% 138.99/18.07 # Propositional unsat checks : 0
% 138.99/18.07 # Propositional check models : 0
% 138.99/18.07 # Propositional check unsatisfiable : 0
% 138.99/18.07 # Propositional clauses : 0
% 138.99/18.07 # Propositional clauses after purity: 0
% 138.99/18.07 # Propositional unsat core size : 0
% 138.99/18.07 # Propositional preprocessing time : 0.000
% 138.99/18.07 # Propositional encoding time : 0.000
% 138.99/18.07 # Propositional solver time : 0.000
% 138.99/18.07 # Success case prop preproc time : 0.000
% 138.99/18.07 # Success case prop encoding time : 0.000
% 138.99/18.07 # Success case prop solver time : 0.000
% 138.99/18.07 # Current number of processed clauses : 5234
% 138.99/18.07 # Positive orientable unit clauses : 627
% 138.99/18.07 # Positive unorientable unit clauses: 0
% 138.99/18.07 # Negative unit clauses : 904
% 138.99/18.07 # Non-unit-clauses : 3703
% 138.99/18.07 # Current number of unprocessed clauses: 643803
% 138.99/18.07 # ...number of literals in the above : 3364748
% 138.99/18.07 # Current number of archived formulas : 0
% 138.99/18.07 # Current number of archived clauses : 1936
% 138.99/18.07 # Clause-clause subsumption calls (NU) : 3274618
% 138.99/18.07 # Rec. Clause-clause subsumption calls : 862060
% 138.99/18.07 # Non-unit clause-clause subsumptions : 16508
% 138.99/18.07 # Unit Clause-clause subsumption calls : 275970
% 138.99/18.07 # Rewrite failures with RHS unbound : 0
% 138.99/18.07 # BW rewrite match attempts : 1910
% 138.99/18.07 # BW rewrite match successes : 308
% 138.99/18.07 # Condensation attempts : 0
% 138.99/18.07 # Condensation successes : 0
% 138.99/18.07 # Termbank termtop insertions : 18977830
% 138.99/18.07
% 138.99/18.07 # -------------------------------------------------
% 138.99/18.07 # User time : 16.797 s
% 138.99/18.07 # System time : 0.434 s
% 138.99/18.07 # Total time : 17.231 s
% 138.99/18.07 # Maximum resident set size: 2140 pages
% 138.99/18.07
% 138.99/18.07 # -------------------------------------------------
% 138.99/18.07 # User time : 83.991 s
% 138.99/18.07 # System time : 2.690 s
% 138.99/18.07 # Total time : 86.681 s
% 138.99/18.07 # Maximum resident set size: 1848 pages
% 138.99/18.07 % E---3.1 exiting
% 138.99/18.07 % E---3.1 exiting
%------------------------------------------------------------------------------