%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP126-1.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 : 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:38:02 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.56s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 19
% Syntax : Number of clauses : 103 ( 39 unt; 49 nHn; 101 RR)
% Number of literals : 258 ( 0 equ; 76 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 : 78 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_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(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_idempotence) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_4) ).
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(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(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(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_2) ).
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_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_3) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_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_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_2) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_3) ).
cnf(e_4_is_not_e_2,axiom,
~ equalish(e_4,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_2) ).
cnf(c_0_19,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_20,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product_right_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) ),
c_0_19 ).
cnf(c_0_22,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_23,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_24,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_25,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
c_0_20 ).
cnf(c_0_26,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_27,plain,
( ~ group_element(X1)
| product(X1,e_4,e_4)
| product(X1,e_4,e_3)
| product(X1,e_4,e_2)
| product(X1,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
~ equalish(e_4,e_1),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_1]) ).
cnf(c_0_29,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
c_0_23 ).
cnf(c_0_30,plain,
( ~ group_element(X1)
| product(X1,e_1,e_4)
| product(X1,e_1,e_3)
| product(X1,e_1,e_2)
| product(X1,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_31,plain,
( ~ product(X2,X1,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( product(e_1,e_4,e_1)
| product(e_1,e_4,e_2)
| product(e_1,e_4,e_3)
| product(e_1,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_33,plain,
~ equalish(e_4,e_1),
c_0_28 ).
cnf(c_0_34,plain,
~ equalish(e_1,e_4),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_4]) ).
cnf(c_0_35,plain,
( ~ product(X1,X2,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_36,plain,
( product(e_4,e_1,e_1)
| product(e_4,e_1,e_2)
| product(e_4,e_1,e_3)
| product(e_4,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_37,negated_conjecture,
( ~ product(X2,X1,X4)
| ~ product(X1,X2,X3)
| product(X3,X4,X2) ),
inference(fof_simplification,[status(thm)],[qg4]) ).
cnf(c_0_38,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_31,c_0_32]),c_0_33]) ).
cnf(c_0_39,plain,
~ equalish(e_1,e_4),
c_0_34 ).
cnf(c_0_40,plain,
( product(e_4,e_1,e_4)
| product(e_4,e_1,e_3)
| product(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_33]) ).
cnf(c_0_41,negated_conjecture,
( ~ product(X2,X1,X4)
| ~ product(X1,X2,X3)
| product(X3,X4,X2) ),
c_0_37 ).
cnf(c_0_42,plain,
( product(e_1,e_4,e_2)
| product(e_1,e_4,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_38]),c_0_39]) ).
cnf(c_0_43,plain,
( product(e_4,e_1,e_2)
| product(e_4,e_1,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_40]),c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( ~ product(e_4,e_1,X1)
| product(X1,e_3,e_1)
| product(e_1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( ~ product(e_1,e_4,X1)
| product(X1,e_3,e_4)
| product(e_4,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( product(e_1,e_4,e_2)
| product(e_3,e_3,e_1)
| product(e_4,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_44,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( product(e_4,e_1,e_2)
| product(e_2,e_3,e_4)
| product(e_3,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
inference(fof_simplification,[status(thm)],[product_total_function2]) ).
cnf(c_0_49,negated_conjecture,
( ~ product(e_1,e_4,X1)
| product(X1,e_2,e_4)
| product(e_3,e_3,e_1)
| product(e_2,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_41,c_0_47]) ).
cnf(c_0_50,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
c_0_48 ).
cnf(c_0_51,negated_conjecture,
( product(e_2,e_3,e_4)
| product(e_3,e_3,e_1)
| product(e_3,e_2,e_4)
| product(e_1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_49,c_0_42]) ).
cnf(c_0_52,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_53,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_54,plain,
( ~ product(X2,X2,X1)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_26]) ).
cnf(c_0_55,negated_conjecture,
( product(e_2,e_3,e_4)
| product(e_3,e_3,e_1)
| product(e_2,e_2,e_4)
| product(e_3,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_49,c_0_51]) ).
cnf(c_0_56,plain,
~ equalish(e_1,e_3),
c_0_52 ).
cnf(c_0_57,negated_conjecture,
( product(e_1,e_4,e_2)
| product(e_2,e_3,e_1)
| product(e_3,e_3,e_1)
| product(e_2,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_44,c_0_47]) ).
cnf(c_0_58,plain,
( ~ group_element(X1)
| product(X1,e_2,e_4)
| product(X1,e_2,e_3)
| product(X1,e_2,e_2)
| product(X1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_21,c_0_53]) ).
cnf(c_0_59,plain,
~ equalish(e_2,e_1),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_1]) ).
cnf(c_0_60,negated_conjecture,
( product(e_3,e_2,e_4)
| product(e_2,e_2,e_4)
| product(e_2,e_3,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( product(e_2,e_3,e_4)
| product(e_3,e_3,e_1)
| product(e_2,e_2,e_4)
| product(e_2,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_49,c_0_57]) ).
cnf(c_0_62,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_3)
| product(e_1,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_58,c_0_24]) ).
cnf(c_0_63,plain,
~ equalish(e_2,e_1),
c_0_59 ).
cnf(c_0_64,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_65,negated_conjecture,
( ~ product(e_2,e_3,X1)
| product(X1,e_4,e_3)
| product(e_2,e_3,e_4)
| product(e_2,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_41,c_0_60]) ).
cnf(c_0_66,negated_conjecture,
( product(e_2,e_3,e_1)
| product(e_2,e_2,e_4)
| product(e_2,e_3,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_61]),c_0_56]) ).
cnf(c_0_67,plain,
( product(e_1,e_2,e_4)
| product(e_1,e_2,e_3)
| product(e_1,e_2,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_62]),c_0_63]) ).
cnf(c_0_68,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_69,plain,
( ~ group_element(X1)
| product(X1,e_3,e_4)
| product(X1,e_3,e_3)
| product(X1,e_3,e_2)
| product(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_21,c_0_64]) ).
cnf(c_0_70,negated_conjecture,
( product(e_2,e_2,e_4)
| product(e_2,e_3,e_4)
| product(e_1,e_4,e_3) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,plain,
( ~ product(X1,e_2,e_4)
| equalish(X1,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_29,c_0_67]) ).
cnf(c_0_72,plain,
~ equalish(e_3,e_1),
c_0_68 ).
cnf(c_0_73,plain,
~ equalish(e_2,e_4),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_4]) ).
cnf(c_0_74,plain,
( product(e_1,e_3,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_69,c_0_24]) ).
cnf(c_0_75,negated_conjecture,
( ~ product(e_1,X1,e_3)
| equalish(X1,e_4)
| product(e_2,e_3,e_4)
| product(e_2,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_25,c_0_70]) ).
cnf(c_0_76,negated_conjecture,
( product(e_1,e_2,e_3)
| product(e_1,e_2,e_2)
| product(e_2,e_3,e_4)
| product(e_2,e_2,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_60]),c_0_72]) ).
cnf(c_0_77,plain,
~ equalish(e_2,e_4),
c_0_73 ).
cnf(c_0_78,plain,
~ equalish(e_1,e_2),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_2]) ).
cnf(c_0_79,negated_conjecture,
( ~ product(e_4,e_1,X1)
| product(X1,e_2,e_1)
| product(e_4,e_1,e_2)
| product(e_3,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_41,c_0_46]) ).
cnf(c_0_80,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_31,c_0_74]),c_0_72]) ).
cnf(c_0_81,negated_conjecture,
( product(e_2,e_2,e_4)
| product(e_2,e_3,e_4)
| product(e_1,e_2,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_82,plain,
~ equalish(e_1,e_2),
c_0_78 ).
cnf(c_0_83,negated_conjecture,
( product(e_3,e_3,e_1)
| product(e_4,e_1,e_2)
| product(e_3,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_79,c_0_43]) ).
cnf(c_0_84,plain,
( ~ product(X1,e_3,e_4)
| equalish(X1,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_29,c_0_80]) ).
cnf(c_0_85,negated_conjecture,
( product(e_2,e_3,e_4)
| product(e_2,e_2,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_81]),c_0_82]) ).
cnf(c_0_86,negated_conjecture,
( ~ product(e_1,e_4,X1)
| product(X1,e_2,e_4)
| product(e_3,e_2,e_1)
| product(e_3,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_41,c_0_83]) ).
cnf(c_0_87,negated_conjecture,
( product(e_1,e_4,e_2)
| product(e_2,e_3,e_1)
| product(e_3,e_2,e_1)
| product(e_3,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_44,c_0_83]) ).
cnf(c_0_88,negated_conjecture,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| product(e_2,e_2,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_63]) ).
cnf(c_0_89,negated_conjecture,
( product(e_3,e_3,e_1)
| product(e_3,e_2,e_1)
| product(e_2,e_2,e_4)
| product(e_2,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_90,negated_conjecture,
( product(e_2,e_2,e_4)
| product(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_88]),c_0_56]) ).
cnf(c_0_91,negated_conjecture,
( ~ product(e_3,e_2,X1)
| product(X1,e_4,e_2)
| product(e_2,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_41,c_0_85]) ).
cnf(c_0_92,negated_conjecture,
( product(e_2,e_3,e_1)
| product(e_2,e_2,e_4)
| product(e_3,e_2,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_89]),c_0_56]) ).
cnf(c_0_93,plain,
~ equalish(e_4,e_3),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_3]) ).
cnf(c_0_94,negated_conjecture,
( ~ product(e_1,X1,e_2)
| equalish(X1,e_3)
| product(e_2,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_25,c_0_90]) ).
cnf(c_0_95,negated_conjecture,
( product(e_2,e_2,e_4)
| product(e_1,e_4,e_2)
| product(e_2,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_96,plain,
~ equalish(e_4,e_3),
c_0_93 ).
cnf(c_0_97,negated_conjecture,
( ~ product(e_2,e_3,X1)
| equalish(X1,e_4)
| product(e_2,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_50,c_0_85]) ).
cnf(c_0_98,negated_conjecture,
( product(e_2,e_2,e_4)
| product(e_2,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96]) ).
cnf(c_0_99,plain,
~ equalish(e_4,e_2),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_2]) ).
cnf(c_0_100,negated_conjecture,
product(e_2,e_2,e_4),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_39]) ).
cnf(c_0_101,plain,
~ equalish(e_4,e_2),
c_0_99 ).
cnf(c_0_102,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_100]),c_0_101]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP126-1.004 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/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:59:36 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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.23/0.56 % Version: 3.5.1
% 0.23/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.56 % Starting sh5l with 300s (1) cores
% 0.23/0.56 % new_bool_3 with pid 1359387 completed with status 0
% 0.23/0.56 % Result found by new_bool_3
% 0.23/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.56 % Search class: FGUNF-FFSS00-SFFFFFNN
% 0.23/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.56 % SubtermCWHack with pid 1359392 completed with status 0
% 0.23/0.56 % Result found by SubtermCWHack
% 0.23/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.56 % Search class: FGUNF-FFSS00-SFFFFFNN
% 0.23/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.56 % Preprocessing time : 0.001 s
% 0.23/0.56
% 0.23/0.56 % Proof found!
% 0.23/0.56 % SZS status Unsatisfiable
% 0.23/0.56 % SZS output start CNFRefutation
% See solution above
% 0.23/0.56 % Parsed axioms : 22
% 0.23/0.56 % Removed by relevancy pruning/SinE : 0
% 0.23/0.56 % Initial clauses : 22
% 0.23/0.56 % Removed in clause preprocessing : 0
% 0.23/0.56 % Initial clauses in saturation : 22
% 0.23/0.56 % Processed clauses : 282
% 0.23/0.56 % ...of these trivial : 0
% 0.23/0.56 % ...subsumed : 69
% 0.23/0.56 % ...remaining for further processing : 213
% 0.23/0.56 % Other redundant clauses eliminated : 0
% 0.23/0.56 % Clauses deleted for lack of memory : 0
% 0.23/0.56 % Backward-subsumed : 44
% 0.23/0.56 % Backward-rewritten : 15
% 0.23/0.56 % Generated clauses : 975
% 0.23/0.56 % ...of the previous two non-redundant : 662
% 0.23/0.56 % ...aggressively subsumed : 0
% 0.23/0.56 % Contextual simplify-reflections : 0
% 0.23/0.56 % Paramodulations : 975
% 0.23/0.56 % Factorizations : 0
% 0.23/0.56 % NegExts : 0
% 0.23/0.56 % Equation resolutions : 0
% 0.23/0.56 % Disequality decompositions : 0
% 0.23/0.56 % Total rewrite steps : 322
% 0.23/0.56 % ...of those cached : 311
% 0.23/0.56 % Propositional unsat checks : 0
% 0.23/0.56 % Propositional check models : 0
% 0.23/0.56 % Propositional check unsatisfiable : 0
% 0.23/0.56 % Propositional clauses : 0
% 0.23/0.56 % Propositional clauses after purity: 0
% 0.23/0.56 % Propositional unsat core size : 0
% 0.23/0.56 % Propositional preprocessing time : 0.000
% 0.23/0.56 % Propositional encoding time : 0.000
% 0.23/0.56 % Propositional solver time : 0.000
% 0.23/0.56 % Success case prop preproc time : 0.000
% 0.23/0.56 % Success case prop encoding time : 0.000
% 0.23/0.56 % Success case prop solver time : 0.000
% 0.23/0.56 % Current number of processed clauses : 154
% 0.23/0.56 % Positive orientable unit clauses : 7
% 0.23/0.56 % Positive unorientable unit clauses: 0
% 0.23/0.56 % Negative unit clauses : 12
% 0.23/0.56 % Non-unit-clauses : 135
% 0.23/0.56 % Current number of unprocessed clauses: 370
% 0.23/0.56 % ...number of literals in the above : 1783
% 0.23/0.56 % Current number of archived formulas : 0
% 0.23/0.56 % Current number of archived clauses : 59
% 0.23/0.56 % Clause-clause subsumption calls (NU) : 5468
% 0.23/0.56 % Rec. Clause-clause subsumption calls : 2174
% 0.23/0.56 % Non-unit clause-clause subsumptions : 113
% 0.23/0.56 % Unit Clause-clause subsumption calls : 89
% 0.23/0.56 % Rewrite failures with RHS unbound : 0
% 0.23/0.56 % BW rewrite match attempts : 14
% 0.23/0.56 % BW rewrite match successes : 1
% 0.23/0.56 % Condensation attempts : 0
% 0.23/0.56 % Condensation successes : 0
% 0.23/0.56 % Termbank termtop insertions : 16411
% 0.23/0.56 % Search garbage collected termcells : 48
% 0.23/0.56
% 0.23/0.56 % -------------------------------------------------
% 0.23/0.56 % User time : 0.025 s
% 0.23/0.56 % System time : 0.003 s
% 0.23/0.56 % Total time : 0.027 s
% 0.23/0.56 % Maximum resident set size: 3640 pages
% 0.23/0.56
% 0.23/0.56 % -------------------------------------------------
% 0.23/0.56 % User time : 0.026 s
% 0.23/0.56 % System time : 0.010 s
% 0.23/0.56 % Total time : 0.035 s
% 0.23/0.56 % Maximum resident set size: 4864 pages
% 0.23/0.56 % E exiting
%------------------------------------------------------------------------------