TSTP Solution File: GRP126-4.004 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP126-4.004 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:45:36 EDT 2023
% Result : Unsatisfiable 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 23
% Syntax : Number of clauses : 94 ( 32 unt; 47 nHn; 92 RR)
% Number of literals : 234 ( 0 equ; 69 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(column_surjectivity,axiom,
( product(X1,e_1,X2)
| product(X1,e_2,X2)
| product(X1,e_3,X2)
| product(X1,e_4,X2)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',column_surjectivity) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',element_4) ).
cnf(product_total_function2,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',product_total_function2) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',product_idempotence) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',element_1) ).
cnf(product_total_function1,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| product(X1,X2,e_4)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',product_total_function1) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',product_left_cancellation) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',e_4_is_not_e_1) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',product_right_cancellation) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',element_3) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',e_1_is_not_e_4) ).
cnf(qg4_1,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X3,X4,X2)
| ~ product(X2,X1,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',qg4_1) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',e_3_is_not_e_1) ).
cnf(qg4,negated_conjecture,
( product(X3,X4,X2)
| ~ product(X1,X2,X3)
| ~ product(X2,X1,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',qg4) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',e_2_is_not_e_3) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',e_1_is_not_e_3) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',e_3_is_not_e_4) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',element_2) ).
cnf(qg4_2,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X3,X1)
| ~ product(X2,X1,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',qg4_2) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',e_2_is_not_e_1) ).
cnf(e_2_is_not_e_4,axiom,
~ equalish(e_2,e_4),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',e_2_is_not_e_4) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',e_1_is_not_e_2) ).
cnf(e_4_is_not_e_2,axiom,
~ equalish(e_4,e_2),
file('/export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p',e_4_is_not_e_2) ).
cnf(c_0_23,axiom,
( product(X1,e_1,X2)
| product(X1,e_2,X2)
| product(X1,e_3,X2)
| product(X1,e_4,X2)
| ~ group_element(X1)
| ~ group_element(X2) ),
column_surjectivity ).
cnf(c_0_24,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_25,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
product_total_function2 ).
cnf(c_0_26,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_27,plain,
( product(X1,e_4,e_4)
| product(X1,e_3,e_4)
| product(X1,e_2,e_4)
| product(X1,e_1,e_4)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_29,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| product(X1,X2,e_4)
| ~ group_element(X1)
| ~ group_element(X2) ),
product_total_function1 ).
cnf(c_0_30,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
product_left_cancellation ).
cnf(c_0_31,plain,
( equalish(X1,X2)
| ~ product(X2,X2,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( product(e_1,e_1,e_4)
| product(e_1,e_2,e_4)
| product(e_1,e_3,e_4)
| product(e_1,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,axiom,
~ equalish(e_4,e_1),
e_4_is_not_e_1 ).
cnf(c_0_34,plain,
( product(X1,e_1,e_4)
| product(X1,e_1,e_3)
| product(X1,e_1,e_2)
| product(X1,e_1,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_35,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
product_right_cancellation ).
cnf(c_0_36,plain,
( product(X1,e_4,e_4)
| product(X1,e_4,e_3)
| product(X1,e_4,e_2)
| product(X1,e_4,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_37,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_38,plain,
( equalish(X1,X2)
| ~ product(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_39,plain,
( product(e_1,e_4,e_4)
| product(e_1,e_3,e_4)
| product(e_1,e_2,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_40,axiom,
~ equalish(e_1,e_4),
e_1_is_not_e_4 ).
cnf(c_0_41,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_34,c_0_24]) ).
cnf(c_0_42,plain,
( equalish(X1,X2)
| ~ product(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_26]) ).
cnf(c_0_43,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_36,c_0_28]) ).
cnf(c_0_44,plain,
( product(X1,e_3,e_4)
| product(X1,e_3,e_3)
| product(X1,e_3,e_2)
| product(X1,e_3,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X3,X4,X2)
| ~ product(X2,X1,X4) ),
qg4_1 ).
cnf(c_0_46,plain,
( product(e_1,e_2,e_4)
| product(e_1,e_3,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_47,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_38,c_0_41]),c_0_33]) ).
cnf(c_0_48,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_42,c_0_43]),c_0_33]) ).
cnf(c_0_49,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_44,c_0_28]) ).
cnf(c_0_50,axiom,
~ equalish(e_3,e_1),
e_3_is_not_e_1 ).
cnf(c_0_51,negated_conjecture,
( product(e_1,e_2,e_4)
| product(X1,e_4,e_1)
| ~ product(e_4,X1,e_3) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,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_42,c_0_47]),c_0_40]) ).
cnf(c_0_53,negated_conjecture,
( product(X3,X4,X2)
| ~ product(X1,X2,X3)
| ~ product(X2,X1,X4) ),
qg4 ).
cnf(c_0_54,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_38,c_0_48]),c_0_40]) ).
cnf(c_0_55,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_42,c_0_49]),c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( product(e_4,e_1,e_2)
| product(e_1,e_4,e_1)
| product(e_1,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( product(e_1,e_4,e_2)
| product(X1,e_3,e_1)
| ~ product(e_4,e_1,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
( equalish(X1,e_3)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3)
| ~ product(e_1,X1,e_4) ),
inference(spm,[status(thm)],[c_0_35,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( product(e_1,e_2,e_4)
| product(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_56]),c_0_33]) ).
cnf(c_0_60,axiom,
~ equalish(e_2,e_3),
e_2_is_not_e_3 ).
cnf(c_0_61,negated_conjecture,
( product(e_4,e_1,e_2)
| product(e_3,e_3,e_1)
| product(e_1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_57,c_0_52]) ).
cnf(c_0_62,negated_conjecture,
( product(e_4,e_1,e_2)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_63,axiom,
~ equalish(e_1,e_3),
e_1_is_not_e_3 ).
cnf(c_0_64,negated_conjecture,
( equalish(X1,e_4)
| product(e_3,e_3,e_1)
| product(e_4,e_1,e_2)
| ~ product(e_1,X1,e_2) ),
inference(spm,[status(thm)],[c_0_35,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( product(e_1,e_3,e_2)
| product(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_62]),c_0_63]) ).
cnf(c_0_66,axiom,
~ equalish(e_3,e_4),
e_3_is_not_e_4 ).
cnf(c_0_67,negated_conjecture,
( product(e_4,e_1,e_2)
| product(e_3,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_68,negated_conjecture,
( product(e_3,e_3,e_1)
| product(X1,e_2,e_4)
| ~ product(e_1,e_4,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_67]) ).
cnf(c_0_69,negated_conjecture,
( product(e_3,e_3,e_1)
| product(e_2,e_3,e_1)
| product(e_1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_57,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
( product(e_1,e_4,e_2)
| product(e_3,e_2,e_4)
| product(e_3,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_68,c_0_54]) ).
cnf(c_0_71,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_72,negated_conjecture,
( product(e_2,e_3,e_1)
| product(e_2,e_2,e_4)
| product(e_3,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,negated_conjecture,
( product(e_3,e_2,e_4)
| product(e_2,e_2,e_4)
| product(e_3,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_68,c_0_70]) ).
cnf(c_0_74,plain,
( product(X1,e_2,e_4)
| product(X1,e_2,e_3)
| product(X1,e_2,e_2)
| product(X1,e_2,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_71]) ).
cnf(c_0_75,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X3,X1)
| ~ product(X2,X1,X4) ),
qg4_2 ).
cnf(c_0_76,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_31,c_0_72]),c_0_63]) ).
cnf(c_0_77,negated_conjecture,
( equalish(X1,e_1)
| product(e_4,e_1,e_2)
| ~ product(X1,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_30,c_0_59]) ).
cnf(c_0_78,negated_conjecture,
( product(e_2,e_2,e_4)
| product(e_3,e_2,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_73]),c_0_63]) ).
cnf(c_0_79,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_74,c_0_28]) ).
cnf(c_0_80,axiom,
~ equalish(e_2,e_1),
e_2_is_not_e_1 ).
cnf(c_0_81,negated_conjecture,
( product(e_2,e_2,e_4)
| product(e_1,X1,e_3)
| ~ product(X1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_82,negated_conjecture,
( product(e_2,e_2,e_4)
| product(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_50]) ).
cnf(c_0_83,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_42,c_0_79]),c_0_80]) ).
cnf(c_0_84,negated_conjecture,
( product(e_1,e_4,e_3)
| product(e_2,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_85,plain,
( equalish(X1,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_3)
| ~ product(X1,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_30,c_0_83]) ).
cnf(c_0_86,negated_conjecture,
( equalish(X1,e_4)
| product(e_2,e_2,e_4)
| ~ product(e_1,X1,e_3) ),
inference(spm,[status(thm)],[c_0_35,c_0_84]) ).
cnf(c_0_87,negated_conjecture,
( product(e_2,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_85,c_0_78]),c_0_50]) ).
cnf(c_0_88,axiom,
~ equalish(e_2,e_4),
e_2_is_not_e_4 ).
cnf(c_0_89,negated_conjecture,
( product(e_1,e_2,e_2)
| product(e_2,e_2,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]) ).
cnf(c_0_90,axiom,
~ equalish(e_1,e_2),
e_1_is_not_e_2 ).
cnf(c_0_91,negated_conjecture,
product(e_2,e_2,e_4),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_89]),c_0_90]) ).
cnf(c_0_92,axiom,
~ equalish(e_4,e_2),
e_4_is_not_e_2 ).
cnf(c_0_93,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_91]),c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : GRP126-4.004 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n011.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Oct 3 03:02:08 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.lf5tj3cBZY/E---3.1_7534.p
% 0.16/0.46 # Version: 3.1pre001
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7612 completed with status 0
% 0.16/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.16/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.46 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.46 # Starting sh5l with 136s (1) cores
% 0.16/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7617 completed with status 0
% 0.16/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.16/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.46 # Preprocessing time : 0.001 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Unsatisfiable
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 26
% 0.16/0.46 # Removed by relevancy pruning/SinE : 0
% 0.16/0.46 # Initial clauses : 26
% 0.16/0.46 # Removed in clause preprocessing : 0
% 0.16/0.46 # Initial clauses in saturation : 26
% 0.16/0.46 # Processed clauses : 334
% 0.16/0.46 # ...of these trivial : 0
% 0.16/0.46 # ...subsumed : 65
% 0.16/0.46 # ...remaining for further processing : 269
% 0.16/0.46 # Other redundant clauses eliminated : 0
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 52
% 0.16/0.46 # Backward-rewritten : 30
% 0.16/0.46 # Generated clauses : 1080
% 0.16/0.46 # ...of the previous two non-redundant : 789
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 0
% 0.16/0.46 # Paramodulations : 1080
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 0
% 0.16/0.46 # Total rewrite steps : 314
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 161
% 0.16/0.46 # Positive orientable unit clauses : 7
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 12
% 0.16/0.46 # Non-unit-clauses : 142
% 0.16/0.46 # Current number of unprocessed clauses: 448
% 0.16/0.46 # ...number of literals in the above : 2014
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 108
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 7928
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 5075
% 0.16/0.46 # Non-unit clause-clause subsumptions : 117
% 0.16/0.46 # Unit Clause-clause subsumption calls : 54
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 15
% 0.16/0.46 # BW rewrite match successes : 1
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 17180
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.025 s
% 0.16/0.46 # System time : 0.001 s
% 0.16/0.46 # Total time : 0.026 s
% 0.16/0.46 # Maximum resident set size: 1636 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.122 s
% 0.16/0.46 # System time : 0.006 s
% 0.16/0.46 # Total time : 0.128 s
% 0.16/0.46 # Maximum resident set size: 1688 pages
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------