%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP697-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:40:58 PM UTC 2026
% Result : Unsatisfiable 10.09s 2.61s
% Output : CNFRefutation 10.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 10
% Syntax : Number of clauses : 81 ( 81 unt; 0 nHn; 5 RR)
% Number of literals : 81 ( 80 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 155 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c11,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
cnf(c07,axiom,
mult(X1,i(mult(X2,X1))) = i(X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c10,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c08,axiom,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c09,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),mult(b,mult(c,b))) != mult(mult(a,mult(b,mult(b,c))),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_10,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_11,axiom,
mult(X1,i(X1)) = unit,
c11 ).
cnf(c_0_12,axiom,
mult(X1,i(mult(X2,X1))) = i(X2),
c07 ).
cnf(c_0_13,axiom,
mult(i(X1),X1) = unit,
c10 ).
cnf(c_0_14,plain,
ld(X1,unit) = i(X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_16,plain,
ld(X1,i(X2)) = i(mult(X2,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_17,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13]),c_0_14]) ).
cnf(c_0_18,plain,
i(rd(X1,X2)) = mult(X2,i(X1)),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_19,plain,
ld(X1,X2) = i(mult(i(X2),X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
c08 ).
cnf(c_0_21,plain,
rd(X1,X2) = i(mult(X2,i(X1))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
i(mult(i(mult(X1,X2)),X1)) = X2,
inference(rw,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_23,plain,
mult(i(mult(X1,i(mult(X1,X2)))),mult(X1,X3)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_25,plain,
mult(i(mult(X1,X2)),X1) = i(X2),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_26,plain,
i(mult(X1,i(mult(X1,X2)))) = mult(X1,mult(X2,i(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_11]),c_0_24]) ).
cnf(c_0_27,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
c09 ).
cnf(c_0_28,plain,
mult(mult(X1,mult(X2,i(X1))),X1) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17]) ).
cnf(c_0_29,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_30,plain,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),i(mult(i(mult(X2,X3)),X3))),
inference(rw,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_31,plain,
mult(X1,i(mult(i(X1),X2))) = mult(mult(X1,i(X2)),X1),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_32,plain,
i(unit) = unit,
inference(spm,[status(thm)],[c_0_29,c_0_11]) ).
cnf(c_0_33,plain,
i(mult(i(mult(X1,X2)),X2)) = mult(mult(i(X2),X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_13]),c_0_29]) ).
cnf(c_0_34,plain,
mult(i(mult(mult(X1,i(X2)),X1)),X1) = mult(i(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_31]),c_0_17]) ).
cnf(c_0_35,plain,
mult(i(X1),mult(X1,X2)) = mult(X1,mult(i(X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_13]),c_0_32]),c_0_24]),c_0_17]) ).
cnf(c_0_36,plain,
mult(mult(X1,mult(i(X1),X2)),X1) = mult(X1,mult(i(X1),mult(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_28]),c_0_17]) ).
cnf(c_0_37,plain,
i(mult(i(X1),X2)) = mult(X1,mult(i(X1),mult(i(X2),X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]) ).
cnf(c_0_38,plain,
i(mult(X1,X2)) = mult(X1,mult(i(X1),mult(i(X2),i(X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_17]),c_0_35]) ).
cnf(c_0_39,plain,
mult(mult(X1,i(X2)),X2) = mult(mult(X1,X2),i(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_13]),c_0_32]),c_0_29]) ).
cnf(c_0_40,plain,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(mult(i(X3),X2),X3)),
inference(rw,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_41,plain,
mult(X1,mult(mult(i(X1),X2),X1)) = mult(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_33]),c_0_17]) ).
cnf(c_0_42,plain,
mult(X1,mult(i(X1),mult(mult(i(X2),X1),i(X1)))) = i(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_38]),c_0_36]),c_0_39]) ).
cnf(c_0_43,plain,
mult(mult(i(X1),X2),mult(mult(i(X2),X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_13]),c_0_29]) ).
cnf(c_0_44,plain,
mult(i(X1),mult(mult(X1,X2),i(X1))) = mult(X2,i(X1)),
inference(spm,[status(thm)],[c_0_41,c_0_17]) ).
cnf(c_0_45,plain,
mult(i(mult(X1,i(X2))),X2) = mult(X2,mult(i(X1),X2)),
inference(spm,[status(thm)],[c_0_41,c_0_12]) ).
cnf(c_0_46,plain,
mult(X1,mult(i(X1),mult(mult(X2,X1),i(X1)))) = X2,
inference(spm,[status(thm)],[c_0_42,c_0_17]) ).
cnf(c_0_47,plain,
mult(mult(X1,i(X2)),mult(mult(X2,X1),i(X1))) = X1,
inference(rw,[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_43,c_0_44]),c_0_45]),c_0_38]),c_0_36]),c_0_39]),c_0_46]),c_0_39]) ).
cnf(c_0_48,plain,
mult(X1,mult(X1,mult(i(X1),mult(X2,X1)))) = mult(mult(X1,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_35]),c_0_36]) ).
cnf(c_0_49,plain,
mult(mult(i(X1),i(X2)),mult(mult(X2,X1),i(X1))) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_17]),c_0_39]) ).
cnf(c_0_50,plain,
mult(mult(X1,mult(i(X1),X2)),i(X1)) = mult(X1,mult(i(X1),mult(X2,i(X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_35]),c_0_17]),c_0_35]),c_0_44]),c_0_35]) ).
cnf(c_0_51,plain,
mult(mult(X1,mult(X1,mult(i(X1),i(X2)))),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_49,c_0_50]),c_0_17]),c_0_38]),c_0_25]),c_0_17]),c_0_36]),c_0_39]),c_0_46]),c_0_17]) ).
cnf(c_0_52,plain,
mult(mult(X1,mult(i(X1),mult(X2,i(X1)))),X2) = mult(X2,mult(i(X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_38]),c_0_17]) ).
cnf(c_0_53,plain,
mult(X1,mult(X2,mult(i(X2),mult(i(X1),i(X2))))) = i(X2),
inference(rw,[status(thm)],[c_0_12,c_0_38]) ).
cnf(c_0_54,plain,
mult(mult(mult(X1,X2),X1),i(X1)) = mult(X1,mult(mult(X2,X1),i(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_41]),c_0_39]),c_0_17]),c_0_39]) ).
cnf(c_0_55,plain,
mult(mult(X1,mult(X1,mult(i(X1),X2))),i(X2)) = X1,
inference(spm,[status(thm)],[c_0_51,c_0_17]) ).
cnf(c_0_56,plain,
mult(mult(X1,mult(X1,mult(i(X1),X2))),i(X1)) = mult(X1,mult(X2,i(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_35]),c_0_44]) ).
cnf(c_0_57,plain,
mult(X1,mult(mult(i(X2),X1),i(X1))) = mult(X2,mult(i(X2),mult(X1,i(X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_52]),c_0_44]) ).
cnf(c_0_58,plain,
mult(i(X1),mult(X2,mult(i(X2),mult(X1,i(X2))))) = i(X2),
inference(spm,[status(thm)],[c_0_53,c_0_17]) ).
cnf(c_0_59,plain,
mult(mult(X1,mult(X2,i(X1))),mult(X1,X3)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_60,plain,
mult(mult(mult(i(X1),X2),X1),i(X1)) = mult(i(X1),mult(mult(X2,X1),i(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_17]),c_0_39]),c_0_39]) ).
cnf(c_0_61,plain,
mult(mult(X1,mult(X1,i(X2))),mult(X2,i(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_55,c_0_53]),c_0_17]),c_0_38]),c_0_38]),c_0_17]),c_0_38]),c_0_17]),c_0_17]),c_0_52]),c_0_35]),c_0_35]),c_0_56]),c_0_57]),c_0_58]) ).
cnf(c_0_62,plain,
mult(X1,mult(X2,mult(i(X2),mult(i(X1),X2)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_17]),c_0_35]) ).
cnf(c_0_63,plain,
mult(X1,mult(mult(mult(i(X1),X2),X1),X3)) = mult(X2,mult(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_46]) ).
cnf(c_0_64,plain,
mult(mult(X1,X2),mult(i(X2),mult(X1,X2))) = mult(X1,mult(X1,X2)),
inference(rw,[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_52,c_0_39]),c_0_17]),c_0_39]),c_0_46]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_65,plain,
mult(mult(X1,mult(X1,X2)),mult(i(X2),i(X1))) = X1,
inference(spm,[status(thm)],[c_0_61,c_0_17]) ).
cnf(c_0_66,plain,
mult(mult(X1,mult(i(X1),mult(X2,X1))),X2) = mult(X2,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_62]),c_0_17]) ).
cnf(c_0_67,plain,
mult(X1,mult(mult(mult(i(X1),X2),X3),X1)) = mult(X2,mult(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_40]),c_0_41]) ).
cnf(c_0_68,plain,
mult(mult(X1,mult(X1,X2)),X1) = mult(X1,mult(X1,mult(X2,X1))),
inference(rw,[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_64,c_0_65]),c_0_38]),c_0_17]),c_0_17]),c_0_17]),c_0_35]),c_0_66]) ).
cnf(c_0_69,plain,
mult(mult(i(X1),mult(X2,i(X1))),X1) = mult(i(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_41]),c_0_13]),c_0_24]) ).
cnf(c_0_70,plain,
mult(mult(X1,X2),mult(mult(i(X2),X1),i(X1))) = X1,
inference(spm,[status(thm)],[c_0_47,c_0_17]) ).
cnf(c_0_71,plain,
mult(i(X1),mult(mult(X1,X2),X1)) = mult(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_54]),c_0_35]),c_0_46]) ).
cnf(c_0_72,plain,
mult(i(X1),mult(mult(mult(X1,X2),X2),i(X2))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_70,c_0_53]),c_0_38]),c_0_38]),c_0_17]),c_0_38]),c_0_17]),c_0_17]),c_0_17]),c_0_35]),c_0_17]),c_0_66]),c_0_35]),c_0_35]),c_0_56]),c_0_35]),c_0_46]) ).
cnf(c_0_73,plain,
mult(mult(X1,mult(X2,i(X3))),X3) = mult(mult(X1,X3),mult(i(X3),X2)),
inference(spm,[status(thm)],[c_0_40,c_0_69]) ).
cnf(c_0_74,plain,
mult(mult(mult(mult(X1,X2),X2),i(X2)),i(X1)) = mult(X1,mult(X2,i(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_17]) ).
cnf(c_0_75,negated_conjecture,
mult(mult(a,b),mult(b,mult(c,b))) != mult(mult(a,mult(b,mult(b,c))),b),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_76,plain,
mult(mult(X1,mult(X2,mult(X3,i(X2)))),X2) = mult(mult(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_72]) ).
cnf(c_0_77,plain,
mult(mult(X1,mult(X2,X1)),i(X1)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_69,c_0_17]) ).
cnf(c_0_78,negated_conjecture,
mult(mult(a,b),mult(b,mult(c,b))) != mult(mult(a,mult(b,mult(b,c))),b),
c_0_75 ).
cnf(c_0_79,plain,
mult(mult(X1,mult(X2,mult(X2,X3))),X2) = mult(mult(X1,X2),mult(X2,mult(X3,X2))),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP697-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n005.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sun Sep 20 20:33:32 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.53 Running first-order theorem proving
% 0.17/0.53 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/benchmark/theBenchmark.p
% 10.09/2.61 % Version: 3.5.1
% 10.09/2.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 10.09/2.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.09/2.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.09/2.61 % Starting new_bool_3 with 300s (1) cores
% 10.09/2.61 % Starting new_bool_1 with 300s (1) cores
% 10.09/2.61 % Starting sh5l with 300s (1) cores
% 10.09/2.61 % new_bool_1 with pid 1724173 completed with status 9
% 10.09/2.61 % new_bool_3 with pid 1724172 completed with status 9
% 10.09/2.61 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1724171 completed with status 0
% 10.09/2.61 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 10.09/2.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 10.09/2.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.09/2.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.09/2.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.09/2.61 % No SInE strategy applied
% 10.09/2.61 % Search class: FUUPM-FFSF21-MFFFFFNN
% 10.09/2.61 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 10.09/2.61 % Starting SubtermCWHack with 136s (1) cores
% 10.09/2.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 10.09/2.61 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 10.09/2.61 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 10.09/2.61 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 10.09/2.61 % H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 1724178 completed with status 0
% 10.09/2.61 % Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 10.09/2.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 10.09/2.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.09/2.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.09/2.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.09/2.61 % No SInE strategy applied
% 10.09/2.61 % Search class: FUUPM-FFSF21-MFFFFFNN
% 10.09/2.61 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 10.09/2.61 % Starting SubtermCWHack with 136s (1) cores
% 10.09/2.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 10.09/2.61 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 10.09/2.61 % Preprocessing time : 0.002 s
% 10.09/2.61
% 10.09/2.61 % Proof found!
% 10.09/2.61 % SZS status Unsatisfiable
% 10.09/2.61 % SZS output start CNFRefutation
% See solution above
% 10.09/2.61 % Parsed axioms : 12
% 10.09/2.61 % Removed by relevancy pruning/SinE : 0
% 10.09/2.61 % Initial clauses : 12
% 10.09/2.61 % Removed in clause preprocessing : 0
% 10.09/2.61 % Initial clauses in saturation : 12
% 10.09/2.61 % Processed clauses : 725
% 10.09/2.61 % ...of these trivial : 330
% 10.09/2.61 % ...subsumed : 25
% 10.09/2.61 % ...remaining for further processing : 370
% 10.09/2.61 % Other redundant clauses eliminated : 0
% 10.09/2.61 % Clauses deleted for lack of memory : 0
% 10.09/2.61 % Backward-subsumed : 0
% 10.09/2.61 % Backward-rewritten : 119
% 10.09/2.61 % Generated clauses : 82590
% 10.09/2.61 % ...of the previous two non-redundant : 66424
% 10.09/2.61 % ...aggressively subsumed : 0
% 10.09/2.61 % Contextual simplify-reflections : 0
% 10.09/2.61 % Paramodulations : 82590
% 10.09/2.61 % Factorizations : 0
% 10.09/2.61 % NegExts : 0
% 10.09/2.61 % Equation resolutions : 0
% 10.09/2.61 % Disequality decompositions : 0
% 10.09/2.61 % Total rewrite steps : 808858
% 10.09/2.61 % ...of those cached : 795542
% 10.09/2.61 % Propositional unsat checks : 0
% 10.09/2.61 % Propositional check models : 0
% 10.09/2.61 % Propositional check unsatisfiable : 0
% 10.09/2.61 % Propositional clauses : 0
% 10.09/2.61 % Propositional clauses after purity: 0
% 10.09/2.61 % Propositional unsat core size : 0
% 10.09/2.61 % Propositional preprocessing time : 0.000
% 10.09/2.61 % Propositional encoding time : 0.000
% 10.09/2.61 % Propositional solver time : 0.000
% 10.09/2.61 % Success case prop preproc time : 0.000
% 10.09/2.61 % Success case prop encoding time : 0.000
% 10.09/2.61 % Success case prop solver time : 0.000
% 10.09/2.61 % Current number of processed clauses : 251
% 10.09/2.61 % Positive orientable unit clauses : 245
% 10.09/2.61 % Positive unorientable unit clauses: 6
% 10.09/2.61 % Negative unit clauses : 0
% 10.09/2.61 % Non-unit-clauses : 0
% 10.09/2.61 % Current number of unprocessed clauses: 64926
% 10.09/2.61 % ...number of literals in the above : 64926
% 10.09/2.61 % Current number of archived formulas : 0
% 10.09/2.61 % Current number of archived clauses : 119
% 10.09/2.61 % Clause-clause subsumption calls (NU) : 0
% 10.09/2.61 % Rec. Clause-clause subsumption calls : 0
% 10.09/2.61 % Non-unit clause-clause subsumptions : 0
% 10.09/2.61 % Unit Clause-clause subsumption calls : 303
% 10.09/2.61 % Rewrite failures with RHS unbound : 0
% 10.09/2.61 % BW rewrite match attempts : 7291
% 10.09/2.61 % BW rewrite match successes : 479
% 10.09/2.61 % Condensation attempts : 0
% 10.09/2.61 % Condensation successes : 0
% 10.09/2.61 % Termbank termtop insertions : 2636945
% 10.09/2.61 % Search garbage collected termcells : 2
% 10.09/2.61
% 10.09/2.61 % -------------------------------------------------
% 10.09/2.61 % User time : 1.906 s
% 10.09/2.61 % System time : 0.077 s
% 10.09/2.61 % Total time : 1.983 s
% 10.09/2.61 % Maximum resident set size: 3380 pages
% 10.09/2.61
% 10.09/2.61 % -------------------------------------------------
% 10.09/2.61 % User time : 9.416 s
% 10.09/2.61 % System time : 0.428 s
% 10.09/2.61 % Total time : 9.844 s
% 10.09/2.61 % Maximum resident set size: 4864 pages
% 10.09/2.61 % E exiting
%------------------------------------------------------------------------------