%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP124-3.004 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:37:59 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.58s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 19
% Syntax : Number of clauses : 106 ( 63 unt; 15 nHn; 104 RR)
% Number of literals : 196 ( 0 equ; 114 neg)
% Maximal clause size : 6 ( 1 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 : 72 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_right_cancellation,axiom,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(product_left_cancellation,axiom,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',product_total_function1) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_4) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_idempotence) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_4_is_not_e_3) ).
cnf(qg2_2,negated_conjecture,
( ~ product(X6,X4,X5)
| ~ product(X6,X1,X2)
| ~ product(X4,X5,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qg2_2) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_3) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_4) ).
cnf(e_2_is_not_e_4,axiom,
~ equalish(e_2,e_4),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',e_2_is_not_e_3) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_2) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_2) ).
cnf(e_4_is_not_e_2,axiom,
~ equalish(e_4,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_4_is_not_e_2) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_4) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_4_is_not_e_1) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_3) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_1) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_1) ).
cnf(c_0_19,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_20,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_21,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_22,plain,
~ equalish(e_3,e_4),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_4]) ).
cnf(c_0_23,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
c_0_19 ).
cnf(c_0_24,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_25,plain,
~ equalish(e_4,e_3),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_3]) ).
cnf(c_0_26,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
c_0_20 ).
cnf(c_0_27,negated_conjecture,
( ~ product(X6,X4,X5)
| ~ product(X6,X1,X2)
| ~ product(X4,X5,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X5) ),
inference(fof_simplification,[status(thm)],[qg2_2]) ).
cnf(c_0_28,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_21 ).
cnf(c_0_29,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_30,plain,
~ equalish(e_3,e_4),
c_0_22 ).
cnf(c_0_31,plain,
( ~ product(X2,X1,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
~ equalish(e_4,e_3),
c_0_25 ).
cnf(c_0_33,plain,
( ~ product(X1,X2,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( ~ product(X6,X4,X5)
| ~ product(X6,X1,X2)
| ~ product(X4,X5,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X5) ),
c_0_27 ).
cnf(c_0_35,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_28,c_0_29]) ).
cnf(c_0_36,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_37,plain,
~ product(e_4,e_3,e_4),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
~ product(e_4,e_3,e_3),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
~ equalish(e_2,e_4),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_4]) ).
cnf(c_0_40,negated_conjecture,
( ~ product(X3,X1,X4)
| ~ product(X2,X2,X4)
| ~ product(X2,X3,X1)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_24]) ).
cnf(c_0_41,plain,
( product(e_4,e_3,e_2)
| product(e_4,e_3,e_1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]) ).
cnf(c_0_42,plain,
~ equalish(e_2,e_4),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
( ~ product(e_3,e_2,X1)
| ~ product(e_4,e_4,X1)
| product(e_4,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_44,plain,
~ equalish(e_2,e_3),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_3]) ).
cnf(c_0_45,plain,
~ equalish(e_3,e_2),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_2]) ).
cnf(c_0_46,negated_conjecture,
( ~ product(e_3,e_2,e_4)
| product(e_4,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_43,c_0_24]) ).
cnf(c_0_47,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_48,plain,
~ equalish(e_2,e_3),
c_0_44 ).
cnf(c_0_49,plain,
~ equalish(e_3,e_2),
c_0_45 ).
cnf(c_0_50,negated_conjecture,
( ~ product(X1,e_3,e_1)
| ~ product(e_3,e_2,e_4)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_26,c_0_46]) ).
cnf(c_0_51,plain,
( ~ group_element(X1)
| product(X1,e_2,e_1)
| product(X1,e_2,e_2)
| product(X1,e_2,e_3)
| product(X1,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_28,c_0_47]) ).
cnf(c_0_52,plain,
~ product(e_3,e_2,e_3),
inference(spm,[status(thm)],[c_0_48,c_0_31]) ).
cnf(c_0_53,plain,
~ product(e_3,e_2,e_2),
inference(spm,[status(thm)],[c_0_49,c_0_33]) ).
cnf(c_0_54,plain,
~ equalish(e_4,e_2),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_2]) ).
cnf(c_0_55,negated_conjecture,
( ~ product(e_2,e_3,e_1)
| ~ product(e_3,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_42,c_0_50]) ).
cnf(c_0_56,plain,
( product(e_3,e_2,e_4)
| product(e_3,e_2,e_1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_29]),c_0_52]),c_0_53]) ).
cnf(c_0_57,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_28,c_0_36]) ).
cnf(c_0_58,plain,
~ product(e_3,e_4,e_4),
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_59,plain,
~ product(e_3,e_4,e_3),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_60,plain,
~ equalish(e_4,e_2),
c_0_54 ).
cnf(c_0_61,negated_conjecture,
( ~ product(e_2,e_3,e_1)
| product(e_3,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
( product(e_3,e_4,e_2)
| product(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_29]),c_0_58]),c_0_59]) ).
cnf(c_0_63,plain,
~ product(e_4,e_2,e_4),
inference(spm,[status(thm)],[c_0_42,c_0_31]) ).
cnf(c_0_64,plain,
~ product(e_4,e_2,e_2),
inference(spm,[status(thm)],[c_0_60,c_0_33]) ).
cnf(c_0_65,negated_conjecture,
( ~ product(X1,e_2,e_1)
| ~ product(e_2,e_3,e_1)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_26,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( ~ product(e_4,e_2,X1)
| ~ product(e_3,e_3,X1)
| product(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_62]),c_0_48]) ).
cnf(c_0_67,plain,
( product(e_4,e_2,e_3)
| product(e_4,e_2,e_1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_36]),c_0_63]),c_0_64]) ).
cnf(c_0_68,negated_conjecture,
( ~ product(e_4,e_2,e_1)
| ~ product(e_2,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_32,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
( product(e_3,e_4,e_1)
| product(e_4,e_2,e_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_24])]) ).
cnf(c_0_70,negated_conjecture,
( ~ product(e_2,e_3,e_1)
| product(e_3,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_71,plain,
~ product(e_2,e_3,e_3),
inference(spm,[status(thm)],[c_0_48,c_0_33]) ).
cnf(c_0_72,plain,
~ product(e_2,e_3,e_2),
inference(spm,[status(thm)],[c_0_49,c_0_31]) ).
cnf(c_0_73,negated_conjecture,
( ~ product(e_3,X1,e_1)
| ~ product(e_2,e_3,e_1)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_23,c_0_70]) ).
cnf(c_0_74,plain,
( product(e_2,e_3,e_4)
| product(e_2,e_3,e_1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_47]),c_0_71]),c_0_72]) ).
cnf(c_0_75,negated_conjecture,
~ product(e_2,e_3,e_1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_73]),c_0_61]) ).
cnf(c_0_76,plain,
product(e_2,e_3,e_4),
inference(sr,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_77,negated_conjecture,
( ~ product(e_3,e_4,X1)
| ~ product(e_2,e_2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_76]),c_0_60]) ).
cnf(c_0_78,plain,
~ equalish(e_1,e_4),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_4]) ).
cnf(c_0_79,plain,
~ equalish(e_4,e_1),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_1]) ).
cnf(c_0_80,negated_conjecture,
product(e_3,e_4,e_1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_62]),c_0_24])]) ).
cnf(c_0_81,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_82,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_83,plain,
~ equalish(e_1,e_4),
c_0_78 ).
cnf(c_0_84,plain,
~ equalish(e_4,e_1),
c_0_79 ).
cnf(c_0_85,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_86,negated_conjecture,
( ~ product(e_3,X1,e_1)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_23,c_0_80]) ).
cnf(c_0_87,plain,
~ equalish(e_1,e_3),
c_0_81 ).
cnf(c_0_88,plain,
( ~ group_element(X1)
| product(X1,e_1,e_1)
| product(X1,e_1,e_2)
| product(X1,e_1,e_3)
| product(X1,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_28,c_0_82]) ).
cnf(c_0_89,plain,
~ product(e_4,e_1,e_4),
inference(spm,[status(thm)],[c_0_83,c_0_31]) ).
cnf(c_0_90,plain,
~ product(e_4,e_1,e_1),
inference(spm,[status(thm)],[c_0_84,c_0_33]) ).
cnf(c_0_91,plain,
~ equalish(e_3,e_1),
c_0_85 ).
cnf(c_0_92,negated_conjecture,
( ~ product(e_3,e_1,X1)
| ~ product(e_4,e_4,X1)
| ~ product(e_3,e_2,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_46]),c_0_83]) ).
cnf(c_0_93,negated_conjecture,
~ product(e_3,e_2,e_1),
inference(spm,[status(thm)],[c_0_42,c_0_86]) ).
cnf(c_0_94,negated_conjecture,
( ~ product(e_4,e_1,X1)
| ~ product(e_3,e_3,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_80]),c_0_87]) ).
cnf(c_0_95,plain,
( product(e_4,e_1,e_3)
| product(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_36]),c_0_89]),c_0_90]) ).
cnf(c_0_96,plain,
~ product(e_3,e_1,e_3),
inference(spm,[status(thm)],[c_0_87,c_0_31]) ).
cnf(c_0_97,plain,
~ product(e_3,e_1,e_1),
inference(spm,[status(thm)],[c_0_91,c_0_33]) ).
cnf(c_0_98,negated_conjecture,
( ~ product(e_3,e_1,e_4)
| ~ product(e_3,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_92,c_0_24]) ).
cnf(c_0_99,plain,
product(e_3,e_2,e_4),
inference(sr,[status(thm)],[c_0_56,c_0_93]) ).
cnf(c_0_100,negated_conjecture,
product(e_4,e_1,e_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_24])]) ).
cnf(c_0_101,plain,
( product(e_3,e_1,e_4)
| product(e_3,e_1,e_2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_29]),c_0_96]),c_0_97]) ).
cnf(c_0_102,negated_conjecture,
~ product(e_3,e_1,e_4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99])]) ).
cnf(c_0_103,negated_conjecture,
( ~ product(X1,e_1,e_2)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_26,c_0_100]) ).
cnf(c_0_104,plain,
product(e_3,e_1,e_2),
inference(sr,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_105,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_103]),c_0_104])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP124-3.004 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n004.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Sun Sep 20 19:58:49 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.23/0.58 % Version: 3.5.1
% 0.23/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58 % Starting sh5l with 300s (1) cores
% 0.23/0.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1357774 completed with status 0
% 0.23/0.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.58 % No SInE strategy applied
% 0.23/0.58 % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.23/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.58 % Starting H----_011_C07_F1_PI_AE_OS_R8_SP_S1U with 136s (1) cores
% 0.23/0.58 % Starting G----_425_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.23/0.58 % Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.58 % G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1357785 completed with status 0
% 0.23/0.58 % Result found by G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.58 % No SInE strategy applied
% 0.23/0.58 % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.23/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.58 % Starting H----_011_C07_F1_PI_AE_OS_R8_SP_S1U with 136s (1) cores
% 0.23/0.58 % Starting G----_425_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.23/0.58 % Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.58 % Preprocessing time : 0.002 s
% 0.23/0.58 % Presaturation interreduction done
% 0.23/0.58
% 0.23/0.58 % Proof found!
% 0.23/0.58 % SZS status Unsatisfiable
% 0.23/0.58 % SZS output start CNFRefutation
% See solution above
% 0.23/0.58 % Parsed axioms : 44
% 0.23/0.58 % Removed by relevancy pruning/SinE : 0
% 0.23/0.58 % Initial clauses : 44
% 0.23/0.58 % Removed in clause preprocessing : 0
% 0.23/0.58 % Initial clauses in saturation : 44
% 0.23/0.58 % Processed clauses : 260
% 0.23/0.58 % ...of these trivial : 1
% 0.23/0.58 % ...subsumed : 27
% 0.23/0.58 % ...remaining for further processing : 232
% 0.23/0.58 % Other redundant clauses eliminated : 0
% 0.23/0.58 % Clauses deleted for lack of memory : 0
% 0.23/0.58 % Backward-subsumed : 15
% 0.23/0.58 % Backward-rewritten : 21
% 0.23/0.58 % Generated clauses : 350
% 0.23/0.58 % ...of the previous two non-redundant : 343
% 0.23/0.58 % ...aggressively subsumed : 0
% 0.23/0.58 % Contextual simplify-reflections : 1
% 0.23/0.58 % Paramodulations : 345
% 0.23/0.58 % Factorizations : 0
% 0.23/0.58 % NegExts : 0
% 0.23/0.58 % Equation resolutions : 0
% 0.23/0.58 % Disequality decompositions : 0
% 0.23/0.58 % Total rewrite steps : 44
% 0.23/0.58 % ...of those cached : 28
% 0.23/0.58 % Propositional unsat checks : 0
% 0.23/0.58 % Propositional check models : 0
% 0.23/0.58 % Propositional check unsatisfiable : 0
% 0.23/0.58 % Propositional clauses : 0
% 0.23/0.58 % Propositional clauses after purity: 0
% 0.23/0.58 % Propositional unsat core size : 0
% 0.23/0.58 % Propositional preprocessing time : 0.000
% 0.23/0.58 % Propositional encoding time : 0.000
% 0.23/0.58 % Propositional solver time : 0.000
% 0.23/0.58 % Success case prop preproc time : 0.000
% 0.23/0.58 % Success case prop encoding time : 0.000
% 0.23/0.58 % Success case prop solver time : 0.000
% 0.23/0.58 % Current number of processed clauses : 147
% 0.23/0.58 % Positive orientable unit clauses : 29
% 0.23/0.58 % Positive unorientable unit clauses: 0
% 0.23/0.58 % Negative unit clauses : 53
% 0.23/0.58 % Non-unit-clauses : 65
% 0.23/0.58 % Current number of unprocessed clauses: 170
% 0.23/0.58 % ...number of literals in the above : 581
% 0.23/0.58 % Current number of archived formulas : 0
% 0.23/0.58 % Current number of archived clauses : 85
% 0.23/0.58 % Clause-clause subsumption calls (NU) : 2011
% 0.23/0.58 % Rec. Clause-clause subsumption calls : 1016
% 0.23/0.58 % Non-unit clause-clause subsumptions : 12
% 0.23/0.58 % Unit Clause-clause subsumption calls : 1402
% 0.23/0.58 % Rewrite failures with RHS unbound : 0
% 0.23/0.58 % BW rewrite match attempts : 54
% 0.23/0.58 % BW rewrite match successes : 7
% 0.23/0.58 % Condensation attempts : 0
% 0.23/0.58 % Condensation successes : 0
% 0.23/0.58 % Termbank termtop insertions : 6065
% 0.23/0.58 % Search garbage collected termcells : 107
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.026 s
% 0.23/0.58 % System time : 0.008 s
% 0.23/0.58 % Total time : 0.034 s
% 0.23/0.58 % Maximum resident set size: 3660 pages
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.137 s
% 0.23/0.58 % System time : 0.027 s
% 0.23/0.58 % Total time : 0.164 s
% 0.23/0.58 % Maximum resident set size: 4608 pages
% 0.23/0.58 % E exiting
%------------------------------------------------------------------------------