TSTP Solution File: GRP257-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP257-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:00 EDT 2024
% Result : Unsatisfiable 0.84s 0.60s
% Output : CNFRefutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 45
% Number of leaves : 27
% Syntax : Number of clauses : 149 ( 30 unt; 98 nHn; 125 RR)
% Number of literals : 412 ( 411 equ; 171 neg)
% Maximal clause size : 13 ( 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 : 114 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_8,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_26,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c8,sk_c7) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_28,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c6) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_28) ).
cnf(prove_this_43,negated_conjecture,
( multiply(X1,sk_c10) != sk_c9
| inverse(X1) != sk_c10
| multiply(X2,sk_c9) != sk_c8
| inverse(X2) != sk_c9
| inverse(X3) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,sk_c8) != sk_c9
| inverse(X5) != sk_c8
| multiply(sk_c8,X6) != sk_c9
| multiply(X7,sk_c8) != X6
| inverse(X7) != sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_43) ).
cnf(prove_this_27,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_27) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| inverse(sk_c6) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_19,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c6,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_18,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_23,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_25,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| inverse(sk_c6) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c8,sk_c7) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_3) ).
cnf(c_0_27,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_28,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_29,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_30,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_1 ).
cnf(c_0_32,negated_conjecture,
( multiply(inverse(sk_c4),sk_c9) = sk_c10
| multiply(sk_c1,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| inverse(sk_c4) = sk_c10 ),
prove_this_2 ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
( multiply(inverse(sk_c1),sk_c9) = sk_c10
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_30,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_8 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
( multiply(inverse(sk_c4),sk_c9) = sk_c10
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_30,c_0_37]) ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_9 ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| inverse(sk_c1) = sk_c10 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c8,sk_c7) = sk_c9 ),
prove_this_26 ).
cnf(c_0_42,negated_conjecture,
multiply(sk_c10,sk_c9) = sk_c10,
inference(spm,[status(thm)],[c_0_35,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c6) = sk_c8 ),
prove_this_28 ).
cnf(c_0_44,negated_conjecture,
( multiply(X1,sk_c10) != sk_c9
| inverse(X1) != sk_c10
| multiply(X2,sk_c9) != sk_c8
| inverse(X2) != sk_c9
| inverse(X3) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,sk_c8) != sk_c9
| inverse(X5) != sk_c8
| multiply(sk_c8,X6) != sk_c9
| multiply(X7,sk_c8) != X6
| inverse(X7) != sk_c8 ),
inference(fof_simplification,[status(thm)],[prove_this_43]) ).
cnf(c_0_45,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c7 ),
prove_this_27 ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c9
| multiply(sk_c9,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_28,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
identity = sk_c9,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_42]),c_0_28]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c8,sk_c6) = identity
| inverse(sk_c2) = sk_c9 ),
inference(spm,[status(thm)],[c_0_28,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( multiply(X1,sk_c10) != sk_c9
| inverse(X1) != sk_c10
| multiply(X2,sk_c9) != sk_c8
| inverse(X2) != sk_c9
| inverse(X3) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,sk_c8) != sk_c9
| inverse(X5) != sk_c8
| multiply(sk_c8,X6) != sk_c9
| multiply(X7,sk_c8) != X6
| inverse(X7) != sk_c8 ),
c_0_44 ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c9,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_28,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c9,sk_c2) = sk_c9
| multiply(sk_c8,sk_c7) = sk_c9 ),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
multiply(inverse(X1),X1) = sk_c9,
inference(rw,[status(thm)],[c_0_28,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c8,sk_c6) = sk_c9
| inverse(sk_c2) = sk_c9 ),
inference(rw,[status(thm)],[c_0_48,c_0_47]) ).
cnf(c_0_54,plain,
multiply(sk_c9,X1) = X1,
inference(rw,[status(thm)],[c_0_29,c_0_47]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c8,multiply(X1,sk_c8)) != sk_c9
| multiply(X2,sk_c8) != sk_c9
| multiply(X3,sk_c10) != sk_c9
| multiply(X4,sk_c9) != sk_c8
| multiply(X5,sk_c9) != sk_c8
| multiply(X6,sk_c10) != sk_c9
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c10
| inverse(X4) != sk_c8
| inverse(X5) != sk_c9
| inverse(X6) != sk_c10 ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| inverse(sk_c6) = sk_c8 ),
prove_this_21 ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c9 ),
prove_this_19 ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c9,sk_c2) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c7 ),
inference(rw,[status(thm)],[c_0_50,c_0_47]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c9
| sk_c2 = sk_c9 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_51]),c_0_28]),c_0_47]) ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c8,sk_c6) = sk_c9
| sk_c2 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c8,multiply(sk_c6,sk_c8)) != sk_c9
| multiply(X1,sk_c8) != sk_c9
| multiply(X2,sk_c10) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| multiply(X5,sk_c10) != sk_c9
| inverse(X1) != sk_c8
| inverse(X2) != sk_c10
| inverse(X3) != sk_c8
| inverse(X4) != sk_c9
| inverse(X5) != sk_c10 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c6,sk_c8) = sk_c7 ),
prove_this_20 ).
cnf(c_0_63,negated_conjecture,
( multiply(inverse(sk_c2),sk_c8) = sk_c9
| multiply(sk_c8,sk_c7) = sk_c9 ),
inference(spm,[status(thm)],[c_0_30,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| sk_c2 = sk_c9 ),
inference(rw,[status(thm)],[c_0_58,c_0_54]) ).
cnf(c_0_65,negated_conjecture,
( multiply(inverse(sk_c8),sk_c9) = sk_c7
| sk_c2 = sk_c9 ),
inference(spm,[status(thm)],[c_0_30,c_0_59]) ).
cnf(c_0_66,negated_conjecture,
( multiply(inverse(sk_c8),sk_c9) = sk_c6
| sk_c2 = sk_c9 ),
inference(spm,[status(thm)],[c_0_30,c_0_60]) ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(X1,sk_c8) != sk_c9
| multiply(X2,sk_c10) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| multiply(X5,sk_c10) != sk_c9
| inverse(X1) != sk_c8
| inverse(X2) != sk_c10
| inverse(X3) != sk_c8
| inverse(X4) != sk_c9
| inverse(X5) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_57]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| inverse(sk_c5) = sk_c8 ),
prove_this_18 ).
cnf(c_0_69,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c9 ),
prove_this_17 ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_63,c_0_41]) ).
cnf(c_0_71,negated_conjecture,
( multiply(inverse(sk_c6),sk_c7) = sk_c8
| multiply(sk_c2,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_30,c_0_62]) ).
cnf(c_0_72,negated_conjecture,
( multiply(inverse(sk_c6),sk_c7) = sk_c8
| sk_c2 = sk_c9 ),
inference(spm,[status(thm)],[c_0_30,c_0_64]) ).
cnf(c_0_73,negated_conjecture,
( sk_c2 = sk_c9
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c9 ),
prove_this_24 ).
cnf(c_0_75,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(X1,sk_c10) != sk_c9
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c10) != sk_c9
| inverse(X1) != sk_c10
| inverse(X2) != sk_c8
| inverse(X3) != sk_c9
| inverse(X4) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]) ).
cnf(c_0_76,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| inverse(sk_c4) = sk_c10 ),
prove_this_16 ).
cnf(c_0_77,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_15 ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c9
| identity = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_70]),c_0_28]) ).
cnf(c_0_79,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_71,c_0_56]) ).
cnf(c_0_80,negated_conjecture,
( sk_c2 = sk_c9
| sk_c9 = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_52]) ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c9
| multiply(sk_c9,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_28,c_0_74]) ).
cnf(c_0_82,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(X1,sk_c9) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c10) != sk_c9
| inverse(X1) != sk_c8
| inverse(X2) != sk_c9
| inverse(X3) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_83,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c9
| sk_c9 = sk_c8 ),
inference(rw,[status(thm)],[c_0_78,c_0_47]) ).
cnf(c_0_84,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| sk_c9 = sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_54])]) ).
cnf(c_0_85,negated_conjecture,
( multiply(sk_c9,sk_c2) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c9 ),
inference(rw,[status(thm)],[c_0_81,c_0_47]) ).
cnf(c_0_86,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c5,sk_c9) != sk_c8
| multiply(X1,sk_c9) != sk_c8
| multiply(X2,sk_c10) != sk_c9
| inverse(X1) != sk_c9
| inverse(X2) != sk_c10 ),
inference(spm,[status(thm)],[c_0_82,c_0_68]) ).
cnf(c_0_87,negated_conjecture,
sk_c9 = sk_c8,
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_88,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c9
| sk_c2 = sk_c9 ),
inference(rw,[status(thm)],[c_0_85,c_0_54]) ).
cnf(c_0_89,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c8
| multiply(sk_c5,sk_c8) != sk_c8
| multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c10) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87]),c_0_87]),c_0_87]),c_0_87]),c_0_87]) ).
cnf(c_0_90,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c8
| sk_c2 = sk_c8 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_87]),c_0_87]) ).
cnf(c_0_91,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_22 ).
cnf(c_0_92,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c8
| sk_c2 = sk_c8
| multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c10) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c10 ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_93,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c8
| inverse(sk_c6) = sk_c8 ),
inference(rw,[status(thm)],[c_0_56,c_0_87]) ).
cnf(c_0_94,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c9,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_28,c_0_91]) ).
cnf(c_0_95,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c8
| sk_c2 = sk_c8
| multiply(sk_c6,sk_c8) != sk_c8
| multiply(X1,sk_c10) != sk_c8
| inverse(X1) != sk_c10 ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_96,negated_conjecture,
( sk_c2 = sk_c8
| sk_c6 = sk_c8 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_87]),c_0_52]),c_0_87]),c_0_87]) ).
cnf(c_0_97,plain,
multiply(sk_c8,X1) = X1,
inference(rw,[status(thm)],[c_0_54,c_0_87]) ).
cnf(c_0_98,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c4) = sk_c10 ),
prove_this_23 ).
cnf(c_0_99,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| sk_c2 = sk_c9 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_47]),c_0_54]) ).
cnf(c_0_100,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c8
| sk_c2 = sk_c8
| multiply(X1,sk_c10) != sk_c8
| inverse(X1) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97])]) ).
cnf(c_0_101,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c4) = sk_c10 ),
inference(rw,[status(thm)],[c_0_98,c_0_87]) ).
cnf(c_0_102,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c8
| sk_c2 = sk_c8 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_87]),c_0_87]) ).
cnf(c_0_103,plain,
multiply(inverse(X1),X1) = sk_c8,
inference(rw,[status(thm)],[c_0_52,c_0_87]) ).
cnf(c_0_104,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c8
| inverse(sk_c2) = sk_c8
| sk_c2 = sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]) ).
cnf(c_0_105,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c8
| sk_c2 = sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_97])]) ).
cnf(c_0_106,negated_conjecture,
( multiply(inverse(sk_c2),sk_c8) = sk_c8
| sk_c2 = sk_c8 ),
inference(spm,[status(thm)],[c_0_30,c_0_105]) ).
cnf(c_0_107,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c5) = sk_c8 ),
prove_this_25 ).
cnf(c_0_108,negated_conjecture,
( multiply(inverse(sk_c2),X1) = X1
| sk_c2 = sk_c8 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_106]),c_0_97]),c_0_97]) ).
cnf(c_0_109,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c5) = sk_c8 ),
inference(rw,[status(thm)],[c_0_107,c_0_87]) ).
cnf(c_0_110,negated_conjecture,
sk_c2 = sk_c8,
inference(spm,[status(thm)],[c_0_103,c_0_108]) ).
cnf(c_0_111,negated_conjecture,
( inverse(sk_c5) = sk_c8
| inverse(sk_c8) = sk_c8 ),
inference(rw,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_112,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| inverse(sk_c6) = sk_c8 ),
prove_this_7 ).
cnf(c_0_113,negated_conjecture,
( inverse(sk_c8) = sk_c8
| multiply(sk_c5,X1) = X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_111]),c_0_97]) ).
cnf(c_0_114,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c8,multiply(sk_c6,sk_c8)) != sk_c9
| multiply(X1,sk_c8) != sk_c9
| multiply(X2,sk_c10) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| multiply(X5,sk_c10) != sk_c9
| inverse(X1) != sk_c8
| inverse(X2) != sk_c10
| inverse(X3) != sk_c8
| inverse(X4) != sk_c9
| inverse(X5) != sk_c10 ),
inference(spm,[status(thm)],[c_0_55,c_0_112]) ).
cnf(c_0_115,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c7 ),
prove_this_6 ).
cnf(c_0_116,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c8,sk_c7) = sk_c9 ),
prove_this_5 ).
cnf(c_0_117,negated_conjecture,
( multiply(inverse(sk_c5),X1) = X1
| inverse(sk_c8) = sk_c8 ),
inference(spm,[status(thm)],[c_0_30,c_0_113]) ).
cnf(c_0_118,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(X1,sk_c8) != sk_c9
| multiply(X2,sk_c10) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| multiply(X5,sk_c10) != sk_c9
| inverse(X1) != sk_c8
| inverse(X2) != sk_c10
| inverse(X3) != sk_c8
| inverse(X4) != sk_c9
| inverse(X5) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_116]) ).
cnf(c_0_119,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| inverse(sk_c5) = sk_c8 ),
prove_this_4 ).
cnf(c_0_120,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c9 ),
prove_this_3 ).
cnf(c_0_121,negated_conjecture,
( multiply(inverse(inverse(sk_c5)),X1) = X1
| inverse(sk_c8) = sk_c8 ),
inference(spm,[status(thm)],[c_0_30,c_0_117]) ).
cnf(c_0_122,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(X1,sk_c10) != sk_c9
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c10) != sk_c9
| inverse(X1) != sk_c10
| inverse(X2) != sk_c8
| inverse(X3) != sk_c9
| inverse(X4) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120]) ).
cnf(c_0_123,negated_conjecture,
( multiply(inverse(sk_c8),X1) = X1
| inverse(sk_c8) = sk_c8 ),
inference(spm,[status(thm)],[c_0_121,c_0_111]) ).
cnf(c_0_124,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(X1,sk_c9) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c10) != sk_c9
| inverse(X1) != sk_c8
| inverse(X2) != sk_c9
| inverse(X3) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_33]),c_0_31]) ).
cnf(c_0_125,negated_conjecture,
( multiply(inverse(inverse(sk_c8)),X1) = X1
| inverse(sk_c8) = sk_c8 ),
inference(spm,[status(thm)],[c_0_30,c_0_123]) ).
cnf(c_0_126,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c8
| multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c8) != sk_c8
| multiply(X3,sk_c10) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_87]),c_0_87]),c_0_87]),c_0_87]),c_0_87]) ).
cnf(c_0_127,negated_conjecture,
inverse(sk_c8) = sk_c8,
inference(spm,[status(thm)],[c_0_103,c_0_125]) ).
cnf(c_0_128,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c8
| multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c10) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_97])]) ).
cnf(c_0_129,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c8
| multiply(X1,sk_c10) != sk_c8
| inverse(X1) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_127]),c_0_97])]) ).
cnf(c_0_130,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c8
| inverse(sk_c4) = sk_c10 ),
inference(rw,[status(thm)],[c_0_33,c_0_87]) ).
cnf(c_0_131,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c8
| multiply(sk_c4,sk_c10) != sk_c8 ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_132,negated_conjecture,
multiply(sk_c1,sk_c10) = sk_c8,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_87]),c_0_87]),c_0_131]) ).
cnf(c_0_133,negated_conjecture,
multiply(inverse(sk_c1),sk_c8) = sk_c10,
inference(spm,[status(thm)],[c_0_30,c_0_132]) ).
cnf(c_0_134,negated_conjecture,
multiply(inverse(inverse(sk_c1)),sk_c10) = sk_c8,
inference(spm,[status(thm)],[c_0_30,c_0_133]) ).
cnf(c_0_135,negated_conjecture,
multiply(inverse(sk_c1),X1) = multiply(sk_c10,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_133]),c_0_97]) ).
cnf(c_0_136,negated_conjecture,
multiply(inverse(inverse(sk_c1)),multiply(sk_c10,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_134]),c_0_97]) ).
cnf(c_0_137,negated_conjecture,
multiply(sk_c10,multiply(sk_c1,X1)) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_135]) ).
cnf(c_0_138,plain,
multiply(inverse(inverse(X1)),sk_c8) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_103]) ).
cnf(c_0_139,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_30]) ).
cnf(c_0_140,negated_conjecture,
multiply(inverse(inverse(sk_c1)),X1) = multiply(sk_c1,X1),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_141,negated_conjecture,
( multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c8) != sk_c8
| multiply(X3,sk_c10) != sk_c8
| multiply(X4,sk_c8) != sk_c8
| multiply(X5,sk_c8) != sk_c8
| multiply(X6,sk_c10) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c10
| inverse(X4) != sk_c8
| inverse(X5) != sk_c8
| inverse(X6) != 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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_87]),c_0_87]),c_0_87]),c_0_87]),c_0_87]),c_0_87]),c_0_87]),c_0_97]) ).
cnf(c_0_142,plain,
multiply(X1,sk_c8) = X1,
inference(rw,[status(thm)],[c_0_138,c_0_139]) ).
cnf(c_0_143,negated_conjecture,
multiply(sk_c1,inverse(sk_c1)) = sk_c8,
inference(spm,[status(thm)],[c_0_103,c_0_140]) ).
cnf(c_0_144,negated_conjecture,
multiply(sk_c10,sk_c8) = sk_c10,
inference(rw,[status(thm)],[c_0_42,c_0_87]) ).
cnf(c_0_145,negated_conjecture,
( multiply(X1,sk_c10) != sk_c8
| multiply(X2,sk_c10) != sk_c8
| inverse(X1) != sk_c10
| inverse(X2) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_142]),c_0_142]),c_0_142]),c_0_142])])])])]),c_0_127])]) ).
cnf(c_0_146,negated_conjecture,
inverse(sk_c1) = sk_c10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_143]),c_0_135]),c_0_144]) ).
cnf(c_0_147,negated_conjecture,
( multiply(X1,sk_c10) != sk_c8
| inverse(X1) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_132])]) ).
cnf(c_0_148,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_146]),c_0_132])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP257-1 : TPTP v8.2.0. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 05:00:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.20/0.51 Running first-order model finding
% 0.20/0.51 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.84/0.60 # Version: 3.1.0
% 0.84/0.60 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.84/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.84/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.84/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.84/0.60 # Starting sh5l with 300s (1) cores
% 0.84/0.60 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 24719 completed with status 0
% 0.84/0.60 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.84/0.60 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.84/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.84/0.60 # No SInE strategy applied
% 0.84/0.60 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.84/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.84/0.60 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.84/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.84/0.60 # Starting new_bool_3 with 136s (1) cores
% 0.84/0.60 # Starting new_bool_1 with 136s (1) cores
% 0.84/0.60 # Starting sh5l with 136s (1) cores
% 0.84/0.60 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 24725 completed with status 0
% 0.84/0.60 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.84/0.60 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.84/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.84/0.60 # No SInE strategy applied
% 0.84/0.60 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.84/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.84/0.60 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.84/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.84/0.60 # Preprocessing time : 0.001 s
% 0.84/0.60 # Presaturation interreduction done
% 0.84/0.60
% 0.84/0.60 # Proof found!
% 0.84/0.60 # SZS status Unsatisfiable
% 0.84/0.60 # SZS output start CNFRefutation
% See solution above
% 0.84/0.60 # Parsed axioms : 46
% 0.84/0.60 # Removed by relevancy pruning/SinE : 0
% 0.84/0.60 # Initial clauses : 46
% 0.84/0.60 # Removed in clause preprocessing : 0
% 0.84/0.60 # Initial clauses in saturation : 46
% 0.84/0.60 # Processed clauses : 1087
% 0.84/0.60 # ...of these trivial : 59
% 0.84/0.60 # ...subsumed : 462
% 0.84/0.60 # ...remaining for further processing : 566
% 0.84/0.60 # Other redundant clauses eliminated : 20
% 0.84/0.60 # Clauses deleted for lack of memory : 0
% 0.84/0.60 # Backward-subsumed : 99
% 0.84/0.60 # Backward-rewritten : 357
% 0.84/0.60 # Generated clauses : 2999
% 0.84/0.60 # ...of the previous two non-redundant : 2554
% 0.84/0.60 # ...aggressively subsumed : 0
% 0.84/0.60 # Contextual simplify-reflections : 14
% 0.84/0.60 # Paramodulations : 2979
% 0.84/0.60 # Factorizations : 0
% 0.84/0.60 # NegExts : 0
% 0.84/0.60 # Equation resolutions : 20
% 0.84/0.60 # Disequality decompositions : 0
% 0.84/0.60 # Total rewrite steps : 2255
% 0.84/0.60 # ...of those cached : 2111
% 0.84/0.60 # Propositional unsat checks : 0
% 0.84/0.60 # Propositional check models : 0
% 0.84/0.60 # Propositional check unsatisfiable : 0
% 0.84/0.60 # Propositional clauses : 0
% 0.84/0.60 # Propositional clauses after purity: 0
% 0.84/0.60 # Propositional unsat core size : 0
% 0.84/0.60 # Propositional preprocessing time : 0.000
% 0.84/0.60 # Propositional encoding time : 0.000
% 0.84/0.60 # Propositional solver time : 0.000
% 0.84/0.60 # Success case prop preproc time : 0.000
% 0.84/0.60 # Success case prop encoding time : 0.000
% 0.84/0.60 # Success case prop solver time : 0.000
% 0.84/0.60 # Current number of processed clauses : 63
% 0.84/0.60 # Positive orientable unit clauses : 16
% 0.84/0.60 # Positive unorientable unit clauses: 0
% 0.84/0.60 # Negative unit clauses : 0
% 0.84/0.60 # Non-unit-clauses : 47
% 0.84/0.60 # Current number of unprocessed clauses: 823
% 0.84/0.60 # ...number of literals in the above : 4812
% 0.84/0.60 # Current number of archived formulas : 0
% 0.84/0.60 # Current number of archived clauses : 502
% 0.84/0.60 # Clause-clause subsumption calls (NU) : 7801
% 0.84/0.60 # Rec. Clause-clause subsumption calls : 5609
% 0.84/0.60 # Non-unit clause-clause subsumptions : 528
% 0.84/0.60 # Unit Clause-clause subsumption calls : 520
% 0.84/0.60 # Rewrite failures with RHS unbound : 0
% 0.84/0.60 # BW rewrite match attempts : 116
% 0.84/0.60 # BW rewrite match successes : 69
% 0.84/0.60 # Condensation attempts : 0
% 0.84/0.60 # Condensation successes : 0
% 0.84/0.60 # Termbank termtop insertions : 43480
% 0.84/0.60 # Search garbage collected termcells : 38
% 0.84/0.60
% 0.84/0.60 # -------------------------------------------------
% 0.84/0.60 # User time : 0.074 s
% 0.84/0.60 # System time : 0.002 s
% 0.84/0.60 # Total time : 0.076 s
% 0.84/0.60 # Maximum resident set size: 1664 pages
% 0.84/0.60
% 0.84/0.60 # -------------------------------------------------
% 0.84/0.60 # User time : 0.346 s
% 0.84/0.60 # System time : 0.011 s
% 0.84/0.60 # Total time : 0.357 s
% 0.84/0.60 # Maximum resident set size: 1760 pages
% 0.84/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------