TSTP Solution File: SWC393-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC393-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:40:47 EDT 2023
% Result : Unsatisfiable 3.42s 0.86s
% Output : CNFRefutation 3.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 33
% Syntax : Number of clauses : 98 ( 44 unt; 6 nHn; 79 RR)
% Number of literals : 230 ( 36 equ; 136 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 : 131 ( 33 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',co1_6) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',co1_1) ).
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.Z863RmNW0X/E---3.1_16876.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/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause169) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',co1_7) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause53) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause72) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause85) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause86) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause144) ).
cnf(clause136,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause136) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause58) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause8) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause132) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause51) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause131) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause73) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause50) ).
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.Z863RmNW0X/E---3.1_16876.p',clause149) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',co1_5) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause140) ).
cnf(clause141,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause141) ).
cnf(co1_12,negated_conjecture,
( segmentP(sk4,sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',co1_12) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause100) ).
cnf(clause168,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause168) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',co1_9) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause48) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause49) ).
cnf(co1_10,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',co1_10) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Z863RmNW0X/E---3.1_16876.p',clause71) ).
cnf(c_0_33,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_34,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_35,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_36,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_37,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_38,negated_conjecture,
memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_40,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_41,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_36]) ).
cnf(c_0_42,negated_conjecture,
app(skaf42(sk3,sk5),cons(sk5,skaf43(sk5,sk3))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])]) ).
cnf(c_0_43,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_44,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(app(sk3,cons(sk5,X1)))
| ~ ssList(X1)
| ~ duplicatefreeP(app(sk3,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_41,c_0_42]),c_0_39]),c_0_43]),c_0_44])]) ).
cnf(c_0_46,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_47,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk3,cons(sk5,X2)))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_49,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_40])]) ).
cnf(c_0_50,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_51,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_52,negated_conjecture,
( ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_39])]) ).
cnf(c_0_53,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_51]),c_0_48]) ).
cnf(c_0_54,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_52,c_0_44]) ).
cnf(c_0_55,negated_conjecture,
( frontsegP(sk3,skaf42(sk3,sk5))
| ~ ssList(cons(sk5,skaf43(sk5,sk3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_42]),c_0_44])]) ).
cnf(c_0_56,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_54])]) ).
cnf(c_0_57,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause136 ).
cnf(c_0_58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
clause58 ).
cnf(c_0_59,axiom,
ssList(nil),
clause8 ).
cnf(c_0_60,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_61,negated_conjecture,
frontsegP(sk3,skaf42(sk3,sk5)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_43])]) ).
cnf(c_0_62,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_63,negated_conjecture,
app(skaf42(sk3,sk5),skaf45(sk3,skaf42(sk3,sk5))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_44]),c_0_40])]) ).
cnf(c_0_64,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_65,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_66,negated_conjecture,
rearsegP(sk3,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_44]),c_0_64])]) ).
cnf(c_0_67,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_68,negated_conjecture,
app(skaf46(sk3,nil),nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_59]),c_0_40])]) ).
cnf(c_0_69,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_70,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_71,negated_conjecture,
skaf46(sk3,nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69])]) ).
cnf(c_0_72,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_73,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_74,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
clause140 ).
cnf(c_0_75,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
clause141 ).
cnf(c_0_76,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_70]),c_0_48]) ).
cnf(c_0_77,negated_conjecture,
app(sk3,nil) = sk3,
inference(rw,[status(thm)],[c_0_68,c_0_71]) ).
cnf(c_0_78,negated_conjecture,
( segmentP(sk4,sk3)
| ~ neq(sk4,nil) ),
co1_12 ).
cnf(c_0_79,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_80,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_81,plain,
( memberP(app(X1,X2),X3)
| ~ memberP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_54])]) ).
cnf(c_0_82,negated_conjecture,
( memberP(app(X1,sk3),sk5)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_38]),c_0_39]),c_0_40])]) ).
cnf(c_0_83,negated_conjecture,
( ssList(app(X1,sk3))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_59]),c_0_40])]) ).
cnf(c_0_84,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause168 ).
cnf(c_0_85,negated_conjecture,
( sk4 = nil
| segmentP(sk4,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]),c_0_59])]) ).
cnf(c_0_86,negated_conjecture,
~ memberP(sk2,sk5),
co1_9 ).
cnf(c_0_87,negated_conjecture,
( memberP(app(app(X1,sk3),X2),sk5)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]) ).
cnf(c_0_88,negated_conjecture,
( app(app(skaf47(sk4,sk3),sk3),skaf48(sk3,sk4)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_40]),c_0_80])]) ).
cnf(c_0_89,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_90,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_91,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_86,c_0_73]) ).
cnf(c_0_92,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_10 ).
cnf(c_0_93,negated_conjecture,
sk4 = nil,
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_88]),c_0_89]),c_0_90])]),c_0_91]) ).
cnf(c_0_94,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_95,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93])]) ).
cnf(c_0_96,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_54])]) ).
cnf(c_0_97,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_95]),c_0_96]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC393-1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n016.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:14:37 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.Z863RmNW0X/E---3.1_16876.p
% 3.42/0.86 # Version: 3.1pre001
% 3.42/0.86 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.42/0.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.42/0.86 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.42/0.86 # Starting new_bool_3 with 300s (1) cores
% 3.42/0.86 # Starting new_bool_1 with 300s (1) cores
% 3.42/0.86 # Starting sh5l with 300s (1) cores
% 3.42/0.86 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 16954 completed with status 0
% 3.42/0.86 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.42/0.86 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.42/0.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.42/0.86 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.42/0.86 # No SInE strategy applied
% 3.42/0.86 # Search class: FGHSM-FSLM21-MFFFFFNN
% 3.42/0.86 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 3.42/0.86 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 3.42/0.86 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.42/0.86 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 3.42/0.86 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 3.42/0.86 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 3.42/0.86 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 16960 completed with status 0
% 3.42/0.86 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 3.42/0.86 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.42/0.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.42/0.86 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.42/0.86 # No SInE strategy applied
% 3.42/0.86 # Search class: FGHSM-FSLM21-MFFFFFNN
% 3.42/0.86 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 3.42/0.86 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 3.42/0.86 # Preprocessing time : 0.003 s
% 3.42/0.86 # Presaturation interreduction done
% 3.42/0.86
% 3.42/0.86 # Proof found!
% 3.42/0.86 # SZS status Unsatisfiable
% 3.42/0.86 # SZS output start CNFRefutation
% See solution above
% 3.42/0.86 # Parsed axioms : 197
% 3.42/0.86 # Removed by relevancy pruning/SinE : 0
% 3.42/0.86 # Initial clauses : 197
% 3.42/0.86 # Removed in clause preprocessing : 0
% 3.42/0.86 # Initial clauses in saturation : 197
% 3.42/0.86 # Processed clauses : 4068
% 3.42/0.86 # ...of these trivial : 48
% 3.42/0.86 # ...subsumed : 2610
% 3.42/0.86 # ...remaining for further processing : 1410
% 3.42/0.86 # Other redundant clauses eliminated : 291
% 3.42/0.86 # Clauses deleted for lack of memory : 0
% 3.42/0.86 # Backward-subsumed : 43
% 3.42/0.86 # Backward-rewritten : 513
% 3.42/0.86 # Generated clauses : 13354
% 3.42/0.86 # ...of the previous two non-redundant : 11880
% 3.42/0.86 # ...aggressively subsumed : 0
% 3.42/0.86 # Contextual simplify-reflections : 188
% 3.42/0.86 # Paramodulations : 13051
% 3.42/0.86 # Factorizations : 0
% 3.42/0.86 # NegExts : 0
% 3.42/0.86 # Equation resolutions : 304
% 3.42/0.86 # Total rewrite steps : 14732
% 3.42/0.86 # Propositional unsat checks : 0
% 3.42/0.86 # Propositional check models : 0
% 3.42/0.86 # Propositional check unsatisfiable : 0
% 3.42/0.86 # Propositional clauses : 0
% 3.42/0.86 # Propositional clauses after purity: 0
% 3.42/0.86 # Propositional unsat core size : 0
% 3.42/0.86 # Propositional preprocessing time : 0.000
% 3.42/0.86 # Propositional encoding time : 0.000
% 3.42/0.86 # Propositional solver time : 0.000
% 3.42/0.86 # Success case prop preproc time : 0.000
% 3.42/0.86 # Success case prop encoding time : 0.000
% 3.42/0.86 # Success case prop solver time : 0.000
% 3.42/0.86 # Current number of processed clauses : 642
% 3.42/0.86 # Positive orientable unit clauses : 94
% 3.42/0.86 # Positive unorientable unit clauses: 0
% 3.42/0.86 # Negative unit clauses : 8
% 3.42/0.86 # Non-unit-clauses : 540
% 3.42/0.86 # Current number of unprocessed clauses: 7743
% 3.42/0.86 # ...number of literals in the above : 43262
% 3.42/0.86 # Current number of archived formulas : 0
% 3.42/0.86 # Current number of archived clauses : 745
% 3.42/0.86 # Clause-clause subsumption calls (NU) : 158370
% 3.42/0.86 # Rec. Clause-clause subsumption calls : 46144
% 3.42/0.86 # Non-unit clause-clause subsumptions : 2157
% 3.42/0.86 # Unit Clause-clause subsumption calls : 806
% 3.42/0.86 # Rewrite failures with RHS unbound : 0
% 3.42/0.86 # BW rewrite match attempts : 80
% 3.42/0.86 # BW rewrite match successes : 49
% 3.42/0.86 # Condensation attempts : 0
% 3.42/0.86 # Condensation successes : 0
% 3.42/0.86 # Termbank termtop insertions : 264563
% 3.42/0.86
% 3.42/0.86 # -------------------------------------------------
% 3.42/0.86 # User time : 0.397 s
% 3.42/0.86 # System time : 0.011 s
% 3.42/0.86 # Total time : 0.408 s
% 3.42/0.86 # Maximum resident set size: 2104 pages
% 3.42/0.86
% 3.42/0.86 # -------------------------------------------------
% 3.42/0.86 # User time : 1.958 s
% 3.42/0.86 # System time : 0.091 s
% 3.42/0.86 # Total time : 2.049 s
% 3.42/0.86 # Maximum resident set size: 1852 pages
% 3.42/0.87 % E---3.1 exiting
% 3.42/0.87 % E---3.1 exiting
%------------------------------------------------------------------------------