TSTP Solution File: GRP727-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP727-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 17:43:03 EDT 2023
% Result : Unsatisfiable 131.57s 17.88s
% Output : CNFRefutation 131.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 13
% Syntax : Number of clauses : 87 ( 87 unt; 0 nHn; 4 RR)
% Number of literals : 87 ( 86 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 254 ( 57 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c06,axiom,
mult(i(X1),mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',c06) ).
cnf(c04,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',c04) ).
cnf(c02,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',c02) ).
cnf(c10,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',c10) ).
cnf(c13,axiom,
op_t(X1,X2) = mult(i(X2),mult(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',c13) ).
cnf(c05,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',c05) ).
cnf(c20,axiom,
asoc(asoc(X1,X2,X3),X4,X5) = unit,
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',c20) ).
cnf(c11,axiom,
op_l(X1,X2,X3) = mult(i(mult(X3,X2)),mult(X3,mult(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',c11) ).
cnf(c01,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',c01) ).
cnf(c03,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',c03) ).
cnf(c09,axiom,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',c09) ).
cnf(c18,axiom,
op_t(op_l(X1,X2,X3),X4) = op_l(op_t(X1,X4),X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',c18) ).
cnf(goals,negated_conjecture,
asoc(a,b,asoc(c,d,e)) != unit,
file('/export/starexec/sandbox2/tmp/tmp.g9QnCKdlbH/E---3.1_29962.p',goals) ).
cnf(c_0_13,axiom,
mult(i(X1),mult(X1,X2)) = X2,
c06 ).
cnf(c_0_14,axiom,
mult(i(X1),X1) = unit,
c04 ).
cnf(c_0_15,axiom,
mult(X1,unit) = X1,
c02 ).
cnf(c_0_16,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3)),
c10 ).
cnf(c_0_17,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,axiom,
op_t(X1,X2) = mult(i(X2),mult(X1,X2)),
c13 ).
cnf(c_0_19,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
c05 ).
cnf(c_0_20,plain,
mult(X1,asoc(X1,i(X2),X2)) = mult(mult(X1,i(X2)),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_15]) ).
cnf(c_0_21,axiom,
asoc(asoc(X1,X2,X3),X4,X5) = unit,
c20 ).
cnf(c_0_22,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_23,plain,
op_t(i(X1),i(X2)) = i(op_t(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_18]) ).
cnf(c_0_24,plain,
mult(mult(asoc(X1,X2,X3),i(X4)),X4) = asoc(X1,X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]) ).
cnf(c_0_25,plain,
mult(X1,i(mult(X1,X2))) = i(X2),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_26,plain,
i(op_t(X1,i(X2))) = op_t(i(X1),X2),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_27,plain,
op_t(asoc(X1,X2,X3),X4) = asoc(X1,X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18]) ).
cnf(c_0_28,plain,
mult(i(mult(X1,X2)),X2) = op_t(i(X1),mult(X1,X2)),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_29,plain,
op_t(i(asoc(X1,X2,X3)),X4) = i(asoc(X1,X2,X3)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
i(mult(i(X1),X2)) = mult(X1,i(X2)),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_31,plain,
mult(X1,op_t(X2,X1)) = mult(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_17]) ).
cnf(c_0_32,plain,
mult(i(mult(X1,mult(X2,X3))),mult(mult(X1,X2),X3)) = asoc(X1,X2,X3),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_33,plain,
mult(i(mult(asoc(X1,X2,X3),X4)),X4) = i(asoc(X1,X2,X3)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
mult(mult(asoc(X1,X2,X3),X4),X5) = mult(asoc(X1,X2,X3),mult(X4,X5)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_15]) ).
cnf(c_0_35,plain,
mult(mult(X1,i(X2)),mult(i(X1),X2)) = unit,
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_36,plain,
mult(X1,asoc(X2,X3,X4)) = mult(asoc(X2,X3,X4),X1),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_37,axiom,
op_l(X1,X2,X3) = mult(i(mult(X3,X2)),mult(X3,mult(X2,X1))),
c11 ).
cnf(c_0_38,plain,
asoc(i(mult(asoc(X1,X2,X3),X4)),X4,X5) = unit,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_30]),c_0_34]),c_0_25]),c_0_35]) ).
cnf(c_0_39,plain,
op_t(X1,asoc(X2,X3,X4)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_36]),c_0_18]) ).
cnf(c_0_40,axiom,
mult(unit,X1) = X1,
c01 ).
cnf(c_0_41,axiom,
mult(X1,i(X1)) = unit,
c03 ).
cnf(c_0_42,plain,
mult(op_l(X1,X2,X3),asoc(i(mult(X3,X2)),X3,mult(X2,X1))) = mult(mult(i(mult(X3,X2)),X3),mult(X2,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_37]) ).
cnf(c_0_43,plain,
asoc(i(mult(X1,asoc(X2,X3,X4))),X1,X5) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_31]),c_0_39]) ).
cnf(c_0_44,plain,
mult(i(mult(X1,asoc(X2,X3,X4))),X1) = i(asoc(X2,X3,X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_36]),c_0_29]) ).
cnf(c_0_45,plain,
mult(i(asoc(X1,X2,X3)),mult(mult(X1,X2),X3)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_39]) ).
cnf(c_0_46,plain,
i(unit) = unit,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
mult(mult(X1,X2),op_l(X3,X2,X1)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_37]),c_0_17]) ).
cnf(c_0_48,plain,
op_l(X1,asoc(X2,X3,X4),X5) = X1,
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_42,c_0_36]),c_0_43]),c_0_15]),c_0_44]),c_0_18]),c_0_39]) ).
cnf(c_0_49,plain,
mult(mult(X1,asoc(X2,X3,X4)),X5) = mult(asoc(X2,X3,X4),mult(X1,X5)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_36]),c_0_21]),c_0_46]),c_0_40]) ).
cnf(c_0_50,plain,
i(op_t(i(X1),X2)) = op_t(X1,i(X2)),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_51,axiom,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
c09 ).
cnf(c_0_52,plain,
mult(asoc(X1,X2,X3),mult(X4,X5)) = mult(X4,mult(asoc(X1,X2,X3),X5)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_53,plain,
mult(mult(X1,i(X2)),mult(mult(i(X1),X2),X3)) = X3,
inference(spm,[status(thm)],[c_0_13,c_0_30]) ).
cnf(c_0_54,plain,
mult(mult(X1,i(mult(X2,X3))),asoc(X1,i(X2),i(X3))) = mult(mult(X1,i(X2)),i(X3)),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_55,plain,
mult(mult(X1,mult(X2,X3)),i(mult(mult(X1,X2),X3))) = i(asoc(X1,X2,X3)),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_56,axiom,
op_t(op_l(X1,X2,X3),X4) = op_l(op_t(X1,X4),X2,X3),
c18 ).
cnf(c_0_57,plain,
mult(mult(X1,i(X2)),X2) = op_t(X1,mult(i(X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_30]) ).
cnf(c_0_58,plain,
mult(X1,mult(X2,i(X1))) = op_t(X2,i(X1)),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_59,plain,
op_t(X1,i(asoc(X2,X3,X4))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_39]),c_0_17]) ).
cnf(c_0_60,plain,
mult(mult(X1,mult(X2,mult(X3,mult(X2,X1)))),X4) = mult(X1,mult(X2,mult(X3,mult(X2,mult(X1,X4))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_51]),c_0_51]) ).
cnf(c_0_61,plain,
mult(mult(X1,X2),asoc(X3,X4,X5)) = mult(X1,mult(asoc(X3,X4,X5),X2)),
inference(spm,[status(thm)],[c_0_36,c_0_52]) ).
cnf(c_0_62,plain,
op_l(X1,X2,asoc(X3,X4,X5)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_34]),c_0_37]) ).
cnf(c_0_63,plain,
asoc(i(X1),i(X2),i(X3)) = i(asoc(X1,X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_17]),c_0_19]),c_0_19]),c_0_55]) ).
cnf(c_0_64,plain,
mult(i(mult(X1,X2)),mult(X1,mult(X3,X2))) = op_t(op_l(X3,X2,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_56]) ).
cnf(c_0_65,plain,
mult(i(mult(X1,X2)),op_t(X1,X2)) = op_t(i(X2),mult(X1,X2)),
inference(spm,[status(thm)],[c_0_18,c_0_18]) ).
cnf(c_0_66,plain,
op_t(X1,mult(i(X1),asoc(X2,X3,X4))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_57]),c_0_58]),c_0_59]) ).
cnf(c_0_67,plain,
mult(i(mult(X1,mult(X2,mult(X3,mult(X2,X1))))),mult(X1,mult(X2,mult(X3,mult(X2,mult(X1,X4)))))) = X4,
inference(spm,[status(thm)],[c_0_13,c_0_60]) ).
cnf(c_0_68,plain,
mult(X1,mult(X2,mult(X3,asoc(X1,X2,X3)))) = mult(mult(X1,X2),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_61]),c_0_52]),c_0_36]) ).
cnf(c_0_69,plain,
mult(mult(X1,i(X2)),mult(i(X1),mult(X2,X3))) = op_l(X3,X2,i(X1)),
inference(spm,[status(thm)],[c_0_37,c_0_30]) ).
cnf(c_0_70,plain,
op_l(X1,X2,i(asoc(X3,X4,X5))) = X1,
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_71,plain,
op_t(X1,mult(asoc(X2,X3,X4),X5)) = op_t(X1,X5),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_52]),c_0_64]),c_0_62]) ).
cnf(c_0_72,plain,
mult(X1,op_t(X2,i(mult(X2,X1)))) = op_t(mult(X2,X1),i(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_25]),c_0_17]),c_0_17]) ).
cnf(c_0_73,plain,
op_t(X1,i(mult(X1,asoc(X2,X3,X4)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_66]),c_0_17]),c_0_17]) ).
cnf(c_0_74,plain,
op_l(op_l(X1,X2,X3),X3,X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_37]),c_0_14]),c_0_15]),c_0_37]) ).
cnf(c_0_75,plain,
op_l(mult(X1,asoc(X2,X3,X1)),X3,X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_68]),c_0_13]) ).
cnf(c_0_76,plain,
mult(op_l(X1,X2,X3),asoc(X3,X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_45]),c_0_34]),c_0_37]),c_0_70]),c_0_36]) ).
cnf(c_0_77,plain,
op_t(X1,mult(X2,asoc(X3,X4,X5))) = op_t(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_59]),c_0_73]) ).
cnf(c_0_78,plain,
mult(X1,asoc(X2,X3,X1)) = op_l(X1,X2,X3),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,plain,
mult(i(op_l(X1,X2,X3)),X1) = asoc(X3,X2,X1),
inference(spm,[status(thm)],[c_0_13,c_0_76]) ).
cnf(c_0_80,plain,
op_t(X1,op_l(X2,X3,X4)) = op_t(X1,X2),
inference(spm,[status(thm)],[c_0_77,c_0_76]) ).
cnf(c_0_81,plain,
mult(i(mult(mult(X1,X2),X3)),mult(X1,mult(X2,X3))) = i(asoc(X1,X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_16]),c_0_39]),c_0_29]) ).
cnf(c_0_82,plain,
i(asoc(X1,X2,X3)) = asoc(X2,X1,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_78]),c_0_39]),c_0_79]),c_0_80]),c_0_29]) ).
cnf(c_0_83,plain,
mult(i(mult(mult(X1,X2),X3)),mult(X1,mult(X2,X3))) = asoc(X2,X1,X3),
inference(rw,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_84,negated_conjecture,
asoc(a,b,asoc(c,d,e)) != unit,
goals ).
cnf(c_0_85,plain,
asoc(X1,X2,asoc(X3,X4,X5)) = unit,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_36]),c_0_61]),c_0_14]) ).
cnf(c_0_86,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : GRP727-1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n015.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Oct 3 02:56:31 EDT 2023
% 0.15/0.38 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.g9QnCKdlbH/E---3.1_29962.p
% 131.57/17.88 # Version: 3.1pre001
% 131.57/17.88 # Preprocessing class: FSMSSMSSSSSNFFN.
% 131.57/17.88 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 131.57/17.88 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 131.57/17.88 # Starting new_bool_3 with 300s (1) cores
% 131.57/17.88 # Starting new_bool_1 with 300s (1) cores
% 131.57/17.88 # Starting sh5l with 300s (1) cores
% 131.57/17.88 # new_bool_3 with pid 30041 completed with status 0
% 131.57/17.88 # Result found by new_bool_3
% 131.57/17.88 # Preprocessing class: FSMSSMSSSSSNFFN.
% 131.57/17.88 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 131.57/17.88 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 131.57/17.88 # Starting new_bool_3 with 300s (1) cores
% 131.57/17.88 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 131.57/17.88 # Search class: FUUPM-FFSF32-MFFFFFNN
% 131.57/17.88 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 131.57/17.88 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 163s (1) cores
% 131.57/17.88 # G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with pid 30044 completed with status 0
% 131.57/17.88 # Result found by G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y
% 131.57/17.88 # Preprocessing class: FSMSSMSSSSSNFFN.
% 131.57/17.88 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 131.57/17.88 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 131.57/17.88 # Starting new_bool_3 with 300s (1) cores
% 131.57/17.88 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 131.57/17.88 # Search class: FUUPM-FFSF32-MFFFFFNN
% 131.57/17.88 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 131.57/17.88 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 163s (1) cores
% 131.57/17.88 # Preprocessing time : 0.001 s
% 131.57/17.88
% 131.57/17.88 # Proof found!
% 131.57/17.88 # SZS status Unsatisfiable
% 131.57/17.88 # SZS output start CNFRefutation
% See solution above
% 131.57/17.88 # Parsed axioms : 21
% 131.57/17.88 # Removed by relevancy pruning/SinE : 4
% 131.57/17.88 # Initial clauses : 17
% 131.57/17.88 # Removed in clause preprocessing : 0
% 131.57/17.88 # Initial clauses in saturation : 17
% 131.57/17.88 # Processed clauses : 5851
% 131.57/17.88 # ...of these trivial : 3581
% 131.57/17.88 # ...subsumed : 314
% 131.57/17.88 # ...remaining for further processing : 1956
% 131.57/17.88 # Other redundant clauses eliminated : 0
% 131.57/17.88 # Clauses deleted for lack of memory : 0
% 131.57/17.88 # Backward-subsumed : 0
% 131.57/17.88 # Backward-rewritten : 1009
% 131.57/17.88 # Generated clauses : 1085994
% 131.57/17.88 # ...of the previous two non-redundant : 496232
% 131.57/17.88 # ...aggressively subsumed : 0
% 131.57/17.88 # Contextual simplify-reflections : 0
% 131.57/17.88 # Paramodulations : 1085994
% 131.57/17.88 # Factorizations : 0
% 131.57/17.88 # NegExts : 0
% 131.57/17.88 # Equation resolutions : 0
% 131.57/17.88 # Total rewrite steps : 2088348
% 131.57/17.88 # Propositional unsat checks : 0
% 131.57/17.88 # Propositional check models : 0
% 131.57/17.88 # Propositional check unsatisfiable : 0
% 131.57/17.88 # Propositional clauses : 0
% 131.57/17.88 # Propositional clauses after purity: 0
% 131.57/17.88 # Propositional unsat core size : 0
% 131.57/17.88 # Propositional preprocessing time : 0.000
% 131.57/17.88 # Propositional encoding time : 0.000
% 131.57/17.88 # Propositional solver time : 0.000
% 131.57/17.88 # Success case prop preproc time : 0.000
% 131.57/17.88 # Success case prop encoding time : 0.000
% 131.57/17.88 # Success case prop solver time : 0.000
% 131.57/17.88 # Current number of processed clauses : 947
% 131.57/17.88 # Positive orientable unit clauses : 902
% 131.57/17.88 # Positive unorientable unit clauses: 45
% 131.57/17.88 # Negative unit clauses : 0
% 131.57/17.88 # Non-unit-clauses : 0
% 131.57/17.88 # Current number of unprocessed clauses: 488620
% 131.57/17.88 # ...number of literals in the above : 488620
% 131.57/17.88 # Current number of archived formulas : 0
% 131.57/17.88 # Current number of archived clauses : 1009
% 131.57/17.88 # Clause-clause subsumption calls (NU) : 0
% 131.57/17.88 # Rec. Clause-clause subsumption calls : 0
% 131.57/17.88 # Non-unit clause-clause subsumptions : 0
% 131.57/17.88 # Unit Clause-clause subsumption calls : 306
% 131.57/17.88 # Rewrite failures with RHS unbound : 0
% 131.57/17.88 # BW rewrite match attempts : 171870
% 131.57/17.88 # BW rewrite match successes : 1240
% 131.57/17.88 # Condensation attempts : 5851
% 131.57/17.88 # Condensation successes : 0
% 131.57/17.88 # Termbank termtop insertions : 20444090
% 131.57/17.88
% 131.57/17.88 # -------------------------------------------------
% 131.57/17.88 # User time : 15.820 s
% 131.57/17.88 # System time : 0.522 s
% 131.57/17.88 # Total time : 16.342 s
% 131.57/17.88 # Maximum resident set size: 1624 pages
% 131.57/17.88
% 131.57/17.88 # -------------------------------------------------
% 131.57/17.88 # User time : 15.820 s
% 131.57/17.88 # System time : 0.526 s
% 131.57/17.88 # Total time : 16.346 s
% 131.57/17.88 # Maximum resident set size: 1680 pages
% 131.57/17.88 % E---3.1 exiting
% 131.57/17.88 % E---3.1 exiting
%------------------------------------------------------------------------------