%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP002-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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.10s 1.02s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 6 RR)
% Number of literals : 37 ( 36 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 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(x_cubed_is_identity,hypothesis,
multiply(X1,multiply(X1,X1)) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_cubed_is_identity) ).
cnf(prove_commutator,negated_conjecture,
commutator(commutator(a,b),b) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_commutator) ).
cnf(commutator,axiom,
commutator(X1,X2) = multiply(X1,multiply(X2,multiply(inverse(X1),inverse(X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutator) ).
cnf(c_0_6,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_7,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_8,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_9,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_10,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_11,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_10]) ).
cnf(c_0_13,hypothesis,
multiply(X1,multiply(X1,X1)) = identity,
x_cubed_is_identity ).
cnf(c_0_14,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_15,hypothesis,
multiply(inverse(X1),identity) = multiply(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
commutator(commutator(a,b),b) != identity,
inference(fof_simplification,[status(thm)],[prove_commutator]) ).
cnf(c_0_17,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_18,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_19,hypothesis,
multiply(inverse(X1),inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
commutator(commutator(a,b),b) != identity,
c_0_16 ).
cnf(c_0_21,axiom,
commutator(X1,X2) = multiply(X1,multiply(X2,multiply(inverse(X1),inverse(X2)))),
commutator ).
cnf(c_0_22,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_23,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_17]),c_0_18]) ).
cnf(c_0_24,hypothesis,
multiply(X1,X1) = inverse(X1),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_25,negated_conjecture,
multiply(multiply(a,multiply(b,multiply(inverse(a),inverse(b)))),multiply(b,multiply(inverse(multiply(a,multiply(b,multiply(inverse(a),inverse(b))))),inverse(b)))) != identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).
cnf(c_0_26,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_9,c_0_23]) ).
cnf(c_0_28,hypothesis,
multiply(X1,multiply(X2,multiply(X1,X2))) = inverse(multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_24]) ).
cnf(c_0_29,hypothesis,
multiply(X1,multiply(X2,multiply(X1,multiply(X2,multiply(X1,X2))))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_6]),c_0_6]) ).
cnf(c_0_30,negated_conjecture,
multiply(a,multiply(b,multiply(inverse(a),multiply(inverse(multiply(a,multiply(b,multiply(inverse(a),inverse(b))))),inverse(b))))) != identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_6]),c_0_6]),c_0_6]),c_0_9]) ).
cnf(c_0_31,hypothesis,
multiply(inverse(X1),X2) = multiply(X1,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_24]) ).
cnf(c_0_32,plain,
inverse(multiply(X1,multiply(X2,inverse(X3)))) = multiply(X3,inverse(multiply(X1,X2))),
inference(spm,[status(thm)],[c_0_26,c_0_6]) ).
cnf(c_0_33,hypothesis,
multiply(inverse(X1),multiply(X2,X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_34,hypothesis,
inverse(multiply(X1,multiply(X2,X1))) = multiply(X2,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_28]),c_0_27]),c_0_6]) ).
cnf(c_0_35,hypothesis,
multiply(X1,multiply(X2,multiply(X3,multiply(X1,multiply(X2,multiply(X3,multiply(X1,multiply(X2,X3)))))))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_29]),c_0_6]),c_0_6]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27]),c_0_32]),c_0_6]),c_0_24]),c_0_6]),c_0_6]),c_0_33]),c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP002-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.95 % Computer : n002.cluster.edu
% 0.10/0.95 % Model : x86_64 x86_64
% 0.10/0.95 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.95 % Memory : 8046.5625MB
% 0.10/0.95 % OS : Linux 6.8.0-71-generic
% 0.10/0.95 % CPULimit : 300
% 0.10/0.95 % WCLimit : 300
% 0.10/0.95 % DateTime : Sun Sep 20 19:56:05 UTC 2026
% 0.10/0.95 % CPUTime :
% 0.10/0.95 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.99 Running first-order theorem proving
% 0.10/0.99 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.10/1.02 % Version: 3.5.1
% 0.10/1.02 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/1.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/1.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/1.02 % Starting new_bool_3 with 300s (1) cores
% 0.10/1.02 % Starting new_bool_1 with 300s (1) cores
% 0.10/1.02 % Starting sh5l with 300s (1) cores
% 0.10/1.02 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1562570 completed with status 0
% 0.10/1.02 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.10/1.02 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/1.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/1.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/1.02 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/1.02 % No SInE strategy applied
% 0.10/1.02 % Search class: FUUPM-FFSF21-DFFFFFNN
% 0.10/1.02 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/1.02 % Starting SubtermCWHack with 136s (1) cores
% 0.10/1.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/1.02 % Starting G-E--_201_C45_F1_AE_CS_SP_PI_S0Y with 136s (1) cores
% 0.10/1.02 % Starting new_bool_3 with 136s (1) cores
% 0.10/1.02 % Starting new_bool_1 with 136s (1) cores
% 0.10/1.02 % SubtermCWHack with pid 1562574 completed with status 0
% 0.10/1.02 % Result found by SubtermCWHack
% 0.10/1.02 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/1.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/1.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/1.02 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/1.02 % No SInE strategy applied
% 0.10/1.02 % Search class: FUUPM-FFSF21-DFFFFFNN
% 0.10/1.02 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/1.02 % Starting SubtermCWHack with 136s (1) cores
% 0.10/1.02 % Preprocessing time : 0.001 s
% 0.10/1.02
% 0.10/1.02 % Proof found!
% 0.10/1.02 % SZS status Unsatisfiable
% 0.10/1.02 % SZS output start CNFRefutation
% See solution above
% 0.10/1.02 % Parsed axioms : 6
% 0.10/1.02 % Removed by relevancy pruning/SinE : 0
% 0.10/1.02 % Initial clauses : 6
% 0.10/1.02 % Removed in clause preprocessing : 1
% 0.10/1.02 % Initial clauses in saturation : 5
% 0.10/1.02 % Processed clauses : 319
% 0.10/1.02 % ...of these trivial : 75
% 0.10/1.02 % ...subsumed : 191
% 0.10/1.02 % ...remaining for further processing : 52
% 0.10/1.02 % Other redundant clauses eliminated : 0
% 0.10/1.02 % Clauses deleted for lack of memory : 0
% 0.10/1.02 % Backward-subsumed : 0
% 0.10/1.02 % Backward-rewritten : 16
% 0.10/1.02 % Generated clauses : 2078
% 0.10/1.02 % ...of the previous two non-redundant : 963
% 0.10/1.02 % ...aggressively subsumed : 0
% 0.10/1.02 % Contextual simplify-reflections : 0
% 0.10/1.02 % Paramodulations : 2078
% 0.10/1.02 % Factorizations : 0
% 0.10/1.02 % NegExts : 0
% 0.10/1.02 % Equation resolutions : 0
% 0.10/1.02 % Disequality decompositions : 0
% 0.10/1.02 % Total rewrite steps : 6231
% 0.10/1.02 % ...of those cached : 4970
% 0.10/1.02 % Propositional unsat checks : 0
% 0.10/1.02 % Propositional check models : 0
% 0.10/1.02 % Propositional check unsatisfiable : 0
% 0.10/1.02 % Propositional clauses : 0
% 0.10/1.02 % Propositional clauses after purity: 0
% 0.10/1.02 % Propositional unsat core size : 0
% 0.10/1.02 % Propositional preprocessing time : 0.000
% 0.10/1.02 % Propositional encoding time : 0.000
% 0.10/1.02 % Propositional solver time : 0.000
% 0.10/1.02 % Success case prop preproc time : 0.000
% 0.10/1.02 % Success case prop encoding time : 0.000
% 0.10/1.02 % Success case prop solver time : 0.000
% 0.10/1.02 % Current number of processed clauses : 36
% 0.10/1.02 % Positive orientable unit clauses : 29
% 0.10/1.02 % Positive unorientable unit clauses: 4
% 0.10/1.02 % Negative unit clauses : 3
% 0.10/1.02 % Non-unit-clauses : 0
% 0.10/1.02 % Current number of unprocessed clauses: 585
% 0.10/1.02 % ...number of literals in the above : 585
% 0.10/1.02 % Current number of archived formulas : 0
% 0.10/1.02 % Current number of archived clauses : 17
% 0.10/1.02 % Clause-clause subsumption calls (NU) : 0
% 0.10/1.02 % Rec. Clause-clause subsumption calls : 0
% 0.10/1.02 % Non-unit clause-clause subsumptions : 0
% 0.10/1.02 % Unit Clause-clause subsumption calls : 12
% 0.10/1.02 % Rewrite failures with RHS unbound : 0
% 0.10/1.02 % BW rewrite match attempts : 187
% 0.10/1.02 % BW rewrite match successes : 32
% 0.10/1.02 % Condensation attempts : 0
% 0.10/1.02 % Condensation successes : 0
% 0.10/1.02 % Termbank termtop insertions : 23183
% 0.10/1.02 % Search garbage collected termcells : 2
% 0.10/1.02
% 0.10/1.02 % -------------------------------------------------
% 0.10/1.02 % User time : 0.012 s
% 0.10/1.02 % System time : 0.004 s
% 0.10/1.02 % Total time : 0.016 s
% 0.10/1.02 % Maximum resident set size: 3380 pages
% 0.10/1.02
% 0.10/1.02 % -------------------------------------------------
% 0.10/1.02 % User time : 0.055 s
% 0.10/1.02 % System time : 0.015 s
% 0.10/1.02 % Total time : 0.070 s
% 0.10/1.02 % Maximum resident set size: 4864 pages
% 0.10/1.02 % E exiting
%------------------------------------------------------------------------------