TSTP Solution File: GRP269-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP269-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : Mon May 20 20:55:13 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 16
% Syntax : Number of clauses : 87 ( 21 unt; 56 nHn; 75 RR)
% Number of literals : 233 ( 232 equ; 100 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 : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c1) = sk_c11
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_44,negated_conjecture,
( inverse(sk_c2) = sk_c11
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_44) ).
cnf(prove_this_34,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c9
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_24,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_43,negated_conjecture,
( inverse(sk_c2) = sk_c11
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_43) ).
cnf(prove_this_33,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c9
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_33) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_51,negated_conjecture,
( multiply(X1,sk_c11) != sk_c10
| inverse(X1) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X2,sk_c11) != sk_c9
| inverse(X2) != 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/benchmark/theBenchmark.p',prove_this_51) ).
cnf(c_0_16,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_17,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_18,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_19,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_1 ).
cnf(c_0_21,negated_conjecture,
( multiply(inverse(sk_c3),sk_c10) = sk_c11
| multiply(sk_c1,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| inverse(sk_c3) = sk_c11 ),
prove_this_2 ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( multiply(inverse(sk_c1),sk_c10) = sk_c11
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_11 ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( multiply(inverse(sk_c3),sk_c10) = sk_c11
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( inverse(sk_c1) = sk_c11
| inverse(sk_c3) = sk_c11 ),
prove_this_12 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| inverse(sk_c1) = sk_c11 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
multiply(sk_c11,sk_c10) = sk_c11,
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_31,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_32,negated_conjecture,
identity = sk_c10,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_17]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c2) = sk_c11
| inverse(sk_c4) = sk_c10 ),
prove_this_44 ).
cnf(c_0_34,plain,
multiply(inverse(inverse(X1)),sk_c10) = X1,
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c9
| inverse(sk_c4) = sk_c10 ),
prove_this_34 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c10,sk_c4) = identity
| inverse(sk_c2) = sk_c11 ),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_23 ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c9
| sk_c4 = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_17]),c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c10,sk_c4) = sk_c10
| inverse(sk_c2) = sk_c11 ),
inference(rw,[status(thm)],[c_0_36,c_0_32]) ).
cnf(c_0_40,plain,
multiply(sk_c10,X1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_41,negated_conjecture,
( multiply(inverse(sk_c4),sk_c9) = sk_c10
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_24 ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c2) = sk_c11
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_43 ).
cnf(c_0_44,negated_conjecture,
( multiply(inverse(sk_c2),sk_c9) = sk_c11
| sk_c4 = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( inverse(sk_c2) = sk_c11
| sk_c4 = sk_c10 ),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c9
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_33 ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c11,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_17,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c11
| sk_c4 = sk_c10 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_25 ).
cnf(c_0_51,negated_conjecture,
( multiply(inverse(sk_c4),sk_c9) = sk_c10
| multiply(sk_c2,sk_c11) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| identity = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_47]),c_0_17]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c11,sk_c2) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
inference(rw,[status(thm)],[c_0_48,c_0_32]) ).
cnf(c_0_54,negated_conjecture,
( sk_c4 = sk_c10
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_49]),c_0_17]),c_0_32]) ).
cnf(c_0_55,negated_conjecture,
( multiply(inverse(sk_c5),sk_c11) = sk_c8
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| inverse(sk_c5) = sk_c8 ),
prove_this_26 ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c9
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_51,c_0_35]) ).
cnf(c_0_58,negated_conjecture,
( multiply(inverse(sk_c11),sk_c10) = sk_c9
| identity = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c11,sk_c2) = sk_c10
| sk_c9 = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_40])]) ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c8,sk_c11) = sk_c8 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( multiply(inverse(sk_c2),sk_c9) = sk_c11
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
( multiply(inverse(sk_c11),sk_c10) = sk_c9
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[c_0_58,c_0_32]) ).
cnf(c_0_63,negated_conjecture,
( multiply(inverse(sk_c11),sk_c10) = sk_c2
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| identity = sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_60]),c_0_17]) ).
cnf(c_0_65,negated_conjecture,
( multiply(inverse(sk_c2),sk_c9) = sk_c11
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[c_0_61,c_0_40]) ).
cnf(c_0_66,negated_conjecture,
( sk_c9 = sk_c10
| sk_c2 = sk_c9 ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_68,negated_conjecture,
( multiply(X1,sk_c11) != sk_c10
| inverse(X1) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X2,sk_c11) != sk_c9
| inverse(X2) != 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 ),
inference(fof_simplification,[status(thm)],[prove_this_51]) ).
cnf(c_0_69,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| sk_c10 = sk_c11 ),
inference(rw,[status(thm)],[c_0_64,c_0_32]) ).
cnf(c_0_70,negated_conjecture,
( sk_c9 = sk_c10
| sk_c10 = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_17]),c_0_32]) ).
cnf(c_0_71,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( multiply(X1,sk_c11) != sk_c10
| inverse(X1) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X2,sk_c11) != sk_c9
| inverse(X2) != 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 ),
c_0_68 ).
cnf(c_0_73,negated_conjecture,
sk_c10 = sk_c11,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_30])]) ).
cnf(c_0_74,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_71]) ).
cnf(c_0_75,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),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,sk_c10) != sk_c9
| multiply(X4,sk_c11) != sk_c10
| multiply(X5,sk_c11) != sk_c9
| multiply(X6,sk_c11) != sk_c10
| inverse(X3) != sk_c10
| inverse(X4) != sk_c11
| inverse(X5) != sk_c11
| inverse(X6) != sk_c11 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_72])]) ).
cnf(c_0_76,negated_conjecture,
sk_c9 = sk_c11,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_73]),c_0_17]),c_0_32]),c_0_73]),c_0_73])]) ).
cnf(c_0_77,negated_conjecture,
multiply(sk_c11,sk_c11) = sk_c11,
inference(rw,[status(thm)],[c_0_30,c_0_73]) ).
cnf(c_0_78,plain,
inverse(sk_c10) = sk_c10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_32]),c_0_32]) ).
cnf(c_0_79,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c11) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,sk_c11) != sk_c11
| multiply(X4,sk_c11) != sk_c11
| multiply(X5,sk_c11) != sk_c11
| multiply(X6,sk_c11) != sk_c11
| inverse(X3) != sk_c11
| inverse(X4) != sk_c11
| inverse(X5) != sk_c11
| inverse(X6) != sk_c11 ),
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)],[c_0_75,c_0_73]),c_0_73]),c_0_73]),c_0_73]),c_0_73]),c_0_73]),c_0_76]),c_0_77]),c_0_76]),c_0_76])]) ).
cnf(c_0_80,plain,
inverse(sk_c11) = sk_c11,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_73]),c_0_73]) ).
cnf(c_0_81,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c11) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,sk_c11) != sk_c11
| multiply(X4,sk_c11) != sk_c11
| multiply(X5,sk_c11) != sk_c11
| inverse(X3) != sk_c11
| inverse(X4) != sk_c11
| inverse(X5) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_77])]) ).
cnf(c_0_82,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c11) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,sk_c11) != sk_c11
| multiply(X4,sk_c11) != sk_c11
| inverse(X3) != sk_c11
| inverse(X4) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_80]),c_0_77])]) ).
cnf(c_0_83,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c11) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,sk_c11) != sk_c11
| inverse(X3) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_80]),c_0_77])]) ).
cnf(c_0_84,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c11) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_80]),c_0_77])]) ).
cnf(c_0_85,negated_conjecture,
( inverse(multiply(X1,sk_c11)) != sk_c11
| inverse(X1) != multiply(X1,sk_c11) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_80]),c_0_77])]) ).
cnf(c_0_86,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_80]),c_0_77]),c_0_80]),c_0_77])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP269-1 : TPTP v8.2.0. Released v2.5.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 04:43:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 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/benchmark/theBenchmark.p
% 0.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 17931 completed with status 0
% 0.20/0.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # Starting sh5l with 136s (1) cores
% 0.20/0.52 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 17937 completed with status 0
% 0.20/0.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 54
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 54
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 54
% 0.20/0.52 # Processed clauses : 459
% 0.20/0.52 # ...of these trivial : 16
% 0.20/0.52 # ...subsumed : 105
% 0.20/0.52 # ...remaining for further processing : 338
% 0.20/0.52 # Other redundant clauses eliminated : 2
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 21
% 0.20/0.52 # Backward-rewritten : 236
% 0.20/0.52 # Generated clauses : 1619
% 0.20/0.52 # ...of the previous two non-redundant : 1672
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 4
% 0.20/0.52 # Paramodulations : 1618
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 2
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 762
% 0.20/0.52 # ...of those cached : 721
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 26
% 0.20/0.52 # Positive orientable unit clauses : 9
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 0
% 0.20/0.52 # Non-unit-clauses : 17
% 0.20/0.52 # Current number of unprocessed clauses: 957
% 0.20/0.52 # ...number of literals in the above : 3060
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 311
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 1858
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 1110
% 0.20/0.52 # Non-unit clause-clause subsumptions : 127
% 0.20/0.52 # Unit Clause-clause subsumption calls : 327
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 11
% 0.20/0.52 # BW rewrite match successes : 10
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 32775
% 0.20/0.52 # Search garbage collected termcells : 43
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.044 s
% 0.20/0.52 # System time : 0.007 s
% 0.20/0.52 # Total time : 0.051 s
% 0.20/0.52 # Maximum resident set size: 1680 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.240 s
% 0.20/0.52 # System time : 0.011 s
% 0.20/0.52 # Total time : 0.251 s
% 0.20/0.52 # Maximum resident set size: 1716 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------