TSTP Solution File: GRP378-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP378-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:47:15 EDT 2023
% Result : Unsatisfiable 2.98s 0.83s
% Output : CNFRefutation 2.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 17
% Syntax : Number of clauses : 90 ( 17 unt; 64 nHn; 78 RR)
% Number of literals : 201 ( 200 equ; 53 neg)
% Maximal clause size : 15 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-2 aty)
% Number of variables : 45 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',left_identity) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_25) ).
cnf(prove_this_39,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c6) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_39) ).
cnf(prove_this_36,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_36) ).
cnf(prove_this_29,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| inverse(sk_c6) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_29) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_26) ).
cnf(prove_this_28,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| inverse(sk_c7) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_28) ).
cnf(prove_this_38,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c7) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_38) ).
cnf(prove_this_13,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_13) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c11) = sk_c10
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_2) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c8,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_17) ).
cnf(prove_this_14,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_14) ).
cnf(prove_this_35,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_35) ).
cnf(prove_this_1,negated_conjecture,
( inverse(sk_c11) = sk_c10
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_1) ).
cnf(prove_this_51,negated_conjecture,
( inverse(sk_c11) != sk_c10
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X1,X2) != sk_c11
| inverse(X1) != X2
| multiply(X2,sk_c10) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| inverse(X3) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c11
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c11
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
file('/export/starexec/sandbox/tmp/tmp.76LH5CyAT8/E---3.1_9614.p',prove_this_51) ).
cnf(c_0_17,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_18,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_19,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_20,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_21,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_22,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_25 ).
cnf(c_0_24,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c6) = sk_c8 ),
prove_this_39 ).
cnf(c_0_26,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c5) = sk_c8 ),
prove_this_36 ).
cnf(c_0_27,negated_conjecture,
( multiply(inverse(sk_c5),sk_c11) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c11 ),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| inverse(sk_c6) = sk_c8 ),
prove_this_29 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| inverse(sk_c5) = sk_c8 ),
prove_this_26 ).
cnf(c_0_30,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c8) = sk_c6 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c8) = sk_c5 ),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| inverse(sk_c7) = sk_c6 ),
prove_this_28 ).
cnf(c_0_33,negated_conjecture,
( multiply(inverse(inverse(sk_c5)),sk_c8) = sk_c11
| multiply(sk_c1,sk_c2) = sk_c11 ),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| inverse(sk_c8) = sk_c6 ),
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| inverse(sk_c8) = sk_c5 ),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c8) = sk_c6
| inverse(sk_c2) = sk_c1 ),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c8) = sk_c5
| inverse(sk_c2) = sk_c1 ),
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| inverse(sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c7) = sk_c6 ),
prove_this_38 ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| sk_c11 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_18]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| sk_c5 = sk_c6 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c2) = sk_c1
| sk_c5 = sk_c6 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c11
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_24,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_13 ).
cnf(c_0_46,negated_conjecture,
( inverse(sk_c11) = sk_c10
| inverse(sk_c3) = sk_c11 ),
prove_this_2 ).
cnf(c_0_47,negated_conjecture,
( multiply(inverse(sk_c1),sk_c11) = sk_c2
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_20,c_0_40]) ).
cnf(c_0_48,negated_conjecture,
( multiply(inverse(sk_c1),sk_c11) = sk_c2
| sk_c5 = sk_c6 ),
inference(spm,[status(thm)],[c_0_20,c_0_41]) ).
cnf(c_0_49,negated_conjecture,
( inverse(sk_c1) = sk_c2
| sk_c5 = sk_c6 ),
inference(spm,[status(thm)],[c_0_24,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( multiply(inverse(sk_c1),sk_c11) = sk_c2
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_20,c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( inverse(sk_c1) = sk_c2
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c8,sk_c10) = sk_c11 ),
prove_this_17 ).
cnf(c_0_53,negated_conjecture,
( multiply(inverse(sk_c4),sk_c9) = sk_c10
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_20,c_0_45]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_14 ).
cnf(c_0_55,negated_conjecture,
( inverse(sk_c11) = sk_c10
| inverse(sk_c11) = sk_c3 ),
inference(spm,[status(thm)],[c_0_24,c_0_46]) ).
cnf(c_0_56,negated_conjecture,
( multiply(inverse(inverse(sk_c1)),sk_c2) = sk_c11
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_20,c_0_47]) ).
cnf(c_0_57,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_35 ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c2
| sk_c5 = sk_c6 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c6,sk_c7) = identity
| inverse(sk_c1) = sk_c2 ),
inference(spm,[status(thm)],[c_0_18,c_0_39]) ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c2
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c8,multiply(sk_c10,X1)) = multiply(sk_c11,X1)
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_52]) ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_63,negated_conjecture,
( inverse(sk_c11) = sk_c10
| sk_c3 != sk_c10 ),
inference(ef,[status(thm)],[c_0_55]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| sk_c11 = identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_18])]) ).
cnf(c_0_65,negated_conjecture,
( sk_c5 = sk_c6
| sk_c11 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_58]),c_0_18]) ).
cnf(c_0_66,negated_conjecture,
( multiply(sk_c6,sk_c7) = identity
| sk_c11 = identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_59]),c_0_18])]) ).
cnf(c_0_67,negated_conjecture,
( sk_c7 = sk_c8
| sk_c11 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_60]),c_0_18]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c8,sk_c10) = multiply(sk_c11,sk_c9)
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_69,negated_conjecture,
( inverse(sk_c10) = sk_c11
| sk_c3 != sk_c10 ),
inference(spm,[status(thm)],[c_0_24,c_0_63]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c11
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_71,negated_conjecture,
( multiply(sk_c6,sk_c8) = identity
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c11
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_52,c_0_68]) ).
cnf(c_0_73,negated_conjecture,
( inverse(sk_c11) = sk_c10
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_1 ).
cnf(c_0_74,negated_conjecture,
( multiply(sk_c11,sk_c10) = identity
| sk_c3 != sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_69]) ).
cnf(c_0_75,negated_conjecture,
sk_c11 = identity,
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_76,negated_conjecture,
( multiply(inverse(sk_c11),sk_c10) = sk_c9
| multiply(sk_c11,sk_c9) = sk_c11 ),
inference(spm,[status(thm)],[c_0_20,c_0_72]) ).
cnf(c_0_77,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| multiply(sk_c10,sk_c11) = identity ),
inference(spm,[status(thm)],[c_0_18,c_0_73]) ).
cnf(c_0_79,negated_conjecture,
( sk_c10 = identity
| sk_c3 != sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_19]) ).
cnf(c_0_80,negated_conjecture,
( inverse(sk_c11) != sk_c10
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X1,X2) != sk_c11
| inverse(X1) != X2
| multiply(X2,sk_c10) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| inverse(X3) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c11
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c11
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
prove_this_51 ).
cnf(c_0_81,negated_conjecture,
( sk_c9 = identity
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_75]),c_0_77]),c_0_19]),c_0_75]),c_0_19]),c_0_75]) ).
cnf(c_0_82,negated_conjecture,
sk_c10 = identity,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_75]),c_0_22]),c_0_75]),c_0_22]),c_0_79]) ).
cnf(c_0_83,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c10) != sk_c11
| multiply(inverse(X3),sk_c10) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,inverse(X3)) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| multiply(X5,sk_c11) != sk_c10
| inverse(sk_c11) != sk_c10
| inverse(X4) != sk_c10
| inverse(X5) != sk_c11 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_80])])]) ).
cnf(c_0_84,negated_conjecture,
sk_c9 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]) ).
cnf(c_0_85,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_86,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(X1,inverse(X2)) != inverse(X1)
| inverse(X2) != identity
| inverse(X3) != identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[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(rw,[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(er,[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_75]),c_0_75]),c_0_75]),c_0_19]),c_0_75]),c_0_75]),c_0_75]),c_0_22]),c_0_75]),c_0_77]),c_0_75])]),c_0_82]),c_0_22]),c_0_82]),c_0_22]),c_0_84]),c_0_82]),c_0_82]),c_0_22]),c_0_84]),c_0_82]),c_0_82]),c_0_82]),c_0_77])])]),c_0_77])]),c_0_85]),c_0_85])]) ).
cnf(c_0_87,negated_conjecture,
( inverse(X1) != identity
| inverse(X2) != identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_18]),c_0_77]),c_0_24])]) ).
cnf(c_0_88,negated_conjecture,
inverse(X1) != identity,
inference(spm,[status(thm)],[c_0_87,c_0_77]) ).
cnf(c_0_89,plain,
$false,
inference(sr,[status(thm)],[c_0_77,c_0_88]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP378-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Oct 3 02:34:07 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.45 Running first-order model finding
% 0.20/0.45 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.76LH5CyAT8/E---3.1_9614.p
% 2.98/0.83 # Version: 3.1pre001
% 2.98/0.83 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.98/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.98/0.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.98/0.83 # Starting new_bool_3 with 300s (1) cores
% 2.98/0.83 # Starting new_bool_1 with 300s (1) cores
% 2.98/0.83 # Starting sh5l with 300s (1) cores
% 2.98/0.83 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 9716 completed with status 0
% 2.98/0.83 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 2.98/0.83 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.98/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.98/0.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.98/0.83 # No SInE strategy applied
% 2.98/0.83 # Search class: FGHPS-FFMM21-SFFFFFNN
% 2.98/0.83 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.98/0.83 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.98/0.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 2.98/0.83 # Starting new_bool_3 with 136s (1) cores
% 2.98/0.83 # Starting new_bool_1 with 136s (1) cores
% 2.98/0.83 # Starting sh5l with 136s (1) cores
% 2.98/0.83 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 9722 completed with status 0
% 2.98/0.83 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.98/0.83 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.98/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.98/0.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.98/0.83 # No SInE strategy applied
% 2.98/0.83 # Search class: FGHPS-FFMM21-SFFFFFNN
% 2.98/0.83 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.98/0.83 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.98/0.83 # Preprocessing time : 0.001 s
% 2.98/0.83 # Presaturation interreduction done
% 2.98/0.83
% 2.98/0.83 # Proof found!
% 2.98/0.83 # SZS status Unsatisfiable
% 2.98/0.83 # SZS output start CNFRefutation
% See solution above
% 2.98/0.83 # Parsed axioms : 54
% 2.98/0.83 # Removed by relevancy pruning/SinE : 0
% 2.98/0.83 # Initial clauses : 54
% 2.98/0.83 # Removed in clause preprocessing : 0
% 2.98/0.83 # Initial clauses in saturation : 54
% 2.98/0.83 # Processed clauses : 7489
% 2.98/0.83 # ...of these trivial : 615
% 2.98/0.83 # ...subsumed : 5082
% 2.98/0.83 # ...remaining for further processing : 1792
% 2.98/0.83 # Other redundant clauses eliminated : 288
% 2.98/0.83 # Clauses deleted for lack of memory : 0
% 2.98/0.83 # Backward-subsumed : 134
% 2.98/0.83 # Backward-rewritten : 1567
% 2.98/0.83 # Generated clauses : 25140
% 2.98/0.83 # ...of the previous two non-redundant : 25299
% 2.98/0.83 # ...aggressively subsumed : 0
% 2.98/0.83 # Contextual simplify-reflections : 53
% 2.98/0.83 # Paramodulations : 24848
% 2.98/0.83 # Factorizations : 4
% 2.98/0.83 # NegExts : 0
% 2.98/0.83 # Equation resolutions : 288
% 2.98/0.83 # Total rewrite steps : 14359
% 2.98/0.83 # Propositional unsat checks : 0
% 2.98/0.83 # Propositional check models : 0
% 2.98/0.83 # Propositional check unsatisfiable : 0
% 2.98/0.83 # Propositional clauses : 0
% 2.98/0.83 # Propositional clauses after purity: 0
% 2.98/0.83 # Propositional unsat core size : 0
% 2.98/0.83 # Propositional preprocessing time : 0.000
% 2.98/0.83 # Propositional encoding time : 0.000
% 2.98/0.83 # Propositional solver time : 0.000
% 2.98/0.83 # Success case prop preproc time : 0.000
% 2.98/0.83 # Success case prop encoding time : 0.000
% 2.98/0.83 # Success case prop solver time : 0.000
% 2.98/0.83 # Current number of processed clauses : 26
% 2.98/0.83 # Positive orientable unit clauses : 19
% 2.98/0.83 # Positive unorientable unit clauses: 0
% 2.98/0.83 # Negative unit clauses : 1
% 2.98/0.83 # Non-unit-clauses : 6
% 2.98/0.83 # Current number of unprocessed clauses: 7303
% 2.98/0.83 # ...number of literals in the above : 77760
% 2.98/0.83 # Current number of archived formulas : 0
% 2.98/0.83 # Current number of archived clauses : 1757
% 2.98/0.83 # Clause-clause subsumption calls (NU) : 164308
% 2.98/0.83 # Rec. Clause-clause subsumption calls : 88811
% 2.98/0.83 # Non-unit clause-clause subsumptions : 5232
% 2.98/0.83 # Unit Clause-clause subsumption calls : 1458
% 2.98/0.83 # Rewrite failures with RHS unbound : 0
% 2.98/0.83 # BW rewrite match attempts : 67
% 2.98/0.83 # BW rewrite match successes : 63
% 2.98/0.83 # Condensation attempts : 0
% 2.98/0.83 # Condensation successes : 0
% 2.98/0.83 # Termbank termtop insertions : 434793
% 2.98/0.83
% 2.98/0.83 # -------------------------------------------------
% 2.98/0.83 # User time : 0.362 s
% 2.98/0.83 # System time : 0.010 s
% 2.98/0.83 # Total time : 0.372 s
% 2.98/0.83 # Maximum resident set size: 1676 pages
% 2.98/0.83
% 2.98/0.83 # -------------------------------------------------
% 2.98/0.83 # User time : 1.821 s
% 2.98/0.83 # System time : 0.026 s
% 2.98/0.83 # Total time : 1.847 s
% 2.98/0.83 # Maximum resident set size: 1696 pages
% 2.98/0.83 % E---3.1 exiting
%------------------------------------------------------------------------------