TSTP Solution File: SWC078-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC078-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:12 EDT 2023
% Result : Unsatisfiable 96.76s 13.81s
% Output : CNFRefutation 96.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 30
% Syntax : Number of clauses : 92 ( 26 unt; 17 nHn; 79 RR)
% Number of literals : 256 ( 59 equ; 161 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 128 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',co1_5) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause98) ).
cnf(co1_11,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause8) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',co1_9) ).
cnf(co1_13,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',co1_13) ).
cnf(co1_10,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',co1_10) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause120) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.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.iQvG8j3CMm/E---3.1_27326.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.iQvG8j3CMm/E---3.1_27326.p',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause53) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause138) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause85) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause72) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause86) ).
cnf(co1_7,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',co1_7) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause102) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause173) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause74) ).
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.iQvG8j3CMm/E---3.1_27326.p',clause149) ).
cnf(clause178,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause178) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause132) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause51) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',clause60) ).
cnf(co1_14,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',co1_14) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.iQvG8j3CMm/E---3.1_27326.p',co1_2) ).
cnf(c_0_30,negated_conjecture,
( nil != sk2
| nil != sk1 ),
co1_8 ).
cnf(c_0_31,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_32,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_33,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_34,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_11 ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_9 ).
cnf(c_0_37,negated_conjecture,
( sk3 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_13 ).
cnf(c_0_39,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_33,c_0_34]),c_0_35])]),c_0_36]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_10 ).
cnf(c_0_41,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_42,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_40,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_45,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_46,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_47,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_48,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_49,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_50,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_51,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_52,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_44,c_0_31]) ).
cnf(c_0_53,plain,
( app(X1,cons(X2,X3)) != X4
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ duplicatefreeP(X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48])]) ).
cnf(c_0_54,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_55,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_56,negated_conjecture,
( ssList(cons(sk5,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_57,negated_conjecture,
( app(X1,sk3) != X2
| ~ memberP(X1,sk5)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_42]),c_0_43]),c_0_35])]) ).
cnf(c_0_58,negated_conjecture,
memberP(sk3,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_42]),c_0_43]),c_0_35])]) ).
cnf(c_0_59,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(sk5,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( cons(sk5,sk3) != X1
| ~ ssList(X1)
| ~ duplicatefreeP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_51]),c_0_58]),c_0_52])]) ).
cnf(c_0_61,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(sk5,sk3)) ),
inference(spm,[status(thm)],[c_0_59,c_0_52]) ).
cnf(c_0_62,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,sk3)) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_63,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
co1_7 ).
cnf(c_0_65,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
clause102 ).
cnf(c_0_66,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_43]),c_0_52])]) ).
cnf(c_0_67,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_68,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_69,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_70,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
clause178 ).
cnf(c_0_71,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_31]),c_0_32]) ).
cnf(c_0_72,plain,
( X1 = X2
| neq(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_66])]) ).
cnf(c_0_73,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_35])]) ).
cnf(c_0_74,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_75,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_76,plain,
( segmentP(X1,X2)
| app(X3,app(X2,X4)) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_67,c_0_69]) ).
cnf(c_0_77,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_70]) ).
cnf(c_0_78,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
clause60 ).
cnf(c_0_79,negated_conjecture,
( nil = X1
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_80,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])])]) ).
cnf(c_0_81,negated_conjecture,
( segmentP(X1,sk3)
| app(X2,cons(sk5,X3)) != X1
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_51]),c_0_52])]) ).
cnf(c_0_82,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_66])]) ).
cnf(c_0_83,negated_conjecture,
( frontsegP(cons(sk5,X1),sk3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_42]),c_0_43]),c_0_35])]),c_0_78]) ).
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,
( nil = X1
| ~ frontsegP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_52])]) ).
cnf(c_0_87,negated_conjecture,
( segmentP(X1,sk3)
| ~ memberP(X1,sk5)
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_47]),c_0_48])])]) ).
cnf(c_0_88,negated_conjecture,
frontsegP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_42]),c_0_35])]) ).
cnf(c_0_89,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[c_0_84,c_0_39]) ).
cnf(c_0_90,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_85,c_0_32]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]),c_0_52]),c_0_89]),c_0_90])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/1.16 % Problem : SWC078-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/1.16 % Command : run_E %s %d THM
% 0.17/1.37 % Computer : n027.cluster.edu
% 0.17/1.37 % Model : x86_64 x86_64
% 0.17/1.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/1.37 % Memory : 8042.1875MB
% 0.17/1.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/1.37 % CPULimit : 2400
% 0.17/1.37 % WCLimit : 300
% 0.17/1.37 % DateTime : Tue Oct 3 02:16:37 EDT 2023
% 0.17/1.37 % CPUTime :
% 0.19/1.50 Running first-order theorem proving
% 0.19/1.50 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.iQvG8j3CMm/E---3.1_27326.p
% 96.76/13.81 # Version: 3.1pre001
% 96.76/13.81 # Preprocessing class: FSLSSMSMSSSNFFN.
% 96.76/13.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 96.76/13.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 96.76/13.81 # Starting new_bool_3 with 300s (1) cores
% 96.76/13.81 # Starting new_bool_1 with 300s (1) cores
% 96.76/13.81 # Starting sh5l with 300s (1) cores
% 96.76/13.81 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 27404 completed with status 0
% 96.76/13.81 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 96.76/13.81 # Preprocessing class: FSLSSMSMSSSNFFN.
% 96.76/13.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 96.76/13.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 96.76/13.81 # No SInE strategy applied
% 96.76/13.81 # Search class: FGHSM-FSLM21-MFFFFFNN
% 96.76/13.81 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 96.76/13.81 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 96.76/13.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 96.76/13.81 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 96.76/13.81 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 96.76/13.81 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 96.76/13.81 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 27413 completed with status 0
% 96.76/13.81 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 96.76/13.81 # Preprocessing class: FSLSSMSMSSSNFFN.
% 96.76/13.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 96.76/13.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 96.76/13.81 # No SInE strategy applied
% 96.76/13.81 # Search class: FGHSM-FSLM21-MFFFFFNN
% 96.76/13.81 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 96.76/13.81 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 96.76/13.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 96.76/13.81 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 96.76/13.81 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 96.76/13.81 # Preprocessing time : 0.004 s
% 96.76/13.81
% 96.76/13.81 # Proof found!
% 96.76/13.81 # SZS status Unsatisfiable
% 96.76/13.81 # SZS output start CNFRefutation
% See solution above
% 96.76/13.81 # Parsed axioms : 199
% 96.76/13.81 # Removed by relevancy pruning/SinE : 0
% 96.76/13.81 # Initial clauses : 199
% 96.76/13.81 # Removed in clause preprocessing : 0
% 96.76/13.81 # Initial clauses in saturation : 199
% 96.76/13.81 # Processed clauses : 16485
% 96.76/13.81 # ...of these trivial : 353
% 96.76/13.81 # ...subsumed : 10155
% 96.76/13.81 # ...remaining for further processing : 5977
% 96.76/13.81 # Other redundant clauses eliminated : 383
% 96.76/13.81 # Clauses deleted for lack of memory : 0
% 96.76/13.81 # Backward-subsumed : 550
% 96.76/13.81 # Backward-rewritten : 272
% 96.76/13.81 # Generated clauses : 366329
% 96.76/13.81 # ...of the previous two non-redundant : 351761
% 96.76/13.81 # ...aggressively subsumed : 0
% 96.76/13.81 # Contextual simplify-reflections : 843
% 96.76/13.81 # Paramodulations : 364940
% 96.76/13.81 # Factorizations : 484
% 96.76/13.81 # NegExts : 0
% 96.76/13.81 # Equation resolutions : 865
% 96.76/13.81 # Total rewrite steps : 154700
% 96.76/13.81 # Propositional unsat checks : 1
% 96.76/13.81 # Propositional check models : 0
% 96.76/13.81 # Propositional check unsatisfiable : 0
% 96.76/13.81 # Propositional clauses : 0
% 96.76/13.81 # Propositional clauses after purity: 0
% 96.76/13.81 # Propositional unsat core size : 0
% 96.76/13.81 # Propositional preprocessing time : 0.000
% 96.76/13.81 # Propositional encoding time : 1.158
% 96.76/13.81 # Propositional solver time : 0.440
% 96.76/13.81 # Success case prop preproc time : 0.000
% 96.76/13.81 # Success case prop encoding time : 0.000
% 96.76/13.81 # Success case prop solver time : 0.000
% 96.76/13.81 # Current number of processed clauses : 5110
% 96.76/13.81 # Positive orientable unit clauses : 234
% 96.76/13.81 # Positive unorientable unit clauses: 0
% 96.76/13.81 # Negative unit clauses : 117
% 96.76/13.81 # Non-unit-clauses : 4759
% 96.76/13.81 # Current number of unprocessed clauses: 324828
% 96.76/13.81 # ...number of literals in the above : 1864279
% 96.76/13.81 # Current number of archived formulas : 0
% 96.76/13.81 # Current number of archived clauses : 862
% 96.76/13.81 # Clause-clause subsumption calls (NU) : 3050100
% 96.76/13.81 # Rec. Clause-clause subsumption calls : 902439
% 96.76/13.81 # Non-unit clause-clause subsumptions : 6258
% 96.76/13.81 # Unit Clause-clause subsumption calls : 36127
% 96.76/13.81 # Rewrite failures with RHS unbound : 0
% 96.76/13.81 # BW rewrite match attempts : 119
% 96.76/13.81 # BW rewrite match successes : 91
% 96.76/13.81 # Condensation attempts : 0
% 96.76/13.81 # Condensation successes : 0
% 96.76/13.81 # Termbank termtop insertions : 16058365
% 96.76/13.81
% 96.76/13.81 # -------------------------------------------------
% 96.76/13.81 # User time : 11.627 s
% 96.76/13.81 # System time : 0.352 s
% 96.76/13.81 # Total time : 11.979 s
% 96.76/13.81 # Maximum resident set size: 2112 pages
% 96.76/13.81
% 96.76/13.81 # -------------------------------------------------
% 96.76/13.81 # User time : 58.190 s
% 96.76/13.81 # System time : 1.955 s
% 96.76/13.81 # Total time : 60.145 s
% 96.76/13.81 # Maximum resident set size: 1852 pages
% 96.76/13.81 % E---3.1 exiting
% 96.76/13.81 % E---3.1 exiting
%------------------------------------------------------------------------------