%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP002-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:37:24 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 12
% Syntax : Number of clauses : 72 ( 72 unt; 0 nHn; 47 RR)
% Number of literals : 72 ( 71 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 37 ( 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(x_cubed_is_identity,hypothesis,
multiply(X1,multiply(X1,X1)) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_cubed_is_identity) ).
cnf(right_identity,axiom,
multiply(X1,identity) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_identity) ).
cnf(d_times_inverse_b_is_h,negated_conjecture,
multiply(d,inverse(b)) = h,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_times_inverse_b_is_h) ).
cnf(right_inverse,axiom,
multiply(X1,inverse(X1)) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_inverse) ).
cnf(h_times_b_is_j,negated_conjecture,
multiply(h,b) = j,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_times_b_is_j) ).
cnf(a_times_b_is_c,negated_conjecture,
multiply(a,b) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b_is_c) ).
cnf(c_times_inverse_a_is_d,negated_conjecture,
multiply(c,inverse(a)) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_times_inverse_a_is_d) ).
cnf(j_times_inverse_h_is_k,negated_conjecture,
multiply(j,inverse(h)) = k,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',j_times_inverse_h_is_k) ).
cnf(prove_k_times_inverse_b_is_e,negated_conjecture,
multiply(k,inverse(b)) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_k_times_inverse_b_is_e) ).
cnf(c_0_12,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_13,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_14,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_15,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,hypothesis,
multiply(X1,multiply(X1,X1)) = identity,
x_cubed_is_identity ).
cnf(c_0_17,axiom,
multiply(X1,identity) = X1,
right_identity ).
cnf(c_0_18,negated_conjecture,
multiply(d,inverse(b)) = h,
d_times_inverse_b_is_h ).
cnf(c_0_19,hypothesis,
inverse(X1) = multiply(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,axiom,
multiply(X1,inverse(X1)) = identity,
right_inverse ).
cnf(c_0_21,negated_conjecture,
multiply(d,multiply(b,b)) = h,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_13]),c_0_17]) ).
cnf(c_0_23,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_24,negated_conjecture,
multiply(d,multiply(d,h)) = multiply(b,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_19]),c_0_12]) ).
cnf(c_0_25,hypothesis,
inverse(multiply(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
multiply(h,b) = j,
h_times_b_is_j ).
cnf(c_0_27,negated_conjecture,
multiply(d,multiply(d,j)) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_12]),c_0_26]) ).
cnf(c_0_28,negated_conjecture,
multiply(d,d) = multiply(d,j),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_27]),c_0_19]),c_0_17]) ).
cnf(c_0_29,hypothesis,
inverse(multiply(d,j)) = d,
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_30,hypothesis,
multiply(d,multiply(j,d)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_29]),c_0_12]) ).
cnf(c_0_31,hypothesis,
multiply(d,j) = multiply(j,d),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_30]),c_0_19]),c_0_28]),c_0_17]) ).
cnf(c_0_32,negated_conjecture,
multiply(a,b) = c,
a_times_b_is_c ).
cnf(c_0_33,negated_conjecture,
multiply(c,inverse(a)) = d,
c_times_inverse_a_is_d ).
cnf(c_0_34,negated_conjecture,
multiply(d,d) = multiply(j,d),
inference(rw,[status(thm)],[c_0_28,c_0_31]) ).
cnf(c_0_35,hypothesis,
multiply(X1,multiply(X2,multiply(X1,multiply(X2,multiply(X1,X2))))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_12]),c_0_12]) ).
cnf(c_0_36,negated_conjecture,
multiply(a,multiply(b,X1)) = multiply(c,X1),
inference(spm,[status(thm)],[c_0_12,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
multiply(c,multiply(a,a)) = d,
inference(rw,[status(thm)],[c_0_33,c_0_19]) ).
cnf(c_0_38,negated_conjecture,
d = j,
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_15,c_0_34]),c_0_19]),c_0_28]),c_0_31]),c_0_12]),c_0_30]),c_0_17]) ).
cnf(c_0_39,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3))) = X3,
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_40,hypothesis,
multiply(b,multiply(c,multiply(c,a))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_36]) ).
cnf(c_0_41,negated_conjecture,
multiply(c,multiply(a,a)) = j,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,hypothesis,
inverse(multiply(b,c)) = multiply(c,a),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_17]) ).
cnf(c_0_43,negated_conjecture,
multiply(inverse(multiply(c,a)),j) = a,
inference(spm,[status(thm)],[c_0_39,c_0_41]) ).
cnf(c_0_44,hypothesis,
inverse(multiply(c,a)) = multiply(b,c),
inference(spm,[status(thm)],[c_0_22,c_0_42]) ).
cnf(c_0_45,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_23]),c_0_17]) ).
cnf(c_0_46,negated_conjecture,
multiply(c,multiply(c,d)) = multiply(a,a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_37]),c_0_19]),c_0_12]) ).
cnf(c_0_47,negated_conjecture,
multiply(j,inverse(h)) = k,
j_times_inverse_h_is_k ).
cnf(c_0_48,negated_conjecture,
multiply(inverse(a),c) = b,
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_49,negated_conjecture,
multiply(h,multiply(b,X1)) = multiply(j,X1),
inference(spm,[status(thm)],[c_0_12,c_0_26]) ).
cnf(c_0_50,negated_conjecture,
multiply(b,multiply(c,j)) = a,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_12]) ).
cnf(c_0_51,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_45]),c_0_22]) ).
cnf(c_0_52,negated_conjecture,
multiply(c,multiply(c,j)) = multiply(a,a),
inference(spm,[status(thm)],[c_0_46,c_0_38]) ).
cnf(c_0_53,negated_conjecture,
multiply(j,multiply(h,h)) = k,
inference(rw,[status(thm)],[c_0_47,c_0_19]) ).
cnf(c_0_54,negated_conjecture,
multiply(a,multiply(a,c)) = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_19]),c_0_12]) ).
cnf(c_0_55,hypothesis,
multiply(X1,multiply(X2,multiply(X1,X2))) = inverse(multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_56,negated_conjecture,
multiply(j,multiply(c,j)) = multiply(h,a),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
inverse(multiply(c,j)) = multiply(a,c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_25]) ).
cnf(c_0_58,negated_conjecture,
multiply(j,multiply(j,c)) = a,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_41]),c_0_19]),c_0_12]),c_0_25]) ).
cnf(c_0_59,negated_conjecture,
multiply(k,multiply(k,j)) = h,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_53]),c_0_25]),c_0_19]),c_0_12]) ).
cnf(c_0_60,negated_conjecture,
multiply(a,multiply(a,multiply(c,X1))) = multiply(b,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_54]),c_0_12]) ).
cnf(c_0_61,hypothesis,
multiply(c,multiply(h,a)) = multiply(a,c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_62,negated_conjecture,
multiply(j,a) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_58]),c_0_25]) ).
cnf(c_0_63,negated_conjecture,
multiply(k,h) = j,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_59]),c_0_25]) ).
cnf(c_0_64,negated_conjecture,
multiply(k,inverse(b)) != identity,
inference(fof_simplification,[status(thm)],[prove_k_times_inverse_b_is_e]) ).
cnf(c_0_65,negated_conjecture,
multiply(b,multiply(h,a)) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_54]),c_0_32]) ).
cnf(c_0_66,negated_conjecture,
multiply(a,multiply(c,c)) = multiply(j,j),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_62]),c_0_19]),c_0_19]) ).
cnf(c_0_67,negated_conjecture,
multiply(h,multiply(j,j)) = multiply(k,k),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_63]),c_0_19]),c_0_19]) ).
cnf(c_0_68,negated_conjecture,
multiply(k,inverse(b)) != identity,
c_0_64 ).
cnf(c_0_69,negated_conjecture,
multiply(k,k) = multiply(b,b),
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_45,c_0_65]),c_0_19]),c_0_12]),c_0_66]),c_0_67]),c_0_19]) ).
cnf(c_0_70,negated_conjecture,
multiply(k,multiply(b,b)) != identity,
inference(rw,[status(thm)],[c_0_68,c_0_19]) ).
cnf(c_0_71,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_69]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP002-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n002.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 19:55:47 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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/benchmark/theBenchmark.p
% 0.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % new_bool_1 with pid 1561848 completed with status 0
% 0.14/0.44 % Result found by new_bool_1
% 0.14/0.44 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FUUPM-FFSS21-SFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 1561851 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FUUPM-FFSS21-SFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % Preprocessing time : 0.001 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Unsatisfiable
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 12
% 0.14/0.44 % Removed by relevancy pruning/SinE : 0
% 0.14/0.44 % Initial clauses : 12
% 0.14/0.44 % Removed in clause preprocessing : 0
% 0.14/0.44 % Initial clauses in saturation : 12
% 0.14/0.44 % Processed clauses : 200
% 0.14/0.44 % ...of these trivial : 74
% 0.14/0.44 % ...subsumed : 25
% 0.14/0.44 % ...remaining for further processing : 101
% 0.14/0.44 % Other redundant clauses eliminated : 0
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 0
% 0.14/0.44 % Backward-rewritten : 27
% 0.14/0.44 % Generated clauses : 1704
% 0.14/0.44 % ...of the previous two non-redundant : 989
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 0
% 0.14/0.44 % Paramodulations : 1704
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 0
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 3607
% 0.14/0.44 % ...of those cached : 2704
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 74
% 0.14/0.44 % Positive orientable unit clauses : 71
% 0.14/0.44 % Positive unorientable unit clauses: 2
% 0.14/0.44 % Negative unit clauses : 1
% 0.14/0.44 % Non-unit-clauses : 0
% 0.14/0.44 % Current number of unprocessed clauses: 756
% 0.14/0.44 % ...number of literals in the above : 756
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 27
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.44 % Non-unit clause-clause subsumptions : 0
% 0.14/0.44 % Unit Clause-clause subsumption calls : 5
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 112
% 0.14/0.44 % BW rewrite match successes : 37
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 19828
% 0.14/0.44 % Search garbage collected termcells : 2
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.010 s
% 0.14/0.44 % System time : 0.004 s
% 0.14/0.44 % Total time : 0.013 s
% 0.14/0.44 % Maximum resident set size: 3636 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.012 s
% 0.14/0.44 % System time : 0.008 s
% 0.14/0.44 % Total time : 0.020 s
% 0.14/0.44 % Maximum resident set size: 4864 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------