%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP655+2 : 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 : n012.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:37 PM UTC 2026
% Result : Theorem 154.58s 33.39s
% Output : CNFRefutation 154.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 6
% Syntax : Number of formulae : 73 ( 69 unt; 0 def)
% Number of atoms : 77 ( 76 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 2 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 158 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f05,axiom,
! [X3,X1,X2] : mult(X2,mult(X1,mult(X3,X1))) = mult(mult(mult(X2,X1),X3),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(goals,conjecture,
! [X4,X5] :
( mult(rd(X5,X5),X4) = X4
& mult(X4,rd(X5,X5)) = X4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_6,plain,
! [X14,X15,X16] : mult(X16,mult(X15,mult(X14,X15))) = mult(mult(mult(X16,X15),X14),X15),
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_7,plain,
! [X10,X11] : mult(rd(X11,X10),X10) = X11,
inference(variable_rename,[status(thm)],[f03]) ).
fof(c_0_8,plain,
! [X8,X9] : ld(X9,mult(X9,X8)) = X8,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_9,plain,
mult(X1,mult(X2,mult(X3,X2))) = mult(mult(mult(X1,X2),X3),X2),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
mult(rd(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,X3),X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,plain,
! [X6,X7] : mult(X7,ld(X7,X6)) = X6,
inference(variable_rename,[status(thm)],[f01]) ).
cnf(c_0_14,plain,
ld(rd(X1,X2),mult(mult(X1,X3),X2)) = mult(X2,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X12,X13] : rd(mult(X13,X12),X12) = X13,
inference(variable_rename,[status(thm)],[f04]) ).
cnf(c_0_17,plain,
ld(rd(X1,X2),mult(X3,X2)) = mult(X2,mult(ld(X1,X3),X2)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
mult(X1,mult(ld(X2,rd(X2,X1)),X1)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_20,plain,
rd(mult(X1,mult(X2,mult(X3,X2))),X2) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_21,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_22,plain,
mult(ld(X1,rd(X1,X2)),X2) = ld(X2,X2),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_23,plain,
rd(mult(X1,mult(X2,X3)),X2) = mult(mult(X1,X2),rd(X3,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_24,plain,
mult(X1,mult(ld(mult(X2,X1),X2),X1)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_25,plain,
mult(mult(X1,ld(X2,rd(X2,X3))),X3) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_22]),c_0_15]),c_0_10]) ).
cnf(c_0_26,plain,
mult(mult(X1,X2),rd(ld(X2,X3),X2)) = rd(mult(X1,X3),X2),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_27,plain,
mult(ld(mult(X1,X2),X1),X2) = ld(X2,X2),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_28,plain,
mult(X1,ld(X2,rd(X2,X3))) = rd(X1,X3),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_29,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_30,plain,
mult(X1,rd(ld(X2,X3),X2)) = rd(mult(rd(X1,X2),X3),X2),
inference(spm,[status(thm)],[c_0_26,c_0_10]) ).
cnf(c_0_31,plain,
ld(ld(mult(X1,X2),X1),ld(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_27]) ).
cnf(c_0_32,plain,
rd(X1,ld(X2,X3)) = mult(X1,ld(X3,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
mult(X1,mult(X2,mult(ld(X2,X2),X2))) = mult(X1,mult(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(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_11]),c_0_32]),c_0_11]),c_0_32]),c_0_11]),c_0_9]) ).
cnf(c_0_34,plain,
mult(X1,mult(ld(X1,X1),X1)) = mult(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_33]),c_0_11]) ).
cnf(c_0_35,plain,
mult(ld(X1,X1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_34]),c_0_11]) ).
cnf(c_0_36,plain,
ld(X1,X1) = rd(X1,X1),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_37,plain,
mult(mult(X1,rd(X2,X3)),X3) = mult(rd(X1,X3),mult(X3,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_38,plain,
mult(X1,rd(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_39,plain,
rd(X1,rd(X2,X2)) = mult(X1,rd(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_36]),c_0_36]) ).
cnf(c_0_40,plain,
mult(mult(rd(X1,mult(X2,X3)),X2),rd(X3,X2)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_10]) ).
cnf(c_0_41,plain,
mult(rd(X1,X1),mult(X1,X1)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
mult(rd(X1,X2),mult(X2,X2)) = mult(mult(X1,X2),rd(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_38]),c_0_10]),c_0_39]),c_0_37]) ).
cnf(c_0_43,plain,
mult(X1,mult(ld(X2,rd(X3,X1)),X1)) = ld(rd(X2,X1),X3),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_44,plain,
rd(rd(X1,X2),rd(X3,X2)) = mult(rd(X1,mult(X2,X3)),X2),
inference(spm,[status(thm)],[c_0_18,c_0_40]) ).
cnf(c_0_45,plain,
mult(mult(X1,ld(X2,X3)),ld(X3,X2)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_46,plain,
ld(X1,rd(mult(rd(X1,X2),X3),X2)) = rd(ld(X2,X3),X2),
inference(spm,[status(thm)],[c_0_11,c_0_30]) ).
cnf(c_0_47,plain,
mult(mult(X1,X1),rd(X1,X1)) = mult(X1,X1),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
mult(X1,mult(mult(rd(X2,mult(X1,X2)),X1),X1)) = ld(rd(rd(X2,X1),X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_36]),c_0_44]) ).
cnf(c_0_49,plain,
mult(mult(X1,rd(X2,X2)),rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_36]),c_0_36]) ).
cnf(c_0_50,plain,
ld(mult(X1,X2),rd(mult(X1,X3),X2)) = rd(ld(X2,X3),X2),
inference(spm,[status(thm)],[c_0_46,c_0_18]) ).
cnf(c_0_51,plain,
mult(ld(rd(X1,X1),X2),rd(X1,X1)) = mult(rd(X1,X1),mult(X2,rd(X1,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_39]),c_0_39]),c_0_9]),c_0_11]),c_0_39]) ).
cnf(c_0_52,plain,
mult(rd(X1,mult(X2,mult(X3,X2))),X2) = rd(rd(X1,X2),X3),
inference(spm,[status(thm)],[c_0_44,c_0_18]) ).
cnf(c_0_53,plain,
mult(mult(X1,mult(X2,rd(X3,X3))),rd(X3,X3)) = mult(mult(X1,rd(X3,X3)),mult(rd(X3,X3),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_39]),c_0_39]) ).
cnf(c_0_54,plain,
mult(mult(rd(X1,X2),rd(X1,X2)),mult(rd(X1,mult(X2,X1)),X2)) = mult(rd(X1,X2),rd(X1,X2)),
inference(spm,[status(thm)],[c_0_47,c_0_44]) ).
cnf(c_0_55,plain,
mult(rd(X1,X1),rd(X2,mult(rd(X1,X1),X2))) = rd(X2,X2),
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_49]),c_0_39]),c_0_39]),c_0_49]),c_0_36]) ).
cnf(c_0_56,plain,
ld(X1,mult(mult(X1,X2),rd(X1,X1))) = mult(rd(X1,X1),mult(X2,rd(X1,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_38]),c_0_39]),c_0_39]),c_0_51]) ).
cnf(c_0_57,plain,
rd(X1,mult(rd(X2,X2),mult(X3,rd(X2,X2)))) = mult(rd(mult(X1,rd(X2,X2)),X3),rd(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_52]),c_0_39]) ).
cnf(c_0_58,plain,
rd(mult(X1,X1),mult(X1,X1)) = rd(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_47]),c_0_36]) ).
cnf(c_0_59,plain,
mult(X1,ld(mult(X2,X3),X2)) = rd(X1,X3),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_60,plain,
mult(rd(X1,X2),rd(X2,X2)) = mult(rd(X1,mult(X2,X2)),X2),
inference(spm,[status(thm)],[c_0_44,c_0_39]) ).
cnf(c_0_61,plain,
mult(rd(mult(X1,X2),mult(X2,X3)),X2) = rd(X1,rd(X3,X2)),
inference(spm,[status(thm)],[c_0_44,c_0_18]) ).
cnf(c_0_62,plain,
mult(mult(X1,mult(rd(X2,X2),X1)),rd(X1,X1)) = mult(X1,mult(rd(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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_39]),c_0_39]),c_0_53]),c_0_49]),c_0_39]),c_0_39]),c_0_53]),c_0_49]),c_0_55]) ).
cnf(c_0_63,plain,
mult(rd(mult(X1,rd(X2,X2)),X3),rd(X2,X2)) = mult(X1,ld(mult(mult(X2,X3),rd(X2,X2)),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_56]),c_0_57]) ).
cnf(c_0_64,plain,
mult(rd(X1,mult(X1,X1)),X1) = rd(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(spm,[status(thm)],[c_0_58,c_0_59]),c_0_44]),c_0_59]),c_0_39]),c_0_37]),c_0_42]),c_0_27]),c_0_36]),c_0_60]),c_0_32]),c_0_11]),c_0_27]),c_0_36]) ).
fof(c_0_65,negated_conjecture,
~ ! [X4,X5] :
( mult(rd(X5,X5),X4) = X4
& mult(X4,rd(X5,X5)) = X4 ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_66,plain,
mult(rd(X1,mult(rd(X1,X1),X2)),rd(X1,X1)) = rd(X1,mult(X2,rd(X1,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_38]),c_0_39]) ).
cnf(c_0_67,plain,
mult(rd(X1,X1),rd(X2,X2)) = rd(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(spm,[status(thm)],[c_0_62,c_0_63]),c_0_53]),c_0_38]),c_0_59]),c_0_55]),c_0_39]),c_0_60]),c_0_64]),c_0_53]),c_0_38]),c_0_59]),c_0_55]) ).
fof(c_0_68,negated_conjecture,
( mult(rd(esk2_0,esk2_0),esk1_0) != esk1_0
| mult(esk1_0,rd(esk2_0,esk2_0)) != esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_65])])])]) ).
cnf(c_0_69,plain,
mult(X1,rd(X2,X2)) = 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_66,c_0_67]),c_0_39]),c_0_38]),c_0_38]),c_0_67]),c_0_39]) ).
cnf(c_0_70,negated_conjecture,
( mult(rd(esk2_0,esk2_0),esk1_0) != esk1_0
| mult(esk1_0,rd(esk2_0,esk2_0)) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_71,plain,
mult(rd(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_69]),c_0_11]),c_0_69]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_69])]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP655+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.05/10.33 % Computer : n012.cluster.edu
% 0.05/10.33 % Model : x86_64 x86_64
% 0.05/10.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/10.33 % Memory : 8046.5625MB
% 0.05/10.33 % OS : Linux 6.8.0-71-generic
% 0.05/10.33 % CPULimit : 300
% 0.05/10.33 % WCLimit : 300
% 0.05/10.33 % DateTime : Sun Sep 20 20:29:07 UTC 2026
% 0.05/10.33 % CPUTime :
% 0.05/10.33 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.05/10.37 Running first-order theorem proving
% 0.05/10.37 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
% 154.58/33.39 % Version: 3.5.1
% 154.58/33.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 154.58/33.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 154.58/33.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 154.58/33.39 % Starting new_bool_3 with 300s (1) cores
% 154.58/33.39 % Starting new_bool_1 with 300s (1) cores
% 154.58/33.39 % Starting sh5l with 300s (1) cores
% 154.58/33.39 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 812230 completed with status 0
% 154.58/33.39 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 154.58/33.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 154.58/33.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 154.58/33.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 154.58/33.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 154.58/33.39 % No SInE strategy applied
% 154.58/33.39 % Search class: FUHPM-FFSF22-MFFFFFNN
% 154.58/33.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 154.58/33.39 % Starting SubtermCWHack with 136s (1) cores
% 154.58/33.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 154.58/33.39 % Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 136s (1) cores
% 154.58/33.39 % Starting new_bool_3 with 136s (1) cores
% 154.58/33.39 % Starting new_bool_1 with 136s (1) cores
% 154.58/33.39 % H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with pid 812239 completed with status 0
% 154.58/33.39 % Result found by H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S
% 154.58/33.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 154.58/33.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 154.58/33.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 154.58/33.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 154.58/33.39 % No SInE strategy applied
% 154.58/33.39 % Search class: FUHPM-FFSF22-MFFFFFNN
% 154.58/33.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 154.58/33.39 % Starting SubtermCWHack with 136s (1) cores
% 154.58/33.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 154.58/33.39 % Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 136s (1) cores
% 154.58/33.39 % Preprocessing time : 0.001 s
% 154.58/33.39 % Presaturation interreduction done
% 154.58/33.39
% 154.58/33.39 % Proof found!
% 154.58/33.39 % SZS status Theorem
% 154.58/33.39 % SZS output start CNFRefutation
% See solution above
% 154.58/33.39 % Parsed axioms : 6
% 154.58/33.39 % Removed by relevancy pruning/SinE : 0
% 154.58/33.39 % Initial clauses : 6
% 154.58/33.39 % Removed in clause preprocessing : 0
% 154.58/33.39 % Initial clauses in saturation : 6
% 154.58/33.39 % Processed clauses : 7651
% 154.58/33.39 % ...of these trivial : 3484
% 154.58/33.39 % ...subsumed : 3003
% 154.58/33.39 % ...remaining for further processing : 1163
% 154.58/33.39 % Other redundant clauses eliminated : 0
% 154.58/33.39 % Clauses deleted for lack of memory : 0
% 154.58/33.39 % Backward-subsumed : 4
% 154.58/33.39 % Backward-rewritten : 360
% 154.58/33.39 % Generated clauses : 796973
% 154.58/33.39 % ...of the previous two non-redundant : 700789
% 154.58/33.39 % ...aggressively subsumed : 0
% 154.58/33.39 % Contextual simplify-reflections : 0
% 154.58/33.39 % Paramodulations : 796973
% 154.58/33.39 % Factorizations : 0
% 154.58/33.39 % NegExts : 0
% 154.58/33.39 % Equation resolutions : 0
% 154.58/33.39 % Disequality decompositions : 0
% 154.58/33.39 % Total rewrite steps : 1944195
% 154.58/33.39 % ...of those cached : 1743729
% 154.58/33.39 % Propositional unsat checks : 0
% 154.58/33.39 % Propositional check models : 0
% 154.58/33.39 % Propositional check unsatisfiable : 0
% 154.58/33.39 % Propositional clauses : 0
% 154.58/33.39 % Propositional clauses after purity: 0
% 154.58/33.39 % Propositional unsat core size : 0
% 154.58/33.39 % Propositional preprocessing time : 0.000
% 154.58/33.39 % Propositional encoding time : 0.000
% 154.58/33.39 % Propositional solver time : 0.000
% 154.58/33.39 % Success case prop preproc time : 0.000
% 154.58/33.39 % Success case prop encoding time : 0.000
% 154.58/33.39 % Success case prop solver time : 0.000
% 154.58/33.39 % Current number of processed clauses : 793
% 154.58/33.39 % Positive orientable unit clauses : 749
% 154.58/33.39 % Positive unorientable unit clauses: 44
% 154.58/33.39 % Negative unit clauses : 0
% 154.58/33.39 % Non-unit-clauses : 0
% 154.58/33.39 % Current number of unprocessed clauses: 691166
% 154.58/33.39 % ...number of literals in the above : 691166
% 154.58/33.39 % Current number of archived formulas : 0
% 154.58/33.39 % Current number of archived clauses : 370
% 154.58/33.39 % Clause-clause subsumption calls (NU) : 0
% 154.58/33.39 % Rec. Clause-clause subsumption calls : 0
% 154.58/33.39 % Non-unit clause-clause subsumptions : 0
% 154.58/33.39 % Unit Clause-clause subsumption calls : 1669
% 154.58/33.39 % Rewrite failures with RHS unbound : 5197
% 154.58/33.39 % BW rewrite match attempts : 11750
% 154.58/33.39 % BW rewrite match successes : 686
% 154.58/33.39 % Condensation attempts : 0
% 154.58/33.39 % Condensation successes : 0
% 154.58/33.39 % Termbank termtop insertions : 19698553
% 154.58/33.39 % Search garbage collected termcells : 25
% 154.58/33.39
% 154.58/33.39 % -------------------------------------------------
% 154.58/33.39 % User time : 21.445 s
% 154.58/33.39 % System time : 0.749 s
% 154.58/33.39 % Total time : 22.194 s
% 154.58/33.39 % Maximum resident set size: 3632 pages
% 154.58/33.39
% 154.58/33.39 % -------------------------------------------------
% 154.58/33.39 % User time : 107.731 s
% 154.58/33.39 % System time : 3.543 s
% 154.58/33.39 % Total time : 111.273 s
% 154.58/33.39 % Maximum resident set size: 4864 pages
% 154.58/33.39 % E exiting
%------------------------------------------------------------------------------