TSTP Solution File: GRP128-1.003 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP128-1.003 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:57:04 EDT 2024
% Result : Unsatisfiable 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 14
% Syntax : Number of clauses : 99 ( 34 unt; 48 nHn; 99 RR)
% Number of literals : 245 ( 0 equ; 80 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 81 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',product_total_function1) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',element_3) ).
cnf(qg3,negated_conjecture,
( product(X1,X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X3,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',qg3) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',element_1) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',element_2) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',product_right_cancellation) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',e_1_is_not_e_3) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',e_1_is_not_e_2) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',e_2_is_not_e_3) ).
cnf(product_total_function2,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',product_total_function2) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',product_left_cancellation) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',e_3_is_not_e_1) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',e_3_is_not_e_2) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p',e_2_is_not_e_1) ).
cnf(c_0_14,plain,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_15,plain,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
c_0_14 ).
cnf(c_0_16,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_17,negated_conjecture,
( product(X1,X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X3,X2,X4) ),
inference(fof_simplification,[status(thm)],[qg3]) ).
cnf(c_0_18,plain,
( 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_15,c_0_16]) ).
cnf(c_0_19,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_20,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_21,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_22,negated_conjecture,
( product(X1,X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X3,X2,X4) ),
c_0_17 ).
cnf(c_0_23,plain,
( product(e_1,e_3,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( 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_15,c_0_20]) ).
cnf(c_0_25,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| product(X1,e_1,e_1)
| ~ product(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_28,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_29,plain,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| equalish(X1,e_3)
| ~ product(e_1,X1,e_1) ),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( product(e_1,e_1,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_31,plain,
~ equalish(e_1,e_3),
c_0_27 ).
cnf(c_0_32,negated_conjecture,
( product(e_1,e_2,e_3)
| product(e_1,e_2,e_2)
| product(X1,e_1,e_1)
| ~ product(X1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_22,c_0_28]) ).
cnf(c_0_33,plain,
~ equalish(e_1,e_2),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_2]) ).
cnf(c_0_34,negated_conjecture,
( product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_35,plain,
( product(e_1,e_2,e_3)
| product(e_1,e_2,e_2)
| equalish(X1,e_2)
| ~ product(e_1,X1,e_1) ),
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( product(e_1,e_1,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_37,plain,
~ equalish(e_1,e_2),
c_0_33 ).
cnf(c_0_38,plain,
~ equalish(e_2,e_3),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_3]) ).
cnf(c_0_39,plain,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[product_total_function2]) ).
cnf(c_0_40,negated_conjecture,
( product(e_1,e_3,e_2)
| equalish(X1,e_3)
| ~ product(e_1,X1,e_3) ),
inference(spm,[status(thm)],[c_0_25,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( product(e_1,e_2,e_2)
| product(e_1,e_2,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_42,plain,
~ equalish(e_2,e_3),
c_0_38 ).
cnf(c_0_43,plain,
( product(e_3,e_2,e_1)
| product(e_3,e_2,e_2)
| product(e_3,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_44,plain,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
c_0_39 ).
cnf(c_0_45,negated_conjecture,
( product(e_1,e_2,e_2)
| product(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( product(e_3,e_2,e_3)
| product(e_3,e_2,e_2)
| product(X1,e_3,e_1)
| ~ product(X1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_22,c_0_43]) ).
cnf(c_0_47,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_48,plain,
( product(e_3,e_3,e_1)
| product(e_3,e_3,e_2)
| product(e_3,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_49,negated_conjecture,
( product(e_1,e_2,e_2)
| equalish(X1,e_2)
| ~ product(e_1,e_3,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
( product(e_1,e_2,e_2)
| product(e_1,e_3,e_1)
| product(e_3,e_2,e_2)
| product(e_3,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_46,c_0_41]) ).
cnf(c_0_51,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
c_0_47 ).
cnf(c_0_52,plain,
( product(e_3,e_3,e_3)
| product(e_3,e_3,e_2)
| equalish(X1,e_3)
| ~ product(e_3,X1,e_1) ),
inference(spm,[status(thm)],[c_0_25,c_0_48]) ).
cnf(c_0_53,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_54,negated_conjecture,
( product(e_3,e_2,e_3)
| product(e_3,e_2,e_2)
| product(e_1,e_2,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_37]) ).
cnf(c_0_55,negated_conjecture,
( product(e_1,e_3,e_2)
| equalish(X1,e_1)
| ~ product(X1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_51,c_0_34]) ).
cnf(c_0_56,plain,
( product(e_3,e_2,e_3)
| product(e_3,e_2,e_2)
| product(e_3,e_3,e_2)
| product(e_3,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_43]),c_0_42]) ).
cnf(c_0_57,plain,
~ equalish(e_3,e_1),
c_0_53 ).
cnf(c_0_58,plain,
~ equalish(e_3,e_2),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_2]) ).
cnf(c_0_59,negated_conjecture,
( product(e_3,e_2,e_2)
| product(e_3,e_2,e_3)
| equalish(X1,e_2)
| ~ product(e_1,X1,e_2) ),
inference(spm,[status(thm)],[c_0_25,c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( product(e_3,e_3,e_2)
| product(e_3,e_2,e_2)
| product(e_3,e_2,e_3)
| product(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_61,plain,
~ equalish(e_3,e_2),
c_0_58 ).
cnf(c_0_62,negated_conjecture,
( product(e_3,e_3,e_2)
| product(e_3,e_2,e_3)
| product(e_3,e_2,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).
cnf(c_0_63,negated_conjecture,
( product(e_3,e_2,e_2)
| product(e_3,e_2,e_3)
| product(X1,e_1,e_2)
| ~ product(X1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_22,c_0_54]) ).
cnf(c_0_64,negated_conjecture,
( product(e_3,e_2,e_2)
| product(e_3,e_2,e_3)
| equalish(X1,e_3)
| ~ product(e_3,X1,e_2) ),
inference(spm,[status(thm)],[c_0_25,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
( product(e_3,e_1,e_2)
| product(e_3,e_2,e_3)
| product(e_3,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_63,c_0_43]) ).
cnf(c_0_66,negated_conjecture,
( product(e_3,e_2,e_3)
| product(e_3,e_2,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_31]) ).
cnf(c_0_67,negated_conjecture,
( product(e_3,e_2,e_2)
| product(X1,e_3,e_3)
| ~ product(X1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_22,c_0_66]) ).
cnf(c_0_68,negated_conjecture,
( product(e_3,e_2,e_2)
| equalish(X1,e_2)
| ~ product(e_3,X1,e_3) ),
inference(spm,[status(thm)],[c_0_25,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
( product(e_3,e_3,e_3)
| product(e_3,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_67,c_0_66]) ).
cnf(c_0_70,negated_conjecture,
( product(e_3,e_3,e_3)
| product(e_3,e_3,e_2)
| product(X1,e_3,e_1)
| ~ product(X1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_22,c_0_48]) ).
cnf(c_0_71,negated_conjecture,
product(e_3,e_2,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_61]) ).
cnf(c_0_72,plain,
( product(e_3,e_3,e_3)
| product(e_3,e_3,e_2)
| equalish(X1,e_3)
| ~ product(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_51,c_0_48]) ).
cnf(c_0_73,negated_conjecture,
( product(e_1,e_3,e_2)
| product(e_1,e_3,e_1)
| product(e_3,e_3,e_2)
| product(e_3,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_70,c_0_34]) ).
cnf(c_0_74,negated_conjecture,
( equalish(X1,e_2)
| ~ product(e_3,X1,e_2) ),
inference(spm,[status(thm)],[c_0_25,c_0_71]) ).
cnf(c_0_75,negated_conjecture,
( product(e_1,e_3,e_2)
| product(e_3,e_3,e_2)
| product(e_3,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_31]) ).
cnf(c_0_76,negated_conjecture,
~ product(e_3,e_3,e_2),
inference(spm,[status(thm)],[c_0_61,c_0_74]) ).
cnf(c_0_77,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_78,negated_conjecture,
( product(e_3,e_3,e_3)
| product(e_3,e_3,e_2)
| product(X1,e_1,e_2)
| ~ product(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_22,c_0_75]) ).
cnf(c_0_79,plain,
( product(e_3,e_3,e_3)
| product(e_3,e_3,e_1) ),
inference(sr,[status(thm)],[c_0_48,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
~ product(e_3,e_1,e_2),
inference(spm,[status(thm)],[c_0_37,c_0_74]) ).
cnf(c_0_81,negated_conjecture,
( product(e_2,e_3,e_3)
| product(e_2,e_3,e_2)
| product(X1,e_2,e_1)
| ~ product(X1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_22,c_0_77]) ).
cnf(c_0_82,negated_conjecture,
product(e_3,e_3,e_3),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_76]),c_0_80]) ).
cnf(c_0_83,negated_conjecture,
( product(e_1,e_2,e_2)
| equalish(X1,e_3)
| ~ product(e_1,e_2,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_41]) ).
cnf(c_0_84,negated_conjecture,
( product(e_1,e_2,e_2)
| product(e_1,e_2,e_1)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_81,c_0_45]) ).
cnf(c_0_85,negated_conjecture,
( equalish(X1,e_3)
| ~ product(X1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_51,c_0_71]) ).
cnf(c_0_86,plain,
~ equalish(e_2,e_1),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_1]) ).
cnf(c_0_87,negated_conjecture,
product(e_1,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_82]),c_0_57]) ).
cnf(c_0_88,negated_conjecture,
( product(e_2,e_3,e_3)
| product(e_2,e_3,e_2)
| product(e_1,e_2,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_31]) ).
cnf(c_0_89,negated_conjecture,
~ product(e_1,e_2,e_2),
inference(spm,[status(thm)],[c_0_31,c_0_85]) ).
cnf(c_0_90,plain,
~ equalish(e_2,e_1),
c_0_86 ).
cnf(c_0_91,negated_conjecture,
( equalish(X1,e_1)
| ~ product(X1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_51,c_0_87]) ).
cnf(c_0_92,negated_conjecture,
( equalish(X1,e_3)
| ~ product(X1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_51,c_0_82]) ).
cnf(c_0_93,negated_conjecture,
( product(e_2,e_3,e_2)
| product(e_2,e_3,e_3)
| equalish(X1,e_2)
| ~ product(e_1,X1,e_2) ),
inference(spm,[status(thm)],[c_0_25,c_0_88]) ).
cnf(c_0_94,negated_conjecture,
( product(X1,e_3,e_2)
| ~ product(X1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_22,c_0_71]) ).
cnf(c_0_95,negated_conjecture,
product(e_1,e_2,e_3),
inference(sr,[status(thm)],[c_0_41,c_0_89]) ).
cnf(c_0_96,negated_conjecture,
~ product(e_2,e_3,e_2),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_97,negated_conjecture,
~ product(e_2,e_3,e_3),
inference(spm,[status(thm)],[c_0_42,c_0_92]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95])]),c_0_96]),c_0_97]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP128-1.003 : TPTP v8.1.2. Released v1.2.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 16:23:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Utkq9SuUnz/E---3.1_18728.p
% 0.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18860 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.51 # Starting sh5l with 136s (1) cores
% 0.19/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18865 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.51 # Preprocessing time : 0.001 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Unsatisfiable
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 14
% 0.19/0.51 # Removed by relevancy pruning/SinE : 0
% 0.19/0.51 # Initial clauses : 14
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 14
% 0.19/0.51 # Processed clauses : 313
% 0.19/0.51 # ...of these trivial : 7
% 0.19/0.51 # ...subsumed : 87
% 0.19/0.51 # ...remaining for further processing : 219
% 0.19/0.51 # Other redundant clauses eliminated : 0
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 65
% 0.19/0.51 # Backward-rewritten : 31
% 0.19/0.51 # Generated clauses : 622
% 0.19/0.51 # ...of the previous two non-redundant : 603
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 0
% 0.19/0.51 # Paramodulations : 594
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 0
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 49
% 0.19/0.51 # ...of those cached : 42
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 81
% 0.19/0.51 # Positive orientable unit clauses : 10
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 22
% 0.19/0.51 # Non-unit-clauses : 49
% 0.19/0.51 # Current number of unprocessed clauses: 279
% 0.19/0.51 # ...number of literals in the above : 1239
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 138
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 1712
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 727
% 0.19/0.51 # Non-unit clause-clause subsumptions : 136
% 0.19/0.51 # Unit Clause-clause subsumption calls : 220
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 15
% 0.19/0.51 # BW rewrite match successes : 6
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 9642
% 0.19/0.51 # Search garbage collected termcells : 36
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.026 s
% 0.19/0.51 # System time : 0.001 s
% 0.19/0.51 # Total time : 0.027 s
% 0.19/0.51 # Maximum resident set size: 1660 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.128 s
% 0.19/0.51 # System time : 0.008 s
% 0.19/0.51 # Total time : 0.136 s
% 0.19/0.51 # Maximum resident set size: 1696 pages
% 0.19/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------