%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP124-7.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 : n026.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:00 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 20
% Syntax : Number of clauses : 100 ( 36 unt; 28 nHn; 96 RR)
% Number of literals : 242 ( 0 equ; 107 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 119 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product2_right_cancellation,axiom,
( ~ product2(X1,X4,X3)
| ~ product2(X1,X2,X3)
| equalish(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product2_right_cancellation) ).
cnf(product1_total_function1,axiom,
( ~ group_element(X2)
| ~ group_element(X1)
| product1(X1,X2,e_4)
| product1(X1,X2,e_3)
| product1(X1,X2,e_2)
| product1(X1,X2,e_1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_total_function1) ).
cnf(qg2a,negated_conjecture,
( ~ product1(X3,X1,X4)
| ~ product1(X1,X2,X3)
| product2(X4,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qg2a) ).
cnf(product2_left_cancellation,axiom,
( ~ product2(X4,X2,X3)
| ~ product2(X1,X2,X3)
| equalish(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product2_left_cancellation) ).
cnf(product2_idempotence,axiom,
product2(X1,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product2_idempotence) ).
cnf(product2_total_function1,axiom,
( ~ group_element(X2)
| ~ group_element(X1)
| product2(X1,X2,e_4)
| product2(X1,X2,e_3)
| product2(X1,X2,e_2)
| product2(X1,X2,e_1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product2_total_function1) ).
cnf(product1_left_cancellation,axiom,
( ~ product1(X4,X2,X3)
| ~ product1(X1,X2,X3)
| equalish(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_left_cancellation) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_4) ).
cnf(product2_total_function2,axiom,
( ~ product2(X1,X2,X4)
| ~ product2(X1,X2,X3)
| equalish(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product2_total_function2) ).
cnf(product1_idempotence,axiom,
product1(X1,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_idempotence) ).
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_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_4) ).
cnf(product1_right_cancellation,axiom,
( ~ product1(X1,X4,X3)
| ~ product1(X1,X2,X3)
| equalish(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_right_cancellation) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_1) ).
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(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(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_3) ).
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(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(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_20,plain,
( ~ product2(X1,X4,X3)
| ~ product2(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product2_right_cancellation]) ).
cnf(c_0_21,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product1(X1,X2,e_4)
| product1(X1,X2,e_3)
| product1(X1,X2,e_2)
| product1(X1,X2,e_1) ),
inference(fof_simplification,[status(thm)],[product1_total_function1]) ).
cnf(c_0_22,negated_conjecture,
( ~ product1(X3,X1,X4)
| ~ product1(X1,X2,X3)
| product2(X4,X2,X1) ),
inference(fof_simplification,[status(thm)],[qg2a]) ).
cnf(c_0_23,plain,
( ~ product2(X4,X2,X3)
| ~ product2(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product2_left_cancellation]) ).
cnf(c_0_24,plain,
( ~ product2(X1,X4,X3)
| ~ product2(X1,X2,X3)
| equalish(X2,X4) ),
c_0_20 ).
cnf(c_0_25,axiom,
product2(X1,X1,X1),
product2_idempotence ).
cnf(c_0_26,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product2(X1,X2,e_4)
| product2(X1,X2,e_3)
| product2(X1,X2,e_2)
| product2(X1,X2,e_1) ),
inference(fof_simplification,[status(thm)],[product2_total_function1]) ).
cnf(c_0_27,plain,
( ~ product1(X4,X2,X3)
| ~ product1(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product1_left_cancellation]) ).
cnf(c_0_28,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product1(X1,X2,e_4)
| product1(X1,X2,e_3)
| product1(X1,X2,e_2)
| product1(X1,X2,e_1) ),
c_0_21 ).
cnf(c_0_29,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_30,plain,
( ~ product2(X1,X2,X4)
| ~ product2(X1,X2,X3)
| equalish(X3,X4) ),
inference(fof_simplification,[status(thm)],[product2_total_function2]) ).
cnf(c_0_31,negated_conjecture,
( ~ product1(X3,X1,X4)
| ~ product1(X1,X2,X3)
| product2(X4,X2,X1) ),
c_0_22 ).
cnf(c_0_32,axiom,
product1(X1,X1,X1),
product1_idempotence ).
cnf(c_0_33,plain,
( ~ product2(X4,X2,X3)
| ~ product2(X1,X2,X3)
| equalish(X1,X4) ),
c_0_23 ).
cnf(c_0_34,plain,
( ~ product2(X2,X1,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product2(X1,X2,e_4)
| product2(X1,X2,e_3)
| product2(X1,X2,e_2)
| product2(X1,X2,e_1) ),
c_0_26 ).
cnf(c_0_36,plain,
~ equalish(e_4,e_1),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_1]) ).
cnf(c_0_37,plain,
~ equalish(e_1,e_4),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_4]) ).
cnf(c_0_38,plain,
( ~ product1(X1,X4,X3)
| ~ product1(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product1_right_cancellation]) ).
cnf(c_0_39,plain,
( ~ product1(X4,X2,X3)
| ~ product1(X1,X2,X3)
| equalish(X1,X4) ),
c_0_27 ).
cnf(c_0_40,plain,
( ~ group_element(X1)
| product1(X1,e_4,e_4)
| product1(X1,e_4,e_3)
| product1(X1,e_4,e_2)
| product1(X1,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_41,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_42,plain,
( ~ product2(X1,X2,X4)
| ~ product2(X1,X2,X3)
| equalish(X3,X4) ),
c_0_30 ).
cnf(c_0_43,negated_conjecture,
( ~ product1(X1,X2,X1)
| product2(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_44,plain,
( ~ product2(X1,X2,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_45,plain,
( ~ group_element(X1)
| equalish(X1,e_4)
| product2(e_4,X1,e_3)
| product2(e_4,X1,e_2)
| product2(e_4,X1,e_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_29])]) ).
cnf(c_0_46,plain,
~ equalish(e_4,e_1),
c_0_36 ).
cnf(c_0_47,plain,
~ equalish(e_1,e_4),
c_0_37 ).
cnf(c_0_48,plain,
~ equalish(e_3,e_4),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_4]) ).
cnf(c_0_49,plain,
( ~ product1(X1,X4,X3)
| ~ product1(X1,X2,X3)
| equalish(X2,X4) ),
c_0_38 ).
cnf(c_0_50,plain,
( ~ product1(X1,X2,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_32]) ).
cnf(c_0_51,plain,
( product1(e_1,e_4,e_1)
| product1(e_1,e_4,e_2)
| product1(e_1,e_4,e_3)
| product1(e_1,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_52,negated_conjecture,
( ~ product1(X2,X3,X2)
| ~ product2(X2,X3,X1)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_53,plain,
( product2(e_4,e_1,e_2)
| product2(e_4,e_1,e_3) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_41])]),c_0_46]),c_0_47]) ).
cnf(c_0_54,plain,
~ equalish(e_3,e_4),
c_0_48 ).
cnf(c_0_55,plain,
~ equalish(e_2,e_4),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_4]) ).
cnf(c_0_56,plain,
( ~ product1(X2,X1,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_32]) ).
cnf(c_0_57,plain,
( product1(e_1,e_4,e_3)
| product1(e_1,e_4,e_2)
| product1(e_1,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_47]) ).
cnf(c_0_58,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_59,negated_conjecture,
( ~ product1(e_4,e_1,e_4)
| product2(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_60,plain,
~ equalish(e_2,e_4),
c_0_55 ).
cnf(c_0_61,plain,
( product1(e_1,e_4,e_2)
| product1(e_1,e_4,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_46]) ).
cnf(c_0_62,plain,
~ equalish(e_4,e_3),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_3]) ).
cnf(c_0_63,plain,
( ~ group_element(X1)
| product1(X1,e_3,e_4)
| product1(X1,e_3,e_3)
| product1(X1,e_3,e_2)
| product1(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_28,c_0_58]) ).
cnf(c_0_64,plain,
( ~ group_element(X1)
| product1(X1,e_1,e_4)
| product1(X1,e_1,e_3)
| product1(X1,e_1,e_2)
| product1(X1,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_28,c_0_41]) ).
cnf(c_0_65,negated_conjecture,
~ product1(e_4,e_1,e_4),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_59]),c_0_60]) ).
cnf(c_0_66,negated_conjecture,
( ~ product1(e_4,X1,e_1)
| product1(e_1,e_4,e_2)
| product2(e_3,X1,e_4) ),
inference(spm,[status(thm)],[c_0_31,c_0_61]) ).
cnf(c_0_67,plain,
~ equalish(e_4,e_3),
c_0_62 ).
cnf(c_0_68,plain,
( product1(e_4,e_3,e_1)
| product1(e_4,e_3,e_2)
| product1(e_4,e_3,e_3)
| product1(e_4,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_63,c_0_29]) ).
cnf(c_0_69,plain,
( product1(e_4,e_1,e_1)
| product1(e_4,e_1,e_2)
| product1(e_4,e_1,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_29]),c_0_65]) ).
cnf(c_0_70,negated_conjecture,
( ~ product1(e_4,X1,e_1)
| ~ product1(e_3,X1,e_3)
| product1(e_1,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_66]),c_0_67]) ).
cnf(c_0_71,plain,
( product1(e_4,e_3,e_3)
| product1(e_4,e_3,e_2)
| product1(e_4,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_68]),c_0_54]) ).
cnf(c_0_72,plain,
( product1(e_4,e_1,e_3)
| product1(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_69]),c_0_46]) ).
cnf(c_0_73,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_74,negated_conjecture,
( product1(e_1,e_4,e_2)
| product1(e_4,e_3,e_2)
| product1(e_4,e_3,e_3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_32])]) ).
cnf(c_0_75,plain,
( ~ product2(X2,X2,X1)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_25]) ).
cnf(c_0_76,negated_conjecture,
( ~ product1(e_1,X1,e_4)
| product1(e_4,e_1,e_2)
| product2(e_3,X1,e_1) ),
inference(spm,[status(thm)],[c_0_31,c_0_72]) ).
cnf(c_0_77,plain,
~ equalish(e_1,e_3),
c_0_73 ).
cnf(c_0_78,negated_conjecture,
( product1(e_4,e_3,e_2)
| product1(e_1,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_74]),c_0_67]) ).
cnf(c_0_79,negated_conjecture,
( ~ product1(e_1,e_3,e_4)
| product1(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_80,negated_conjecture,
( ~ product1(e_4,X1,e_2)
| equalish(X1,e_3)
| product1(e_1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_49,c_0_78]) ).
cnf(c_0_81,negated_conjecture,
( ~ product1(e_1,X1,e_4)
| ~ product1(e_1,e_3,e_4)
| product2(e_2,X1,e_1) ),
inference(spm,[status(thm)],[c_0_31,c_0_79]) ).
cnf(c_0_82,negated_conjecture,
( ~ product1(e_1,e_3,e_4)
| product1(e_1,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_79]),c_0_77]) ).
cnf(c_0_83,negated_conjecture,
( ~ product1(e_1,X2,e_4)
| ~ product1(e_1,e_3,e_4)
| ~ product2(e_2,X2,X1)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_42,c_0_81]) ).
cnf(c_0_84,negated_conjecture,
( ~ product1(e_4,X1,e_1)
| ~ product1(e_1,e_3,e_4)
| product2(e_2,X1,e_4) ),
inference(spm,[status(thm)],[c_0_31,c_0_82]) ).
cnf(c_0_85,negated_conjecture,
( ~ product1(e_4,X1,e_1)
| ~ product1(e_1,X1,e_4)
| ~ product1(e_1,e_3,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_46]) ).
cnf(c_0_86,negated_conjecture,
( ~ product1(e_1,e_3,e_4)
| product1(e_4,e_3,e_2)
| product1(e_4,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_85,c_0_71]) ).
cnf(c_0_87,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_88,negated_conjecture,
( ~ product1(e_4,X1,e_2)
| ~ product1(e_1,e_3,e_4)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_49,c_0_79]) ).
cnf(c_0_89,negated_conjecture,
( ~ product1(e_1,e_3,e_4)
| product1(e_4,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_86]),c_0_67]) ).
cnf(c_0_90,plain,
~ equalish(e_3,e_1),
c_0_87 ).
cnf(c_0_91,plain,
( product1(e_1,e_3,e_1)
| product1(e_1,e_3,e_2)
| product1(e_1,e_3,e_3)
| product1(e_1,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_63,c_0_41]) ).
cnf(c_0_92,negated_conjecture,
~ product1(e_1,e_3,e_4),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]) ).
cnf(c_0_93,plain,
( product1(e_1,e_3,e_3)
| product1(e_1,e_3,e_2)
| product1(e_1,e_3,e_1) ),
inference(sr,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_94,plain,
( product1(e_1,e_3,e_2)
| product1(e_1,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_93]),c_0_90]) ).
cnf(c_0_95,plain,
product1(e_1,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_94]),c_0_77]) ).
cnf(c_0_96,negated_conjecture,
( ~ product1(X1,e_3,e_2)
| equalish(X1,e_4)
| product1(e_1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_39,c_0_78]) ).
cnf(c_0_97,plain,
( ~ product1(e_1,X1,e_2)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_49,c_0_95]) ).
cnf(c_0_98,negated_conjecture,
product1(e_1,e_4,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_95]),c_0_47]) ).
cnf(c_0_99,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP124-7.004 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n026.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 20:01:52 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 471753 completed with status 0
% 0.12/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45 % No SInE strategy applied
% 0.12/0.45 % Search class: FGHNS-FFMM00-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.12/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.45 % SubtermCWHack with pid 471757 completed with status 0
% 0.12/0.45 % Result found by SubtermCWHack
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45 % No SInE strategy applied
% 0.12/0.45 % Search class: FGHNS-FFMM00-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45 % Preprocessing time : 0.001 s
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Unsatisfiable
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45 % Parsed axioms : 37
% 0.12/0.45 % Removed by relevancy pruning/SinE : 0
% 0.12/0.45 % Initial clauses : 37
% 0.12/0.45 % Removed in clause preprocessing : 0
% 0.12/0.45 % Initial clauses in saturation : 37
% 0.12/0.45 % Processed clauses : 394
% 0.12/0.45 % ...of these trivial : 0
% 0.12/0.45 % ...subsumed : 126
% 0.12/0.45 % ...remaining for further processing : 268
% 0.12/0.45 % Other redundant clauses eliminated : 0
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 89
% 0.12/0.45 % Backward-rewritten : 34
% 0.12/0.45 % Generated clauses : 978
% 0.12/0.45 % ...of the previous two non-redundant : 718
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 0
% 0.12/0.45 % Paramodulations : 976
% 0.12/0.45 % Factorizations : 0
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 0
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 448
% 0.12/0.45 % ...of those cached : 430
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 143
% 0.12/0.45 % Positive orientable unit clauses : 18
% 0.12/0.45 % Positive unorientable unit clauses: 0
% 0.12/0.45 % Negative unit clauses : 18
% 0.12/0.45 % Non-unit-clauses : 107
% 0.12/0.45 % Current number of unprocessed clauses: 307
% 0.12/0.45 % ...number of literals in the above : 1580
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 125
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 7306
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 3844
% 0.12/0.45 % Non-unit clause-clause subsumptions : 127
% 0.12/0.45 % Unit Clause-clause subsumption calls : 502
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 20
% 0.12/0.45 % BW rewrite match successes : 2
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 16560
% 0.12/0.45 % Search garbage collected termcells : 72
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.017 s
% 0.12/0.45 % System time : 0.005 s
% 0.12/0.45 % Total time : 0.022 s
% 0.12/0.45 % Maximum resident set size: 3652 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.049 s
% 0.12/0.45 % System time : 0.014 s
% 0.12/0.45 % Total time : 0.064 s
% 0.12/0.45 % Maximum resident set size: 4864 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------