TSTP Solution File: GRP124-4.004 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP124-4.004 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:38:09 EDT 2023
% Result : Unsatisfiable 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 23
% Syntax : Number of clauses : 110 ( 39 unt; 33 nHn; 108 RR)
% Number of literals : 264 ( 0 equ; 119 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 : 72 ( 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/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',product_total_function1) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',element_4) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',product_right_cancellation) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',product_idempotence) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',element_1) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',product_left_cancellation) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.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/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',qg2_2) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',e_1_is_not_e_4) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',e_3_is_not_e_1) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',e_2_is_not_e_1) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',element_3) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',e_3_is_not_e_4) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',e_4_is_not_e_3) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',e_2_is_not_e_3) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',element_2) ).
cnf(e_2_is_not_e_4,axiom,
~ equalish(e_2,e_4),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',e_2_is_not_e_4) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',e_1_is_not_e_3) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',e_1_is_not_e_2) ).
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.YbBm7ZQ7sb/E---3.1_20154.p',column_surjectivity) ).
cnf(e_4_is_not_e_2,axiom,
~ equalish(e_4,e_2),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',e_4_is_not_e_2) ).
cnf(product_total_function2,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',product_total_function2) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox2/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p',e_3_is_not_e_2) ).
cnf(c_0_23,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_24,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_25,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
product_right_cancellation ).
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_4,e_3)
| product(X1,e_4,e_2)
| product(X1,e_4,e_1)
| ~ 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,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
product_left_cancellation ).
cnf(c_0_30,plain,
( equalish(X1,X2)
| ~ product(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,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_28]) ).
cnf(c_0_32,axiom,
~ equalish(e_4,e_1),
e_4_is_not_e_1 ).
cnf(c_0_33,negated_conjecture,
( equalish(X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X1,X2)
| ~ product(X6,X4,X5) ),
qg2_2 ).
cnf(c_0_34,plain,
( equalish(X1,X2)
| ~ product(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_35,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_30,c_0_31]),c_0_32]) ).
cnf(c_0_36,axiom,
~ equalish(e_1,e_4),
e_1_is_not_e_4 ).
cnf(c_0_37,negated_conjecture,
( equalish(X1,X2)
| ~ product(X2,X3,X1)
| ~ product(X2,X2,X4)
| ~ product(X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_33,c_0_26]) ).
cnf(c_0_38,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_34,c_0_35]),c_0_36]) ).
cnf(c_0_39,axiom,
~ equalish(e_3,e_1),
e_3_is_not_e_1 ).
cnf(c_0_40,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_37,c_0_38]),c_0_39]) ).
cnf(c_0_41,negated_conjecture,
( product(e_1,e_4,e_2)
| ~ product(e_4,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_40,c_0_26]) ).
cnf(c_0_42,axiom,
~ equalish(e_2,e_1),
e_2_is_not_e_1 ).
cnf(c_0_43,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_44,negated_conjecture,
( ~ product(e_4,e_3,e_1)
| ~ product(e_1,e_1,X1)
| ~ product(e_4,e_2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_41]),c_0_42]) ).
cnf(c_0_45,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_23,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( ~ product(e_4,e_3,e_1)
| ~ product(e_4,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_44,c_0_26]) ).
cnf(c_0_47,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_45,c_0_24]) ).
cnf(c_0_48,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_4,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,axiom,
~ equalish(e_3,e_4),
e_3_is_not_e_4 ).
cnf(c_0_50,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_45,c_0_28]) ).
cnf(c_0_51,negated_conjecture,
( product(e_4,e_3,e_2)
| product(e_4,e_3,e_3)
| ~ product(e_4,e_2,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_48]),c_0_49]) ).
cnf(c_0_52,axiom,
~ equalish(e_4,e_3),
e_4_is_not_e_3 ).
cnf(c_0_53,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_30,c_0_50]),c_0_39]) ).
cnf(c_0_54,negated_conjecture,
( equalish(X1,e_1)
| ~ product(e_4,e_3,e_1)
| ~ product(X1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_29,c_0_41]) ).
cnf(c_0_55,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_23,c_0_28]) ).
cnf(c_0_56,negated_conjecture,
( product(e_4,e_3,e_2)
| ~ product(e_4,e_2,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_51]),c_0_52]) ).
cnf(c_0_57,axiom,
~ equalish(e_2,e_3),
e_2_is_not_e_3 ).
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_25,c_0_53]) ).
cnf(c_0_59,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_60,axiom,
~ equalish(e_2,e_4),
e_2_is_not_e_4 ).
cnf(c_0_61,plain,
( equalish(X1,e_4)
| product(e_1,e_4,e_2)
| ~ product(e_1,X1,e_3) ),
inference(spm,[status(thm)],[c_0_25,c_0_38]) ).
cnf(c_0_62,negated_conjecture,
( ~ product(e_4,e_3,e_1)
| ~ product(e_3,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_39,c_0_54]) ).
cnf(c_0_63,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_55,c_0_24]) ).
cnf(c_0_64,negated_conjecture,
( equalish(X1,e_4)
| ~ product(e_4,e_2,e_1)
| ~ product(X1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_29,c_0_56]) ).
cnf(c_0_65,plain,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| ~ product(e_1,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_66,axiom,
~ equalish(e_1,e_3),
e_1_is_not_e_3 ).
cnf(c_0_67,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_23,c_0_59]) ).
cnf(c_0_68,plain,
( product(e_1,e_4,e_2)
| ~ product(e_1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,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_3,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_62,c_0_47]) ).
cnf(c_0_70,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_34,c_0_63]),c_0_32]) ).
cnf(c_0_71,negated_conjecture,
( ~ product(e_4,e_2,e_1)
| ~ product(e_1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_36,c_0_64]) ).
cnf(c_0_72,plain,
( product(e_1,e_3,e_2)
| ~ product(e_1,e_2,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_65]),c_0_66]) ).
cnf(c_0_73,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_67,c_0_28]) ).
cnf(c_0_74,negated_conjecture,
( ~ product(e_1,e_2,e_3)
| ~ product(e_1,e_1,X1)
| ~ product(e_4,e_2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_68]),c_0_42]) ).
cnf(c_0_75,negated_conjecture,
( product(e_4,e_3,e_2)
| product(e_4,e_3,e_3)
| ~ product(e_3,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_69]),c_0_49]) ).
cnf(c_0_76,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_30,c_0_70]),c_0_36]) ).
cnf(c_0_77,negated_conjecture,
( ~ product(e_4,e_2,e_1)
| ~ product(e_1,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_78,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_30,c_0_73]),c_0_42]) ).
cnf(c_0_79,negated_conjecture,
( ~ product(e_1,e_2,e_3)
| ~ product(e_4,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_74,c_0_26]) ).
cnf(c_0_80,negated_conjecture,
( product(e_4,e_3,e_2)
| ~ product(e_3,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_75]),c_0_52]) ).
cnf(c_0_81,plain,
( equalish(X1,e_1)
| product(e_4,e_1,e_2)
| ~ product(e_4,X1,e_3) ),
inference(spm,[status(thm)],[c_0_25,c_0_76]) ).
cnf(c_0_82,negated_conjecture,
( product(e_1,e_2,e_2)
| ~ product(e_4,e_2,e_1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]) ).
cnf(c_0_83,axiom,
~ equalish(e_1,e_2),
e_1_is_not_e_2 ).
cnf(c_0_84,negated_conjecture,
( equalish(X1,e_4)
| ~ product(e_3,e_4,e_2)
| ~ product(X1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_29,c_0_80]) ).
cnf(c_0_85,plain,
( product(e_4,e_1,e_2)
| ~ product(e_4,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_42,c_0_81]) ).
cnf(c_0_86,plain,
( product(e_4,e_2,e_1)
| product(e_4,e_2,e_2)
| product(e_4,e_2,e_3)
| product(e_4,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_67,c_0_24]) ).
cnf(c_0_87,negated_conjecture,
~ product(e_4,e_2,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_82]),c_0_83]) ).
cnf(c_0_88,negated_conjecture,
( ~ product(e_3,e_4,e_2)
| ~ product(e_1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_36,c_0_84]) ).
cnf(c_0_89,plain,
( equalish(X1,e_1)
| ~ product(e_1,e_2,e_3)
| ~ product(X1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_29,c_0_68]) ).
cnf(c_0_90,plain,
( equalish(X1,e_4)
| ~ product(e_4,e_2,e_3)
| ~ product(X1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_29,c_0_85]) ).
cnf(c_0_91,plain,
( product(e_4,e_2,e_4)
| product(e_4,e_2,e_3)
| product(e_4,e_2,e_2) ),
inference(sr,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_92,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_93,negated_conjecture,
( ~ product(e_3,e_4,e_2)
| ~ product(e_1,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_88,c_0_72]) ).
cnf(c_0_94,plain,
( ~ product(e_1,e_2,e_3)
| ~ product(e_3,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_39,c_0_89]) ).
cnf(c_0_95,plain,
( ~ product(e_4,e_2,e_3)
| ~ product(e_3,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_49,c_0_90]) ).
cnf(c_0_96,plain,
( product(e_4,e_2,e_2)
| product(e_4,e_2,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_91]),c_0_60]) ).
cnf(c_0_97,plain,
( product(X1,e_4,e_2)
| product(X1,e_3,e_2)
| product(X1,e_2,e_2)
| product(X1,e_1,e_2)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_59]) ).
cnf(c_0_98,negated_conjecture,
( product(e_1,e_2,e_2)
| ~ product(e_3,e_4,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_78]),c_0_94]) ).
cnf(c_0_99,plain,
( product(e_4,e_2,e_2)
| ~ product(e_3,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_100,axiom,
~ equalish(e_4,e_2),
e_4_is_not_e_2 ).
cnf(c_0_101,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
product_total_function2 ).
cnf(c_0_102,plain,
( product(e_3,e_1,e_2)
| product(e_3,e_2,e_2)
| product(e_3,e_3,e_2)
| product(e_3,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_97,c_0_43]) ).
cnf(c_0_103,negated_conjecture,
~ product(e_3,e_4,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_98]),c_0_83]) ).
cnf(c_0_104,plain,
~ product(e_3,e_1,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_99]),c_0_100]) ).
cnf(c_0_105,plain,
( equalish(X1,X2)
| ~ product(X2,X2,X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_26]) ).
cnf(c_0_106,plain,
( product(e_3,e_3,e_2)
| product(e_3,e_2,e_2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_102,c_0_103]),c_0_104]) ).
cnf(c_0_107,plain,
product(e_3,e_2,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_57]) ).
cnf(c_0_108,axiom,
~ equalish(e_3,e_2),
e_3_is_not_e_2 ).
cnf(c_0_109,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_107]),c_0_108]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP124-4.004 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Oct 3 02:55:58 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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/tmp/tmp.YbBm7ZQ7sb/E---3.1_20154.p
% 0.19/0.52 # Version: 3.1pre001
% 0.19/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # sh5l with pid 20235 completed with status 0
% 0.19/0.52 # Result found by sh5l
% 0.19/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.52 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.52 # SAT001_MinMin_p005000_rr_RG with pid 20238 completed with status 0
% 0.19/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.52 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.52 # Preprocessing time : 0.001 s
% 0.19/0.52 # Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 # Proof found!
% 0.19/0.52 # SZS status Unsatisfiable
% 0.19/0.52 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 25
% 0.19/0.52 # Removed by relevancy pruning/SinE : 0
% 0.19/0.52 # Initial clauses : 25
% 0.19/0.52 # Removed in clause preprocessing : 0
% 0.19/0.52 # Initial clauses in saturation : 25
% 0.19/0.52 # Processed clauses : 722
% 0.19/0.52 # ...of these trivial : 0
% 0.19/0.52 # ...subsumed : 160
% 0.19/0.52 # ...remaining for further processing : 562
% 0.19/0.52 # Other redundant clauses eliminated : 0
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 286
% 0.19/0.52 # Backward-rewritten : 6
% 0.19/0.52 # Generated clauses : 1821
% 0.19/0.52 # ...of the previous two non-redundant : 1742
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 7
% 0.19/0.52 # Paramodulations : 1797
% 0.19/0.52 # Factorizations : 0
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 0
% 0.19/0.52 # Total rewrite steps : 70
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 221
% 0.19/0.52 # Positive orientable unit clauses : 8
% 0.19/0.52 # Positive unorientable unit clauses: 0
% 0.19/0.52 # Negative unit clauses : 26
% 0.19/0.52 # Non-unit-clauses : 187
% 0.19/0.52 # Current number of unprocessed clauses: 897
% 0.19/0.52 # ...number of literals in the above : 4555
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 341
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 11612
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 5500
% 0.19/0.52 # Non-unit clause-clause subsumptions : 175
% 0.19/0.52 # Unit Clause-clause subsumption calls : 1927
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 24
% 0.19/0.52 # BW rewrite match successes : 2
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 22887
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.048 s
% 0.19/0.52 # System time : 0.001 s
% 0.19/0.52 # Total time : 0.049 s
% 0.19/0.52 # Maximum resident set size: 1624 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.049 s
% 0.19/0.52 # System time : 0.003 s
% 0.19/0.52 # Total time : 0.052 s
% 0.19/0.52 # Maximum resident set size: 1728 pages
% 0.19/0.52 % E---3.1 exiting
% 0.19/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------