TSTP Solution File: SWC075-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC075-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:41:21 EDT 2023
% Result : Unsatisfiable 0.69s 0.52s
% Output : CNFRefutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of clauses : 84 ( 32 unt; 2 nHn; 84 RR)
% Number of literals : 200 ( 94 equ; 119 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
app(sk6,sk5) = sk3,
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',co1_6) ).
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.u0LiHqHouv/E---3.1_5744.p',clause149) ).
cnf(co1_9,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',co1_9) ).
cnf(co1_8,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',co1_8) ).
cnf(co1_10,negated_conjecture,
app(sk5,sk6) = sk4,
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',co1_10) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',co1_5) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',clause151) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',clause8) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',clause73) ).
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.u0LiHqHouv/E---3.1_5744.p',clause173) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',clause150) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',co1_2) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',clause85) ).
cnf(co1_7,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',co1_7) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',clause100) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',clause119) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',co1_1) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',clause118) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',clause145) ).
cnf(co1_12,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p',co1_12) ).
cnf(c_0_22,negated_conjecture,
app(sk6,sk5) = sk3,
co1_11 ).
cnf(c_0_23,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_24,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_25,negated_conjecture,
app(sk6,sk5) = sk1,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
ssList(sk6),
co1_9 ).
cnf(c_0_27,negated_conjecture,
ssList(sk5),
co1_8 ).
cnf(c_0_28,negated_conjecture,
app(sk5,sk6) = sk4,
co1_10 ).
cnf(c_0_29,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_30,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause151 ).
cnf(c_0_31,negated_conjecture,
( app(sk6,app(sk5,X1)) = app(sk1,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_32,negated_conjecture,
app(sk5,sk6) = sk2,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( X1 = sk6
| app(X1,sk5) != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_34,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_37,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_38,negated_conjecture,
app(sk6,sk2) = app(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26])]) ).
cnf(c_0_39,negated_conjecture,
( sk6 = nil
| sk5 != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_27])]) ).
cnf(c_0_40,negated_conjecture,
app(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_36]),c_0_25]),c_0_35]),c_0_27])]) ).
cnf(c_0_41,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause150 ).
cnf(c_0_42,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_37]) ).
cnf(c_0_43,negated_conjecture,
( app(nil,sk2) = sk1
| sk5 != sk1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_44,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_45,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_34]),c_0_35])]) ).
cnf(c_0_46,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_47,negated_conjecture,
( app(sk5,nil) = sk2
| sk5 != sk1 ),
inference(spm,[status(thm)],[c_0_32,c_0_39]) ).
cnf(c_0_48,negated_conjecture,
( X1 = sk6
| app(sk5,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_32]),c_0_26]),c_0_27])]) ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
co1_7 ).
cnf(c_0_50,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_51,negated_conjecture,
( segmentP(app(sk2,X1),sk6)
| ~ ssList(app(sk2,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_32]),c_0_26]),c_0_27])]) ).
cnf(c_0_52,negated_conjecture,
( sk2 = X1
| app(nil,X1) != sk1
| sk5 != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_43]),c_0_44]),c_0_35])]) ).
cnf(c_0_53,negated_conjecture,
app(nil,app(sk1,sk6)) = app(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_38]),c_0_26]),c_0_44])]) ).
cnf(c_0_54,negated_conjecture,
ssList(app(sk1,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_38]),c_0_26]),c_0_44])]) ).
cnf(c_0_55,negated_conjecture,
( app(sk1,sk6) = sk1
| sk5 != sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_47]),c_0_35])]),c_0_38]),c_0_40]) ).
cnf(c_0_56,negated_conjecture,
( X1 = sk5
| app(sk6,X1) != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_25]),c_0_27]),c_0_26])]) ).
cnf(c_0_57,negated_conjecture,
( sk6 = nil
| sk5 != sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_36]),c_0_35]),c_0_27])]) ).
cnf(c_0_58,negated_conjecture,
( nil = X1
| ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_35])]) ).
cnf(c_0_59,negated_conjecture,
segmentP(sk2,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_36]),c_0_44]),c_0_35])]) ).
cnf(c_0_60,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_34]),c_0_35])]),c_0_46]) ).
cnf(c_0_61,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_62,negated_conjecture,
( segmentP(app(sk1,X1),sk5)
| ~ ssList(app(sk1,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_25]),c_0_27]),c_0_26])]) ).
cnf(c_0_63,negated_conjecture,
( app(sk1,sk6) = sk2
| sk5 != sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]),c_0_55]) ).
cnf(c_0_64,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_65,negated_conjecture,
( X1 = sk5
| app(nil,X1) != sk1
| sk5 != sk2
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_66,negated_conjecture,
( sk5 = sk2
| app(sk1,sk6) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_38]),c_0_44])]) ).
cnf(c_0_67,negated_conjecture,
( sk6 = nil
| ~ segmentP(sk1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_26])]) ).
cnf(c_0_68,negated_conjecture,
segmentP(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_25]),c_0_27]),c_0_26])]) ).
cnf(c_0_69,negated_conjecture,
( sk5 = nil
| sk1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_25]),c_0_27]),c_0_26])]) ).
cnf(c_0_70,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_71,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_72,negated_conjecture,
( segmentP(sk2,sk5)
| sk5 != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_44]),c_0_26])]) ).
cnf(c_0_73,negated_conjecture,
segmentP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_36]),c_0_64]),c_0_35])]) ).
cnf(c_0_74,negated_conjecture,
( app(sk1,sk6) = sk5
| app(sk1,sk6) != sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_53]),c_0_54])]),c_0_66]) ).
cnf(c_0_75,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_76,negated_conjecture,
( app(nil,sk6) = sk2
| sk1 != nil ),
inference(spm,[status(thm)],[c_0_32,c_0_69]) ).
cnf(c_0_77,negated_conjecture,
( sk6 = nil
| sk1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_25]),c_0_27]),c_0_26])]) ).
cnf(c_0_78,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_71])]),c_0_35])]) ).
cnf(c_0_79,negated_conjecture,
( nil != sk2
| nil != sk1 ),
co1_12 ).
cnf(c_0_80,negated_conjecture,
( sk5 = nil
| sk5 != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_72]),c_0_73]),c_0_27])]) ).
cnf(c_0_81,negated_conjecture,
sk5 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_40]),c_0_75]),c_0_40])]) ).
cnf(c_0_82,negated_conjecture,
sk1 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]),c_0_79]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81]),c_0_81])]),c_0_82]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SWC075-1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Oct 3 02:06:07 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.45 Running first-order model finding
% 0.20/0.45 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.u0LiHqHouv/E---3.1_5744.p
% 0.69/0.52 # Version: 3.1pre001
% 0.69/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.69/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.69/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.69/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.69/0.52 # Starting sh5l with 300s (1) cores
% 0.69/0.52 # new_bool_3 with pid 5885 completed with status 0
% 0.69/0.52 # Result found by new_bool_3
% 0.69/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.69/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.69/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.69/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.69/0.52 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.69/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.69/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.69/0.52 # SAT001_MinMin_p005000_rr_RG with pid 5889 completed with status 0
% 0.69/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.69/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.69/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.69/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.69/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.69/0.52 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.69/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.69/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.69/0.52 # Preprocessing time : 0.003 s
% 0.69/0.52 # Presaturation interreduction done
% 0.69/0.52
% 0.69/0.52 # Proof found!
% 0.69/0.52 # SZS status Unsatisfiable
% 0.69/0.52 # SZS output start CNFRefutation
% See solution above
% 0.69/0.52 # Parsed axioms : 197
% 0.69/0.52 # Removed by relevancy pruning/SinE : 156
% 0.69/0.52 # Initial clauses : 41
% 0.69/0.52 # Removed in clause preprocessing : 0
% 0.69/0.52 # Initial clauses in saturation : 41
% 0.69/0.52 # Processed clauses : 1024
% 0.69/0.52 # ...of these trivial : 55
% 0.69/0.52 # ...subsumed : 578
% 0.69/0.52 # ...remaining for further processing : 391
% 0.69/0.52 # Other redundant clauses eliminated : 16
% 0.69/0.52 # Clauses deleted for lack of memory : 0
% 0.69/0.52 # Backward-subsumed : 23
% 0.69/0.52 # Backward-rewritten : 175
% 0.69/0.52 # Generated clauses : 3713
% 0.69/0.52 # ...of the previous two non-redundant : 3543
% 0.69/0.52 # ...aggressively subsumed : 0
% 0.69/0.52 # Contextual simplify-reflections : 35
% 0.69/0.52 # Paramodulations : 3694
% 0.69/0.52 # Factorizations : 0
% 0.69/0.52 # NegExts : 0
% 0.69/0.52 # Equation resolutions : 20
% 0.69/0.52 # Total rewrite steps : 4752
% 0.69/0.52 # Propositional unsat checks : 0
% 0.69/0.52 # Propositional check models : 0
% 0.69/0.52 # Propositional check unsatisfiable : 0
% 0.69/0.52 # Propositional clauses : 0
% 0.69/0.52 # Propositional clauses after purity: 0
% 0.69/0.52 # Propositional unsat core size : 0
% 0.69/0.52 # Propositional preprocessing time : 0.000
% 0.69/0.52 # Propositional encoding time : 0.000
% 0.69/0.52 # Propositional solver time : 0.000
% 0.69/0.52 # Success case prop preproc time : 0.000
% 0.69/0.52 # Success case prop encoding time : 0.000
% 0.69/0.52 # Success case prop solver time : 0.000
% 0.69/0.52 # Current number of processed clauses : 149
% 0.69/0.52 # Positive orientable unit clauses : 19
% 0.69/0.52 # Positive unorientable unit clauses: 0
% 0.69/0.52 # Negative unit clauses : 7
% 0.69/0.52 # Non-unit-clauses : 123
% 0.69/0.52 # Current number of unprocessed clauses: 2523
% 0.69/0.52 # ...number of literals in the above : 12828
% 0.69/0.52 # Current number of archived formulas : 0
% 0.69/0.52 # Current number of archived clauses : 237
% 0.69/0.52 # Clause-clause subsumption calls (NU) : 12469
% 0.69/0.52 # Rec. Clause-clause subsumption calls : 4606
% 0.69/0.52 # Non-unit clause-clause subsumptions : 441
% 0.69/0.52 # Unit Clause-clause subsumption calls : 547
% 0.69/0.52 # Rewrite failures with RHS unbound : 0
% 0.69/0.52 # BW rewrite match attempts : 7
% 0.69/0.52 # BW rewrite match successes : 7
% 0.69/0.52 # Condensation attempts : 0
% 0.69/0.52 # Condensation successes : 0
% 0.69/0.52 # Termbank termtop insertions : 64923
% 0.69/0.52
% 0.69/0.52 # -------------------------------------------------
% 0.69/0.52 # User time : 0.057 s
% 0.69/0.52 # System time : 0.005 s
% 0.69/0.52 # Total time : 0.062 s
% 0.69/0.52 # Maximum resident set size: 1984 pages
% 0.69/0.52
% 0.69/0.52 # -------------------------------------------------
% 0.69/0.52 # User time : 0.060 s
% 0.69/0.52 # System time : 0.006 s
% 0.69/0.52 # Total time : 0.066 s
% 0.69/0.52 # Maximum resident set size: 1852 pages
% 0.69/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------