TSTP Solution File: GRP026-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP026-1 : TPTP v8.1.2. Bugfixed v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:46:58 EDT 2024
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 39
% Number of leaves : 28
% Syntax : Number of clauses : 120 ( 59 unt; 50 nHn; 120 RR)
% Number of literals : 272 ( 178 equ; 42 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 11 con; 0-1 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(all_of_group1,hypothesis,
( X1 = a
| X1 = b
| X1 = c
| ~ group_member(X1,g1) ),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',all_of_group1) ).
cnf(prove_product_holds_in_group2,negated_conjecture,
~ product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3)),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',prove_product_holds_in_group2) ).
cnf(d3_in_group1,hypothesis,
group_member(d3,g1),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',d3_in_group1) ).
cnf(a_maps_to_f,hypothesis,
an_isomorphism(a) = f,
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',a_maps_to_f) ).
cnf(d2_in_group1,hypothesis,
group_member(d2,g1),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',d2_in_group1) ).
cnf(d1_in_group1,hypothesis,
group_member(d1,g1),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',d1_in_group1) ).
cnf(f_times_f_is_f,hypothesis,
product(g2,f,f,f),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',f_times_f_is_f) ).
cnf(d1_times_d2_is_d3,hypothesis,
product(g1,d1,d2,d3),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',d1_times_d2_is_d3) ).
cnf(total_function2,axiom,
( X5 = X4
| ~ product(X1,X2,X3,X4)
| ~ product(X1,X2,X3,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',total_function2) ).
cnf(a_times_a_is_a,hypothesis,
product(g1,a,a,a),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',a_times_a_is_a) ).
cnf(c_maps_to_h,hypothesis,
an_isomorphism(c) = h,
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',c_maps_to_h) ).
cnf(a_times_c_is_c,hypothesis,
product(g1,a,c,c),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',a_times_c_is_c) ).
cnf(f_times_h_is_h,hypothesis,
product(g2,f,h,h),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',f_times_h_is_h) ).
cnf(b_maps_to_g,hypothesis,
an_isomorphism(b) = g,
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',b_maps_to_g) ).
cnf(a_times_b_is_b,hypothesis,
product(g1,a,b,b),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',a_times_b_is_b) ).
cnf(f_times_g_is_g,hypothesis,
product(g2,f,g,g),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',f_times_g_is_g) ).
cnf(c_times_a_is_c,hypothesis,
product(g1,c,a,c),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',c_times_a_is_c) ).
cnf(h_times_f_is_h,hypothesis,
product(g2,h,f,h),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',h_times_f_is_h) ).
cnf(c_times_c_is_b,hypothesis,
product(g1,c,c,b),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',c_times_c_is_b) ).
cnf(h_times_h_is_g,hypothesis,
product(g2,h,h,g),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',h_times_h_is_g) ).
cnf(c_times_b_is_a,hypothesis,
product(g1,c,b,a),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',c_times_b_is_a) ).
cnf(h_times_g_is_f,hypothesis,
product(g2,h,g,f),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',h_times_g_is_f) ).
cnf(b_times_a_is_b,hypothesis,
product(g1,b,a,b),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',b_times_a_is_b) ).
cnf(g_times_f_is_g,hypothesis,
product(g2,g,f,g),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',g_times_f_is_g) ).
cnf(b_times_c_is_a,hypothesis,
product(g1,b,c,a),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',b_times_c_is_a) ).
cnf(g_times_h_is_f,hypothesis,
product(g2,g,h,f),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',g_times_h_is_f) ).
cnf(b_times_b_is_c,hypothesis,
product(g1,b,b,c),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',b_times_b_is_c) ).
cnf(g_times_g_is_h,hypothesis,
product(g2,g,g,h),
file('/export/starexec/sandbox2/tmp/tmp.FfdWoTsrMU/E---3.1_4549.p',g_times_g_is_h) ).
cnf(c_0_28,hypothesis,
( X1 = a
| X1 = b
| X1 = c
| ~ group_member(X1,g1) ),
inference(fof_simplification,[status(thm)],[all_of_group1]) ).
cnf(c_0_29,negated_conjecture,
~ product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3)),
inference(fof_simplification,[status(thm)],[prove_product_holds_in_group2]) ).
cnf(c_0_30,hypothesis,
( X1 = a
| X1 = b
| X1 = c
| ~ group_member(X1,g1) ),
c_0_28 ).
cnf(c_0_31,hypothesis,
group_member(d3,g1),
d3_in_group1 ).
cnf(c_0_32,negated_conjecture,
~ product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3)),
c_0_29 ).
cnf(c_0_33,hypothesis,
( d3 = a
| d3 = b
| d3 = c ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,hypothesis,
an_isomorphism(a) = f,
a_maps_to_f ).
cnf(c_0_35,hypothesis,
group_member(d2,g1),
d2_in_group1 ).
cnf(c_0_36,negated_conjecture,
( d3 = c
| d3 = b
| ~ product(g2,an_isomorphism(d1),an_isomorphism(d2),f) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,hypothesis,
( d2 = a
| d2 = b
| d2 = c ),
inference(spm,[status(thm)],[c_0_30,c_0_35]) ).
cnf(c_0_38,hypothesis,
group_member(d1,g1),
d1_in_group1 ).
cnf(c_0_39,hypothesis,
( d2 = c
| d2 = b
| d3 = b
| d3 = c
| ~ product(g2,an_isomorphism(d1),f,f) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_34]) ).
cnf(c_0_40,hypothesis,
( d1 = a
| d1 = b
| d1 = c ),
inference(spm,[status(thm)],[c_0_30,c_0_38]) ).
cnf(c_0_41,hypothesis,
product(g2,f,f,f),
f_times_f_is_f ).
cnf(c_0_42,hypothesis,
product(g1,d1,d2,d3),
d1_times_d2_is_d3 ).
cnf(c_0_43,hypothesis,
( d1 = c
| d1 = b
| d3 = c
| d3 = b
| d2 = b
| d2 = c ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_34]),c_0_41])]) ).
cnf(c_0_44,plain,
( X5 = X4
| ~ product(X1,X2,X3,X4)
| ~ product(X1,X2,X3,X5) ),
inference(fof_simplification,[status(thm)],[total_function2]) ).
cnf(c_0_45,hypothesis,
( d2 = c
| d2 = b
| d3 = b
| d1 = b
| d1 = c
| product(g1,d1,d2,c) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,hypothesis,
( d1 = c
| d1 = b
| a != b ),
inference(ef,[status(thm)],[c_0_40]) ).
cnf(c_0_47,hypothesis,
( d1 = c
| d1 = b
| a != c ),
inference(ef,[status(thm)],[c_0_40]) ).
cnf(c_0_48,plain,
( X5 = X4
| ~ product(X1,X2,X3,X4)
| ~ product(X1,X2,X3,X5) ),
c_0_44 ).
cnf(c_0_49,hypothesis,
( d2 = c
| d2 = b
| d1 = c
| d1 = b
| d3 = b
| product(g1,d1,a,c) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_37]),c_0_46]),c_0_47]) ).
cnf(c_0_50,hypothesis,
( d3 = b
| d1 = b
| d1 = c
| d2 = b
| d2 = c
| X1 = c
| ~ product(g1,d1,a,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,hypothesis,
( d1 = c
| d1 = b
| d2 = c
| d2 = b
| d3 = b
| X1 = c
| ~ product(g1,a,a,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_40]),c_0_47]),c_0_46]) ).
cnf(c_0_52,hypothesis,
product(g1,a,a,a),
a_times_a_is_a ).
cnf(c_0_53,hypothesis,
( d2 = c
| d2 = b
| product(g1,d1,a,d3) ),
inference(spm,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_54,hypothesis,
( d3 = b
| d2 = b
| d2 = c
| d1 = b
| d1 = c ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_47]) ).
cnf(c_0_55,hypothesis,
( d1 = c
| d1 = b
| d2 = b
| d2 = c
| product(g1,d1,a,b) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,hypothesis,
( d2 = c
| d2 = b
| d1 = b
| d1 = c
| X1 = b
| ~ product(g1,d1,a,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_55]) ).
cnf(c_0_57,hypothesis,
( X1 = d3
| ~ product(g1,d1,d2,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_42]) ).
cnf(c_0_58,hypothesis,
( d1 = c
| d1 = b
| d2 = b
| d2 = c
| X1 = b
| ~ product(g1,a,a,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_40]),c_0_47]),c_0_46]) ).
cnf(c_0_59,hypothesis,
( d1 = c
| d1 = b
| X1 = d3
| ~ product(g1,a,d2,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_40]) ).
cnf(c_0_60,hypothesis,
( d2 = c
| d2 = b
| d1 = b
| d1 = c ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_52]),c_0_46]) ).
cnf(c_0_61,negated_conjecture,
( d1 = c
| d1 = b
| ~ product(g2,f,an_isomorphism(d2),an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_40]),c_0_34]) ).
cnf(c_0_62,hypothesis,
an_isomorphism(c) = h,
c_maps_to_h ).
cnf(c_0_63,hypothesis,
( d2 = b
| d1 = b
| d1 = c
| X1 = d3
| ~ product(g1,a,c,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,hypothesis,
product(g1,a,c,c),
a_times_c_is_c ).
cnf(c_0_65,negated_conjecture,
( d2 = b
| d1 = b
| d1 = c
| ~ product(g2,f,h,an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_60]),c_0_62]) ).
cnf(c_0_66,hypothesis,
( d3 = c
| d1 = c
| d1 = b
| d2 = b ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,hypothesis,
product(g2,f,h,h),
f_times_h_is_h ).
cnf(c_0_68,negated_conjecture,
( d1 = c
| d1 = b
| d2 = b ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_62]),c_0_67])]) ).
cnf(c_0_69,hypothesis,
an_isomorphism(b) = g,
b_maps_to_g ).
cnf(c_0_70,hypothesis,
( d1 = b
| d1 = c
| X1 = d3
| ~ product(g1,a,b,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_68]) ).
cnf(c_0_71,hypothesis,
product(g1,a,b,b),
a_times_b_is_b ).
cnf(c_0_72,negated_conjecture,
( d1 = b
| d1 = c
| ~ product(g2,f,g,an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_68]),c_0_69]) ).
cnf(c_0_73,hypothesis,
( d3 = b
| d1 = c
| d1 = b ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,hypothesis,
product(g2,f,g,g),
f_times_g_is_g ).
cnf(c_0_75,hypothesis,
( d2 = c
| d2 = b
| X1 = d3
| ~ product(g1,d1,a,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_37]) ).
cnf(c_0_76,negated_conjecture,
( d1 = c
| d1 = b ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_69]),c_0_74])]) ).
cnf(c_0_77,negated_conjecture,
( d2 = c
| d2 = b
| ~ product(g2,an_isomorphism(d1),f,an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_37]),c_0_34]) ).
cnf(c_0_78,hypothesis,
( d1 = b
| d2 = b
| d2 = c
| X1 = d3
| ~ product(g1,c,a,X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_79,hypothesis,
product(g1,c,a,c),
c_times_a_is_c ).
cnf(c_0_80,negated_conjecture,
( d1 = b
| d2 = b
| d2 = c
| ~ product(g2,h,f,an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_76]),c_0_62]) ).
cnf(c_0_81,hypothesis,
( d3 = c
| d2 = c
| d2 = b
| d1 = b ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_82,hypothesis,
product(g2,h,f,h),
h_times_f_is_h ).
cnf(c_0_83,hypothesis,
( d1 = b
| X1 = d3
| ~ product(g1,c,d2,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_76]) ).
cnf(c_0_84,negated_conjecture,
( d2 = c
| d2 = b
| d1 = b ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_62]),c_0_82])]) ).
cnf(c_0_85,negated_conjecture,
( d1 = b
| ~ product(g2,h,an_isomorphism(d2),an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_76]),c_0_62]) ).
cnf(c_0_86,hypothesis,
( d2 = b
| d1 = b
| X1 = d3
| ~ product(g1,c,c,X1) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_87,hypothesis,
product(g1,c,c,b),
c_times_c_is_b ).
cnf(c_0_88,negated_conjecture,
( d2 = b
| d1 = b
| ~ product(g2,h,h,an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_84]),c_0_62]) ).
cnf(c_0_89,hypothesis,
( d3 = b
| d1 = b
| d2 = b ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_90,hypothesis,
product(g2,h,h,g),
h_times_h_is_g ).
cnf(c_0_91,hypothesis,
product(g1,c,b,a),
c_times_b_is_a ).
cnf(c_0_92,hypothesis,
( d1 = b
| product(g1,c,d2,d3) ),
inference(spm,[status(thm)],[c_0_42,c_0_76]) ).
cnf(c_0_93,negated_conjecture,
( d1 = b
| d2 = b ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_69]),c_0_90])]) ).
cnf(c_0_94,hypothesis,
( X1 = a
| ~ product(g1,c,b,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_91]) ).
cnf(c_0_95,hypothesis,
( d1 = b
| product(g1,c,b,d3) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_96,negated_conjecture,
( d1 = b
| ~ product(g2,h,g,an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_93]),c_0_69]) ).
cnf(c_0_97,hypothesis,
( d1 = b
| d3 = a ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_98,hypothesis,
product(g2,h,g,f),
h_times_g_is_f ).
cnf(c_0_99,hypothesis,
product(g1,b,a,b),
b_times_a_is_b ).
cnf(c_0_100,negated_conjecture,
d1 = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_34]),c_0_98])]) ).
cnf(c_0_101,hypothesis,
( X1 = b
| ~ product(g1,b,a,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_99]) ).
cnf(c_0_102,hypothesis,
( d2 = b
| d2 = c
| product(g1,b,a,d3) ),
inference(rw,[status(thm)],[c_0_53,c_0_100]) ).
cnf(c_0_103,hypothesis,
( d2 = c
| d2 = b
| d3 = b ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_104,hypothesis,
product(g2,g,f,g),
g_times_f_is_g ).
cnf(c_0_105,hypothesis,
( X1 = d3
| ~ product(g1,b,d2,X1) ),
inference(rw,[status(thm)],[c_0_57,c_0_100]) ).
cnf(c_0_106,negated_conjecture,
( d2 = b
| d2 = c ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_103]),c_0_100]),c_0_69]),c_0_69]),c_0_104])]) ).
cnf(c_0_107,hypothesis,
( d2 = b
| X1 = d3
| ~ product(g1,b,c,X1) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_108,hypothesis,
product(g1,b,c,a),
b_times_c_is_a ).
cnf(c_0_109,negated_conjecture,
( d2 = b
| ~ product(g2,g,h,an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_106]),c_0_100]),c_0_69]),c_0_62]) ).
cnf(c_0_110,hypothesis,
( d3 = a
| d2 = b ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_111,hypothesis,
product(g2,g,h,f),
g_times_h_is_f ).
cnf(c_0_112,hypothesis,
product(g1,b,b,c),
b_times_b_is_c ).
cnf(c_0_113,hypothesis,
product(g1,b,d2,d3),
inference(rw,[status(thm)],[c_0_42,c_0_100]) ).
cnf(c_0_114,negated_conjecture,
d2 = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_34]),c_0_111])]) ).
cnf(c_0_115,hypothesis,
( X1 = c
| ~ product(g1,b,b,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_112]) ).
cnf(c_0_116,hypothesis,
product(g1,b,b,d3),
inference(rw,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_117,hypothesis,
d3 = c,
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_118,hypothesis,
product(g2,g,g,h),
g_times_g_is_h ).
cnf(c_0_119,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_117]),c_0_100]),c_0_69]),c_0_114]),c_0_69]),c_0_62]),c_0_118])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : GRP026-1 : TPTP v8.1.2. Bugfixed v2.0.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n004.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 16:06:38 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.FfdWoTsrMU/E---3.1_4549.p
% 0.15/0.44 # Version: 3.1.0
% 0.15/0.44 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI 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 # sh5l with pid 4631 completed with status 0
% 0.15/0.44 # Result found by sh5l
% 0.15/0.44 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI 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 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 # Search class: FGUSM-FFMM21-SFFFFFNN
% 0.15/0.44 # partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.15/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.15/0.44 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 4638 completed with status 0
% 0.15/0.44 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.15/0.44 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI 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 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 # Search class: FGUSM-FFMM21-SFFFFFNN
% 0.15/0.44 # partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.15/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.15/0.44 # Preprocessing time : 0.001 s
% 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 : 45
% 0.15/0.44 # Removed by relevancy pruning/SinE : 2
% 0.15/0.44 # Initial clauses : 43
% 0.15/0.44 # Removed in clause preprocessing : 0
% 0.15/0.44 # Initial clauses in saturation : 43
% 0.15/0.44 # Processed clauses : 254
% 0.15/0.44 # ...of these trivial : 1
% 0.15/0.44 # ...subsumed : 54
% 0.15/0.44 # ...remaining for further processing : 199
% 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 : 69
% 0.15/0.44 # Backward-rewritten : 41
% 0.15/0.44 # Generated clauses : 546
% 0.15/0.44 # ...of the previous two non-redundant : 502
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 8
% 0.15/0.44 # Paramodulations : 529
% 0.15/0.44 # Factorizations : 17
% 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 : 283
% 0.15/0.44 # ...of those cached : 254
% 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 : 89
% 0.15/0.44 # Positive orientable unit clauses : 48
% 0.15/0.44 # Positive unorientable unit clauses: 0
% 0.15/0.44 # Negative unit clauses : 3
% 0.15/0.44 # Non-unit-clauses : 38
% 0.15/0.44 # Current number of unprocessed clauses: 242
% 0.15/0.44 # ...number of literals in the above : 952
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 110
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 4367
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 1361
% 0.15/0.44 # Non-unit clause-clause subsumptions : 130
% 0.15/0.44 # Unit Clause-clause subsumption calls : 53
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 81
% 0.15/0.44 # BW rewrite match successes : 5
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 7079
% 0.15/0.44 # Search garbage collected termcells : 38
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.018 s
% 0.15/0.44 # System time : 0.001 s
% 0.15/0.44 # Total time : 0.019 s
% 0.15/0.44 # Maximum resident set size: 1792 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.020 s
% 0.15/0.44 # System time : 0.003 s
% 0.15/0.44 # Total time : 0.022 s
% 0.15/0.44 # Maximum resident set size: 1716 pages
% 0.15/0.44 % E---3.1 exiting
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------