%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP059-1 : 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 : n004.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:46 PM UTC 2026
% Result : Unsatisfiable 1.06s 0.69s
% Output : CNFRefutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of clauses : 35 ( 31 unt; 0 nHn; 6 RR)
% Number of literals : 42 ( 41 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4)))) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(c_0_2,axiom,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4)))) = X3,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(multiply(multiply(X1,multiply(inverse(multiply(multiply(X2,X3),X1)),X2)),X3),multiply(X4,inverse(X4)))) = multiply(X5,inverse(X5)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),X3),multiply(X4,inverse(X4)))) = inverse(multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
inverse(multiply(multiply(inverse(multiply(multiply(X1,X2),inverse(multiply(X3,inverse(X3))))),X1),X2)) = multiply(X4,inverse(X4)),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
inverse(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),inverse(X2))) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_8,plain,
inverse(multiply(multiply(multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,inverse(X2)))),X3),multiply(X4,inverse(X4)))) = inverse(X3),
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_9,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,inverse(X1)),X2)),X3),inverse(X3)),multiply(X4,inverse(X4)))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_10,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),X2),multiply(X3,inverse(X3)))) = inverse(X2),
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_11,plain,
inverse(inverse(inverse(inverse(multiply(multiply(X1,inverse(X1)),X2))))) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
inverse(inverse(multiply(X1,inverse(X1)))) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_8]),c_0_11]) ).
cnf(c_0_13,plain,
inverse(multiply(inverse(inverse(multiply(X1,inverse(X1)))),X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_14,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_16,plain,
inverse(multiply(X1,multiply(X2,inverse(X2)))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_15]),c_0_13]) ).
cnf(c_0_17,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_14]) ).
cnf(c_0_18,plain,
inverse(multiply(multiply(inverse(X1),X2),inverse(X2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_16]),c_0_15]) ).
cnf(c_0_19,plain,
multiply(X1,inverse(multiply(X2,inverse(X2)))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_20,plain,
inverse(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2)) = X3,
inference(rw,[status(thm)],[c_0_2,c_0_16]) ).
cnf(c_0_21,plain,
multiply(inverse(multiply(X1,inverse(X1))),X2) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_22,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_19]),c_0_17]) ).
cnf(c_0_23,plain,
inverse(multiply(inverse(multiply(X1,X2)),X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_25,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
c_0_24 ).
cnf(c_0_27,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_28,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_25]),c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_30,plain,
multiply(inverse(X1),X1) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_4,c_0_22]) ).
cnf(c_0_31,plain,
inverse(multiply(multiply(X1,X2),X3)) = inverse(multiply(X1,multiply(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_28]),c_0_22]) ).
cnf(c_0_32,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_30]) ).
cnf(c_0_33,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_31]),c_0_22]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP059-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n004.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Sun Sep 20 19:56:05 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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
% 1.06/0.69 % Version: 3.5.1
% 1.06/0.69 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.06/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.69 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.06/0.69 % Starting new_bool_3 with 300s (1) cores
% 1.06/0.69 % Starting new_bool_1 with 300s (1) cores
% 1.06/0.69 % Starting sh5l with 300s (1) cores
% 1.06/0.69 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1350943 completed with status 0
% 1.06/0.69 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.06/0.69 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.06/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.69 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.06/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.06/0.69 % No SInE strategy applied
% 1.06/0.69 % Search class: FUHPF-FFSF21-DFFFFFNN
% 1.06/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.06/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.06/0.69 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.06/0.69 % Starting G-E--_208_C18_F1_SE_CS_SSP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.06/0.69 % Starting new_bool_3 with 136s (1) cores
% 1.06/0.69 % Starting new_bool_1 with 136s (1) cores
% 1.06/0.69 % new_bool_3 with pid 1350949 completed with status 0
% 1.06/0.69 % Result found by new_bool_3
% 1.06/0.69 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.06/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.69 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.06/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.06/0.69 % No SInE strategy applied
% 1.06/0.69 % Search class: FUHPF-FFSF21-DFFFFFNN
% 1.06/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.06/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.06/0.69 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.06/0.69 % Starting G-E--_208_C18_F1_SE_CS_SSP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.06/0.69 % Starting new_bool_3 with 136s (1) cores
% 1.06/0.69 % Preprocessing time : 0.002 s
% 1.06/0.69 % Presaturation interreduction done
% 1.06/0.69
% 1.06/0.69 % Proof found!
% 1.06/0.69 % SZS status Unsatisfiable
% 1.06/0.69 % SZS output start CNFRefutation
% See solution above
% 1.06/0.69 % Parsed axioms : 2
% 1.06/0.69 % Removed by relevancy pruning/SinE : 0
% 1.06/0.69 % Initial clauses : 2
% 1.06/0.69 % Removed in clause preprocessing : 0
% 1.06/0.69 % Initial clauses in saturation : 2
% 1.06/0.69 % Processed clauses : 207
% 1.06/0.69 % ...of these trivial : 50
% 1.06/0.69 % ...subsumed : 94
% 1.06/0.69 % ...remaining for further processing : 63
% 1.06/0.69 % Other redundant clauses eliminated : 0
% 1.06/0.69 % Clauses deleted for lack of memory : 0
% 1.06/0.69 % Backward-subsumed : 1
% 1.06/0.69 % Backward-rewritten : 46
% 1.06/0.69 % Generated clauses : 4561
% 1.06/0.69 % ...of the previous two non-redundant : 4089
% 1.06/0.69 % ...aggressively subsumed : 0
% 1.06/0.69 % Contextual simplify-reflections : 0
% 1.06/0.69 % Paramodulations : 4561
% 1.06/0.69 % Factorizations : 0
% 1.06/0.69 % NegExts : 0
% 1.06/0.69 % Equation resolutions : 0
% 1.06/0.69 % Disequality decompositions : 0
% 1.06/0.69 % Total rewrite steps : 3614
% 1.06/0.69 % ...of those cached : 2546
% 1.06/0.69 % Propositional unsat checks : 0
% 1.06/0.69 % Propositional check models : 0
% 1.06/0.69 % Propositional check unsatisfiable : 0
% 1.06/0.69 % Propositional clauses : 0
% 1.06/0.69 % Propositional clauses after purity: 0
% 1.06/0.69 % Propositional unsat core size : 0
% 1.06/0.69 % Propositional preprocessing time : 0.000
% 1.06/0.69 % Propositional encoding time : 0.000
% 1.06/0.69 % Propositional solver time : 0.000
% 1.06/0.69 % Success case prop preproc time : 0.000
% 1.06/0.69 % Success case prop encoding time : 0.000
% 1.06/0.69 % Success case prop solver time : 0.000
% 1.06/0.69 % Current number of processed clauses : 14
% 1.06/0.69 % Positive orientable unit clauses : 11
% 1.06/0.69 % Positive unorientable unit clauses: 3
% 1.06/0.69 % Negative unit clauses : 0
% 1.06/0.69 % Non-unit-clauses : 0
% 1.06/0.69 % Current number of unprocessed clauses: 3748
% 1.06/0.69 % ...number of literals in the above : 3748
% 1.06/0.69 % Current number of archived formulas : 0
% 1.06/0.69 % Current number of archived clauses : 49
% 1.06/0.69 % Clause-clause subsumption calls (NU) : 0
% 1.06/0.69 % Rec. Clause-clause subsumption calls : 0
% 1.06/0.69 % Non-unit clause-clause subsumptions : 0
% 1.06/0.69 % Unit Clause-clause subsumption calls : 70
% 1.06/0.69 % Rewrite failures with RHS unbound : 411
% 1.06/0.69 % BW rewrite match attempts : 268
% 1.06/0.69 % BW rewrite match successes : 107
% 1.06/0.69 % Condensation attempts : 0
% 1.06/0.69 % Condensation successes : 0
% 1.06/0.69 % Termbank termtop insertions : 90153
% 1.06/0.69 % Search garbage collected termcells : 8
% 1.06/0.69
% 1.06/0.69 % -------------------------------------------------
% 1.06/0.69 % User time : 0.112 s
% 1.06/0.69 % System time : 0.010 s
% 1.06/0.69 % Total time : 0.122 s
% 1.06/0.69 % Maximum resident set size: 3636 pages
% 1.06/0.69
% 1.06/0.69 % -------------------------------------------------
% 1.06/0.69 % User time : 0.536 s
% 1.06/0.69 % System time : 0.044 s
% 1.06/0.69 % Total time : 0.580 s
% 1.06/0.69 % Maximum resident set size: 4608 pages
% 1.06/0.69 % E exiting
%------------------------------------------------------------------------------