%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP126-3.004 : TPTP v9.3.1. Released v1.2.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:38:03 PM UTC 2026
% Result : Unsatisfiable 0.13s 5.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 16
% Syntax : Number of clauses : 95 ( 42 unt; 24 nHn; 93 RR)
% Number of literals : 192 ( 0 equ; 93 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 82 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_4) ).
cnf(product_left_cancellation,axiom,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(product_total_function1,axiom,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_4)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_total_function1) ).
cnf(product_right_cancellation,axiom,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_4) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_4) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_idempotence) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_3) ).
cnf(product_total_function2,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_total_function2) ).
cnf(qg4,negated_conjecture,
( ~ product(X2,X1,X4)
| ~ product(X1,X2,X3)
| product(X3,X4,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg4) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_3) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_is_not_e_1) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).
cnf(e_2_is_not_e_4,axiom,
~ equalish(e_2,e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_is_not_e_4) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_is_not_e_3) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_2) ).
cnf(c_0_16,plain,
~ equalish(e_3,e_4),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_4]) ).
cnf(c_0_17,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_18,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_4)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_19,plain,
~ equalish(e_3,e_4),
c_0_16 ).
cnf(c_0_20,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
c_0_17 ).
cnf(c_0_21,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_22,plain,
~ equalish(e_1,e_4),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_4]) ).
cnf(c_0_23,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_4)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
c_0_18 ).
cnf(c_0_24,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_25,plain,
( ~ product(e_3,X1,X2)
| ~ product(e_4,X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_27,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
c_0_21 ).
cnf(c_0_28,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_29,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
inference(fof_simplification,[status(thm)],[product_total_function2]) ).
cnf(c_0_30,plain,
~ equalish(e_1,e_4),
c_0_22 ).
cnf(c_0_31,negated_conjecture,
( ~ product(X2,X1,X4)
| ~ product(X1,X2,X3)
| product(X3,X4,X2) ),
inference(fof_simplification,[status(thm)],[qg4]) ).
cnf(c_0_32,plain,
( ~ group_element(X1)
| product(X1,e_4,e_1)
| product(X1,e_4,e_2)
| product(X1,e_4,e_3)
| product(X1,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_34,plain,
~ product(e_3,e_4,e_4),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,plain,
( ~ product(X1,e_3,X2)
| ~ product(X1,e_4,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_36,plain,
~ equalish(e_1,e_3),
c_0_28 ).
cnf(c_0_37,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
c_0_29 ).
cnf(c_0_38,plain,
( ~ product(X1,e_1,X2)
| ~ product(X1,e_4,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_39,negated_conjecture,
( ~ product(X2,X1,X4)
| ~ product(X1,X2,X3)
| product(X3,X4,X2) ),
c_0_31 ).
cnf(c_0_40,plain,
( product(e_3,e_4,e_3)
| product(e_3,e_4,e_2)
| product(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_41,plain,
( ~ group_element(X1)
| product(X1,e_3,e_1)
| product(X1,e_3,e_2)
| product(X1,e_3,e_3)
| product(X1,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_23,c_0_33]) ).
cnf(c_0_42,plain,
~ product(e_4,e_3,e_4),
inference(spm,[status(thm)],[c_0_35,c_0_26]) ).
cnf(c_0_43,plain,
( ~ product(X1,X2,e_1)
| ~ product(X1,X2,e_3) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
~ equalish(e_2,e_1),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_1]) ).
cnf(c_0_45,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_46,plain,
~ product(e_1,e_4,e_1),
inference(spm,[status(thm)],[c_0_38,c_0_26]) ).
cnf(c_0_47,negated_conjecture,
( ~ product(e_4,e_3,X1)
| product(X1,e_1,e_3)
| product(e_3,e_4,e_2)
| product(e_3,e_4,e_3) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,plain,
( product(e_4,e_3,e_3)
| product(e_4,e_3,e_2)
| product(e_4,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_24]),c_0_42]) ).
cnf(c_0_49,plain,
~ product(e_1,e_1,e_3),
inference(spm,[status(thm)],[c_0_43,c_0_26]) ).
cnf(c_0_50,plain,
~ equalish(e_2,e_4),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_4]) ).
cnf(c_0_51,plain,
~ equalish(e_2,e_1),
c_0_44 ).
cnf(c_0_52,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_4,X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_53,plain,
( product(e_1,e_4,e_4)
| product(e_1,e_4,e_3)
| product(e_1,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_45]),c_0_46]) ).
cnf(c_0_54,negated_conjecture,
( product(e_3,e_4,e_3)
| product(e_3,e_4,e_2)
| product(e_4,e_3,e_2)
| product(e_4,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_55,plain,
~ equalish(e_2,e_4),
c_0_50 ).
cnf(c_0_56,plain,
( ~ product(e_2,X1,X2)
| ~ product(e_1,X1,X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_20]) ).
cnf(c_0_57,plain,
( product(e_1,e_4,e_2)
| product(e_1,e_4,e_3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_26])]) ).
cnf(c_0_58,negated_conjecture,
( product(e_4,e_3,e_2)
| product(e_3,e_4,e_2)
| product(e_3,e_4,e_3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_54]),c_0_26])]) ).
cnf(c_0_59,plain,
( ~ product(e_2,X1,X2)
| ~ product(e_4,X1,X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_20]) ).
cnf(c_0_60,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_3,X1,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_20]) ).
cnf(c_0_61,plain,
( ~ product(e_2,e_4,e_3)
| product(e_1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
( product(e_3,e_4,e_3)
| product(e_3,e_4,e_2)
| product(e_2,e_1,e_3) ),
inference(spm,[status(thm)],[c_0_47,c_0_58]) ).
cnf(c_0_63,plain,
~ equalish(e_2,e_3),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_3]) ).
cnf(c_0_64,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_65,plain,
~ product(e_2,e_4,e_4),
inference(spm,[status(thm)],[c_0_59,c_0_26]) ).
cnf(c_0_66,plain,
( ~ product(e_2,e_4,e_3)
| ~ product(e_3,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_67,negated_conjecture,
( product(e_2,e_1,e_3)
| product(e_3,e_4,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_62]),c_0_26])]) ).
cnf(c_0_68,plain,
~ equalish(e_2,e_3),
c_0_63 ).
cnf(c_0_69,plain,
( product(e_2,e_4,e_3)
| product(e_2,e_4,e_2)
| product(e_2,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_64]),c_0_65]) ).
cnf(c_0_70,negated_conjecture,
~ product(e_2,e_4,e_3),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_38]) ).
cnf(c_0_71,plain,
( ~ product(X1,e_1,X2)
| ~ product(X1,e_3,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_72,plain,
( ~ product(e_2,X1,X2)
| ~ product(e_3,X1,X2) ),
inference(spm,[status(thm)],[c_0_68,c_0_20]) ).
cnf(c_0_73,plain,
( product(e_2,e_4,e_1)
| product(e_2,e_4,e_2) ),
inference(sr,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,plain,
~ product(e_1,e_3,e_1),
inference(spm,[status(thm)],[c_0_71,c_0_26]) ).
cnf(c_0_75,plain,
~ product(e_2,e_3,e_3),
inference(spm,[status(thm)],[c_0_72,c_0_26]) ).
cnf(c_0_76,plain,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_4,X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_27]) ).
cnf(c_0_77,plain,
( ~ product(e_2,e_3,e_1)
| product(e_2,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_35,c_0_73]) ).
cnf(c_0_78,plain,
( product(e_1,e_3,e_4)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_45]),c_0_74]) ).
cnf(c_0_79,plain,
( product(e_2,e_3,e_4)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_64]),c_0_75]) ).
cnf(c_0_80,plain,
~ product(e_2,e_3,e_1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_26])]) ).
cnf(c_0_81,plain,
( ~ product(e_2,e_3,e_4)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_56,c_0_78]) ).
cnf(c_0_82,plain,
( product(e_2,e_3,e_2)
| product(e_2,e_3,e_4) ),
inference(sr,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_83,plain,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| product(e_2,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_84,plain,
( product(e_2,e_3,e_2)
| product(e_1,e_3,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_83]),c_0_26])]) ).
cnf(c_0_85,plain,
~ product(e_4,e_3,e_2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_84]),c_0_59]) ).
cnf(c_0_86,negated_conjecture,
( product(e_3,e_4,e_3)
| product(e_3,e_4,e_2) ),
inference(sr,[status(thm)],[c_0_58,c_0_85]) ).
cnf(c_0_87,plain,
( ~ product(e_1,e_2,e_3)
| product(e_1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_76,c_0_57]) ).
cnf(c_0_88,negated_conjecture,
product(e_3,e_4,e_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_86]),c_0_26])]) ).
cnf(c_0_89,plain,
( ~ product(e_1,e_2,e_3)
| ~ product(e_3,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_60,c_0_87]) ).
cnf(c_0_90,negated_conjecture,
( ~ product(e_4,e_3,X1)
| product(X1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_39,c_0_88]) ).
cnf(c_0_91,plain,
( product(e_4,e_3,e_1)
| product(e_4,e_3,e_3) ),
inference(sr,[status(thm)],[c_0_48,c_0_85]) ).
cnf(c_0_92,plain,
~ product(e_1,e_2,e_3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_88])]) ).
cnf(c_0_93,negated_conjecture,
product(e_4,e_3,e_3),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]) ).
cnf(c_0_94,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_93]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP126-3.004 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/5.36 % Computer : n012.cluster.edu
% 0.08/5.36 % Model : x86_64 x86_64
% 0.08/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36 % Memory : 8046.5625MB
% 0.08/5.36 % OS : Linux 6.8.0-71-generic
% 0.08/5.36 % CPULimit : 300
% 0.08/5.36 % WCLimit : 300
% 0.08/5.36 % DateTime : Sun Sep 20 19:59:13 UTC 2026
% 0.08/5.37 % CPUTime :
% 0.08/5.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.40 Running first-order theorem proving
% 0.13/5.40 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
% 0.13/5.44 % Version: 3.5.1
% 0.13/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/5.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/5.44 % Starting sh5l with 300s (1) cores
% 0.13/5.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 741991 completed with status 0
% 0.13/5.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/5.44 % No SInE strategy applied
% 0.13/5.44 % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.13/5.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/5.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/5.44 % Starting H----_011_C07_F1_PI_AE_OS_R8_SP_S1U with 136s (1) cores
% 0.13/5.44 % Starting G----_425_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.13/5.44 % Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/5.44 % G----_425_C05_02_F1_SE_CS_SP_PS_RG_S04AI with pid 742000 completed with status 0
% 0.13/5.44 % Result found by G----_425_C05_02_F1_SE_CS_SP_PS_RG_S04AI
% 0.13/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/5.44 % No SInE strategy applied
% 0.13/5.44 % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.13/5.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/5.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/5.44 % Starting H----_011_C07_F1_PI_AE_OS_R8_SP_S1U with 136s (1) cores
% 0.13/5.44 % Starting G----_425_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.13/5.44 % Preprocessing time : 0.001 s
% 0.13/5.44 % Presaturation interreduction done
% 0.13/5.44
% 0.13/5.44 % Proof found!
% 0.13/5.44 % SZS status Unsatisfiable
% 0.13/5.44 % SZS output start CNFRefutation
% See solution above
% 0.13/5.44 % Parsed axioms : 43
% 0.13/5.44 % Removed by relevancy pruning/SinE : 0
% 0.13/5.44 % Initial clauses : 43
% 0.13/5.44 % Removed in clause preprocessing : 0
% 0.13/5.44 % Initial clauses in saturation : 43
% 0.13/5.44 % Processed clauses : 441
% 0.13/5.44 % ...of these trivial : 0
% 0.13/5.44 % ...subsumed : 106
% 0.13/5.44 % ...remaining for further processing : 335
% 0.13/5.44 % Other redundant clauses eliminated : 0
% 0.13/5.44 % Clauses deleted for lack of memory : 0
% 0.13/5.44 % Backward-subsumed : 54
% 0.13/5.44 % Backward-rewritten : 5
% 0.13/5.44 % Generated clauses : 510
% 0.13/5.44 % ...of the previous two non-redundant : 473
% 0.13/5.44 % ...aggressively subsumed : 0
% 0.13/5.44 % Contextual simplify-reflections : 18
% 0.13/5.44 % Paramodulations : 504
% 0.13/5.44 % Factorizations : 0
% 0.13/5.44 % NegExts : 0
% 0.13/5.44 % Equation resolutions : 0
% 0.13/5.44 % Disequality decompositions : 0
% 0.13/5.44 % Total rewrite steps : 103
% 0.13/5.44 % ...of those cached : 88
% 0.13/5.44 % Propositional unsat checks : 0
% 0.13/5.44 % Propositional check models : 0
% 0.13/5.44 % Propositional check unsatisfiable : 0
% 0.13/5.44 % Propositional clauses : 0
% 0.13/5.44 % Propositional clauses after purity: 0
% 0.13/5.44 % Propositional unsat core size : 0
% 0.13/5.44 % Propositional preprocessing time : 0.000
% 0.13/5.44 % Propositional encoding time : 0.000
% 0.13/5.44 % Propositional solver time : 0.000
% 0.13/5.44 % Success case prop preproc time : 0.000
% 0.13/5.44 % Success case prop encoding time : 0.000
% 0.13/5.44 % Success case prop solver time : 0.000
% 0.13/5.44 % Current number of processed clauses : 227
% 0.13/5.44 % Positive orientable unit clauses : 22
% 0.13/5.44 % Positive unorientable unit clauses: 0
% 0.13/5.44 % Negative unit clauses : 40
% 0.13/5.44 % Non-unit-clauses : 165
% 0.13/5.44 % Current number of unprocessed clauses: 60
% 0.13/5.44 % ...number of literals in the above : 286
% 0.13/5.44 % Current number of archived formulas : 0
% 0.13/5.44 % Current number of archived clauses : 108
% 0.13/5.44 % Clause-clause subsumption calls (NU) : 8783
% 0.13/5.44 % Rec. Clause-clause subsumption calls : 4625
% 0.13/5.44 % Non-unit clause-clause subsumptions : 96
% 0.13/5.44 % Unit Clause-clause subsumption calls : 1878
% 0.13/5.44 % Rewrite failures with RHS unbound : 0
% 0.13/5.44 % BW rewrite match attempts : 10
% 0.13/5.44 % BW rewrite match successes : 2
% 0.13/5.44 % Condensation attempts : 0
% 0.13/5.44 % Condensation successes : 0
% 0.13/5.44 % Termbank termtop insertions : 7799
% 0.13/5.44 % Search garbage collected termcells : 98
% 0.13/5.44
% 0.13/5.44 % -------------------------------------------------
% 0.13/5.44 % User time : 0.024 s
% 0.13/5.44 % System time : 0.001 s
% 0.13/5.44 % Total time : 0.025 s
% 0.13/5.44 % Maximum resident set size: 3656 pages
% 0.13/5.44
% 0.13/5.44 % -------------------------------------------------
% 0.13/5.44 % User time : 0.111 s
% 0.13/5.44 % System time : 0.014 s
% 0.13/5.44 % Total time : 0.125 s
% 0.13/5.44 % Maximum resident set size: 4864 pages
% 0.13/5.44 % E exiting
%------------------------------------------------------------------------------