TSTP Solution File: GRP124-1.004 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP124-1.004 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:56:41 EDT 2024
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 19
% Syntax : Number of clauses : 100 ( 45 unt; 33 nHn; 98 RR)
% Number of literals : 229 ( 0 equ; 94 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 : 71 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',product_total_function1) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',product_right_cancellation) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',element_4) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',product_left_cancellation) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',product_idempotence) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',element_1) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',e_4_is_not_e_1) ).
cnf(qg2_2,negated_conjecture,
( equalish(X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X1,X2)
| ~ product(X6,X4,X5) ),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',qg2_2) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',e_1_is_not_e_4) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',e_3_is_not_e_1) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',element_3) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',e_3_is_not_e_4) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',e_1_is_not_e_3) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',element_2) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',e_2_is_not_e_1) ).
cnf(e_4_is_not_e_2,axiom,
~ equalish(e_4,e_2),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',e_4_is_not_e_2) ).
cnf(e_2_is_not_e_4,axiom,
~ equalish(e_2,e_4),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',e_2_is_not_e_4) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',e_4_is_not_e_3) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox/tmp/tmp.4sXjKY2Z2N/E---3.1_10729.p',e_1_is_not_e_2) ).
cnf(c_0_19,plain,
( 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) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_20,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_21,plain,
( 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) ),
c_0_19 ).
cnf(c_0_22,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_23,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_24,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
c_0_20 ).
cnf(c_0_25,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_26,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_21,c_0_22]) ).
cnf(c_0_27,axiom,
group_element(e_1),
element_1 ).
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,negated_conjecture,
( equalish(X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X1,X2)
| ~ product(X6,X4,X5) ),
inference(fof_simplification,[status(thm)],[qg2_2]) ).
cnf(c_0_30,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
c_0_23 ).
cnf(c_0_31,plain,
( equalish(X1,X2)
| ~ product(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
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_26,c_0_27]) ).
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,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_21,c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( equalish(X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X1,X2)
| ~ product(X6,X4,X5) ),
c_0_29 ).
cnf(c_0_37,plain,
( equalish(X1,X2)
| ~ product(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
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,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
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_35,c_0_22]) ).
cnf(c_0_42,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_43,negated_conjecture,
( equalish(X1,X2)
| ~ product(X2,X3,X1)
| ~ product(X2,X2,X4)
| ~ product(X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_36,c_0_25]) ).
cnf(c_0_44,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_37,c_0_38]),c_0_39]) ).
cnf(c_0_45,plain,
~ equalish(e_3,e_1),
c_0_40 ).
cnf(c_0_46,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_37,c_0_41]),c_0_33]) ).
cnf(c_0_47,plain,
~ equalish(e_3,e_4),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_4]) ).
cnf(c_0_48,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_21,c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( product(e_1,e_4,e_2)
| ~ product(e_1,e_1,X1)
| ~ product(e_4,e_3,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_50,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_46]),c_0_39]) ).
cnf(c_0_51,plain,
~ equalish(e_3,e_4),
c_0_47 ).
cnf(c_0_52,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_48,c_0_27]) ).
cnf(c_0_53,negated_conjecture,
( product(e_1,e_4,e_2)
| ~ product(e_4,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_49,c_0_25]) ).
cnf(c_0_54,negated_conjecture,
( product(e_4,e_1,e_2)
| ~ product(e_4,e_4,X1)
| ~ product(e_1,e_3,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_50]),c_0_51]) ).
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_31,c_0_52]),c_0_45]) ).
cnf(c_0_56,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_57,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_58,plain,
~ equalish(e_2,e_1),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_1]) ).
cnf(c_0_59,negated_conjecture,
( equalish(X1,e_4)
| ~ product(e_4,e_3,e_1)
| ~ product(e_1,X1,e_2) ),
inference(spm,[status(thm)],[c_0_24,c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( product(e_1,e_3,e_2)
| product(e_1,e_3,e_3)
| product(e_4,e_1,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_25])]) ).
cnf(c_0_61,plain,
~ equalish(e_1,e_3),
c_0_56 ).
cnf(c_0_62,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_3)
| product(e_2,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_35,c_0_57]) ).
cnf(c_0_63,plain,
~ equalish(e_2,e_1),
c_0_58 ).
cnf(c_0_64,plain,
~ equalish(e_4,e_2),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_2]) ).
cnf(c_0_65,negated_conjecture,
( ~ product(e_4,e_3,e_1)
| ~ product(e_1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_51,c_0_59]) ).
cnf(c_0_66,negated_conjecture,
( product(e_4,e_1,e_2)
| product(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_60]),c_0_61]) ).
cnf(c_0_67,plain,
( product(e_2,e_1,e_4)
| product(e_2,e_1,e_3)
| product(e_2,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_62]),c_0_63]) ).
cnf(c_0_68,plain,
~ equalish(e_4,e_2),
c_0_64 ).
cnf(c_0_69,plain,
~ equalish(e_2,e_4),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_4]) ).
cnf(c_0_70,negated_conjecture,
( product(e_4,e_1,e_2)
| ~ product(e_4,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,negated_conjecture,
( product(e_2,e_1,e_2)
| product(e_2,e_1,e_3)
| ~ product(e_2,e_2,X1)
| ~ product(e_1,e_4,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_67]),c_0_68]) ).
cnf(c_0_72,plain,
~ equalish(e_2,e_4),
c_0_69 ).
cnf(c_0_73,negated_conjecture,
( equalish(X1,e_4)
| ~ product(e_4,e_3,e_1)
| ~ product(X1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_30,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( product(e_2,e_1,e_3)
| product(e_2,e_1,e_2)
| ~ product(e_1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_71,c_0_25]) ).
cnf(c_0_75,negated_conjecture,
( ~ product(e_4,e_3,e_1)
| ~ product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
( product(e_2,e_1,e_3)
| ~ product(e_4,e_3,e_1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_53]),c_0_75]) ).
cnf(c_0_77,plain,
( product(e_4,e_3,e_1)
| product(e_4,e_3,e_2)
| product(e_4,e_3,e_3)
| product(e_4,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_48,c_0_22]) ).
cnf(c_0_78,negated_conjecture,
( product(e_4,e_3,e_4)
| product(e_4,e_3,e_3)
| product(e_4,e_3,e_2)
| product(e_2,e_1,e_3) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_79,plain,
~ equalish(e_4,e_3),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_3]) ).
cnf(c_0_80,negated_conjecture,
( product(e_2,e_1,e_3)
| product(e_4,e_3,e_2)
| product(e_4,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_78]),c_0_51]) ).
cnf(c_0_81,plain,
~ equalish(e_4,e_3),
c_0_79 ).
cnf(c_0_82,plain,
~ equalish(e_1,e_2),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_2]) ).
cnf(c_0_83,negated_conjecture,
( product(e_4,e_3,e_2)
| product(e_2,e_1,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_80]),c_0_81]) ).
cnf(c_0_84,negated_conjecture,
( product(e_4,e_1,e_2)
| equalish(X1,e_1)
| ~ product(X1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_30,c_0_66]) ).
cnf(c_0_85,plain,
( product(e_2,e_4,e_1)
| product(e_2,e_4,e_2)
| product(e_2,e_4,e_3)
| product(e_2,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_26,c_0_57]) ).
cnf(c_0_86,plain,
~ equalish(e_1,e_2),
c_0_82 ).
cnf(c_0_87,negated_conjecture,
( product(e_2,e_1,e_3)
| equalish(X1,e_3)
| ~ product(e_4,X1,e_2) ),
inference(spm,[status(thm)],[c_0_24,c_0_83]) ).
cnf(c_0_88,negated_conjecture,
( product(e_2,e_1,e_3)
| product(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_83]),c_0_33]) ).
cnf(c_0_89,negated_conjecture,
( product(e_2,e_4,e_4)
| product(e_2,e_4,e_3)
| product(e_2,e_4,e_2)
| ~ product(e_2,e_2,X1)
| ~ product(e_4,e_1,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_85]),c_0_86]) ).
cnf(c_0_90,plain,
( product(e_4,e_1,e_2)
| equalish(X1,e_4)
| ~ product(X1,e_1,e_3) ),
inference(spm,[status(thm)],[c_0_30,c_0_50]) ).
cnf(c_0_91,negated_conjecture,
product(e_2,e_1,e_3),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_61]) ).
cnf(c_0_92,negated_conjecture,
( product(e_2,e_4,e_2)
| product(e_2,e_4,e_3)
| product(e_2,e_4,e_4)
| ~ product(e_4,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_89,c_0_25]) ).
cnf(c_0_93,negated_conjecture,
product(e_4,e_1,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_72]) ).
cnf(c_0_94,negated_conjecture,
( equalish(X1,e_1)
| ~ product(e_2,X1,e_3) ),
inference(spm,[status(thm)],[c_0_24,c_0_91]) ).
cnf(c_0_95,negated_conjecture,
( product(e_2,e_4,e_4)
| product(e_2,e_4,e_3)
| product(e_2,e_4,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93])]) ).
cnf(c_0_96,negated_conjecture,
~ product(e_2,e_4,e_3),
inference(spm,[status(thm)],[c_0_33,c_0_94]) ).
cnf(c_0_97,negated_conjecture,
( product(e_2,e_4,e_2)
| product(e_2,e_4,e_4) ),
inference(sr,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_98,negated_conjecture,
product(e_2,e_4,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_97]),c_0_72]) ).
cnf(c_0_99,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_98]),c_0_68]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP124-1.004 : TPTP v8.1.2. Released v1.2.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n010.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Fri May 3 16:08:37 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.4sXjKY2Z2N/E---3.1_10729.p
% 0.15/0.44 # Version: 3.1.0
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10806 completed with status 0
% 0.15/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # No SInE strategy applied
% 0.15/0.44 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.15/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.44 # Starting sh5l with 136s (1) cores
% 0.15/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10811 completed with status 0
% 0.15/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # No SInE strategy applied
% 0.15/0.44 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.15/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.44 # Preprocessing time : 0.001 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Unsatisfiable
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 23
% 0.15/0.44 # Removed by relevancy pruning/SinE : 0
% 0.15/0.44 # Initial clauses : 23
% 0.15/0.44 # Removed in clause preprocessing : 0
% 0.15/0.44 # Initial clauses in saturation : 23
% 0.15/0.44 # Processed clauses : 348
% 0.15/0.44 # ...of these trivial : 0
% 0.15/0.44 # ...subsumed : 70
% 0.15/0.44 # ...remaining for further processing : 278
% 0.15/0.44 # Other redundant clauses eliminated : 0
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 58
% 0.15/0.44 # Backward-rewritten : 29
% 0.15/0.44 # Generated clauses : 721
% 0.15/0.44 # ...of the previous two non-redundant : 629
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 4
% 0.15/0.44 # Paramodulations : 719
% 0.15/0.44 # Factorizations : 0
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 0
% 0.15/0.44 # Disequality decompositions : 0
% 0.15/0.44 # Total rewrite steps : 130
% 0.15/0.44 # ...of those cached : 118
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 166
% 0.15/0.44 # Positive orientable unit clauses : 9
% 0.15/0.44 # Positive unorientable unit clauses: 0
% 0.15/0.44 # Negative unit clauses : 20
% 0.15/0.44 # Non-unit-clauses : 137
% 0.15/0.44 # Current number of unprocessed clauses: 285
% 0.15/0.44 # ...number of literals in the above : 1489
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 112
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 4497
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 2306
% 0.15/0.44 # Non-unit clause-clause subsumptions : 108
% 0.15/0.44 # Unit Clause-clause subsumption calls : 417
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 26
% 0.15/0.44 # BW rewrite match successes : 3
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 11937
% 0.15/0.44 # Search garbage collected termcells : 57
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.026 s
% 0.15/0.44 # System time : 0.003 s
% 0.15/0.44 # Total time : 0.029 s
% 0.15/0.44 # Maximum resident set size: 1644 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.133 s
% 0.15/0.44 # System time : 0.008 s
% 0.15/0.44 # Total time : 0.141 s
% 0.15/0.44 # Maximum resident set size: 1700 pages
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------