%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP435-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:39:48 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.47s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 2
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 4 RR)
% Number of literals : 41 ( 40 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 92 ( 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_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
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,
multiply(X1,inverse(X1)) = multiply(multiply(multiply(multiply(inverse(multiply(multiply(X2,X3),X4)),X2),X3),multiply(X5,inverse(X5))),X4),
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_9,plain,
multiply(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),inverse(X2)),multiply(X3,inverse(X3))) = multiply(X4,inverse(X4)),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_10,plain,
multiply(X1,inverse(X1)) = multiply(multiply(X2,inverse(X2)),inverse(multiply(X3,inverse(X3)))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
inverse(multiply(multiply(multiply(a3,inverse(a3)),X1),multiply(X2,inverse(X2)))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_7]),c_0_10]) ).
cnf(c_0_12,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),X2),multiply(X3,inverse(X3)))) = inverse(X2),
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
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_12]) ).
cnf(c_0_14,plain,
multiply(multiply(inverse(inverse(multiply(X1,inverse(X1)))),X2),inverse(X2)) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_13]),c_0_6]) ).
cnf(c_0_15,plain,
inverse(inverse(inverse(inverse(multiply(X1,inverse(X1)))))) = inverse(multiply(a3,inverse(a3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9]),c_0_9]) ).
cnf(c_0_16,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_17,plain,
inverse(multiply(multiply(a3,inverse(a3)),multiply(X1,inverse(X1)))) = inverse(inverse(multiply(a3,inverse(a3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
inverse(inverse(inverse(inverse(multiply(multiply(X1,inverse(X1)),X2))))) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_19,plain,
inverse(inverse(multiply(a3,inverse(a3)))) = multiply(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_17]),c_0_14]),c_0_17]) ).
cnf(c_0_20,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13]) ).
cnf(c_0_21,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_22,plain,
inverse(multiply(X1,multiply(X2,inverse(X2)))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_21]),c_0_13]) ).
cnf(c_0_23,plain,
inverse(multiply(multiply(inverse(X1),X2),inverse(X2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_22]),c_0_21]) ).
cnf(c_0_24,plain,
inverse(multiply(X1,inverse(X1))) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_21]),c_0_6]) ).
cnf(c_0_25,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_22]),c_0_20]) ).
cnf(c_0_26,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_25]) ).
cnf(c_0_27,plain,
inverse(multiply(multiply(X1,X2),inverse(X2))) = inverse(X1),
inference(spm,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_28,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_26]) ).
cnf(c_0_29,plain,
multiply(multiply(inverse(multiply(X1,X2)),X1),X2) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_6]),c_0_24]),c_0_24]),c_0_25]) ).
cnf(c_0_30,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]) ).
cnf(c_0_31,plain,
multiply(multiply(X1,inverse(X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_32,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_30]),c_0_26]) ).
cnf(c_0_33,plain,
inverse(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2)) = X3,
inference(rw,[status(thm)],[c_0_2,c_0_22]) ).
cnf(c_0_34,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_36,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_28]),c_0_26]) ).
cnf(c_0_37,plain,
multiply(inverse(X1),multiply(multiply(X1,X2),X3)) = multiply(X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_35 ).
cnf(c_0_39,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_26]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP435-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n005.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 20:13:02 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.24/0.47 % Version: 3.5.1
% 0.24/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.47 % Starting sh5l with 300s (1) cores
% 0.24/0.47 % new_bool_1 with pid 1665789 completed with status 9
% 0.24/0.47 % new_bool_3 with pid 1665788 completed with status 9
% 0.24/0.47 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1665787 completed with status 0
% 0.24/0.47 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.24/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.47 % No SInE strategy applied
% 0.24/0.47 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.24/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.24/0.47 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.47 % U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1665793 completed with status 0
% 0.24/0.47 % Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.47 % No SInE strategy applied
% 0.24/0.47 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.24/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.24/0.47 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/0.47 % Preprocessing time : 0.001 s
% 0.24/0.47 % Presaturation interreduction done
% 0.24/0.47
% 0.24/0.47 % Proof found!
% 0.24/0.47 % SZS status Unsatisfiable
% 0.24/0.47 % SZS output start CNFRefutation
% See solution above
% 0.24/0.47 % Parsed axioms : 2
% 0.24/0.47 % Removed by relevancy pruning/SinE : 0
% 0.24/0.47 % Initial clauses : 2
% 0.24/0.47 % Removed in clause preprocessing : 0
% 0.24/0.47 % Initial clauses in saturation : 2
% 0.24/0.47 % Processed clauses : 354
% 0.24/0.47 % ...of these trivial : 50
% 0.24/0.47 % ...subsumed : 253
% 0.24/0.47 % ...remaining for further processing : 51
% 0.24/0.47 % Other redundant clauses eliminated : 0
% 0.24/0.47 % Clauses deleted for lack of memory : 0
% 0.24/0.47 % Backward-subsumed : 0
% 0.24/0.47 % Backward-rewritten : 37
% 0.24/0.47 % Generated clauses : 2617
% 0.24/0.47 % ...of the previous two non-redundant : 2215
% 0.24/0.47 % ...aggressively subsumed : 0
% 0.24/0.47 % Contextual simplify-reflections : 0
% 0.24/0.47 % Paramodulations : 2617
% 0.24/0.47 % Factorizations : 0
% 0.24/0.47 % NegExts : 0
% 0.24/0.47 % Equation resolutions : 0
% 0.24/0.47 % Disequality decompositions : 0
% 0.24/0.47 % Total rewrite steps : 1949
% 0.24/0.47 % ...of those cached : 1557
% 0.24/0.47 % Propositional unsat checks : 0
% 0.24/0.47 % Propositional check models : 0
% 0.24/0.47 % Propositional check unsatisfiable : 0
% 0.24/0.47 % Propositional clauses : 0
% 0.24/0.47 % Propositional clauses after purity: 0
% 0.24/0.47 % Propositional unsat core size : 0
% 0.24/0.47 % Propositional preprocessing time : 0.000
% 0.24/0.47 % Propositional encoding time : 0.000
% 0.24/0.47 % Propositional solver time : 0.000
% 0.24/0.47 % Success case prop preproc time : 0.000
% 0.24/0.47 % Success case prop encoding time : 0.000
% 0.24/0.47 % Success case prop solver time : 0.000
% 0.24/0.47 % Current number of processed clauses : 12
% 0.24/0.47 % Positive orientable unit clauses : 11
% 0.24/0.47 % Positive unorientable unit clauses: 1
% 0.24/0.47 % Negative unit clauses : 0
% 0.24/0.47 % Non-unit-clauses : 0
% 0.24/0.47 % Current number of unprocessed clauses: 1650
% 0.24/0.47 % ...number of literals in the above : 1650
% 0.24/0.47 % Current number of archived formulas : 0
% 0.24/0.47 % Current number of archived clauses : 39
% 0.24/0.47 % Clause-clause subsumption calls (NU) : 0
% 0.24/0.47 % Rec. Clause-clause subsumption calls : 0
% 0.24/0.47 % Non-unit clause-clause subsumptions : 0
% 0.24/0.47 % Unit Clause-clause subsumption calls : 33
% 0.24/0.47 % Rewrite failures with RHS unbound : 0
% 0.24/0.47 % BW rewrite match attempts : 174
% 0.24/0.47 % BW rewrite match successes : 96
% 0.24/0.47 % Condensation attempts : 0
% 0.24/0.47 % Condensation successes : 0
% 0.24/0.47 % Termbank termtop insertions : 43433
% 0.24/0.47 % Search garbage collected termcells : 2
% 0.24/0.47
% 0.24/0.47 % -------------------------------------------------
% 0.24/0.47 % User time : 0.031 s
% 0.24/0.47 % System time : 0.004 s
% 0.24/0.47 % Total time : 0.035 s
% 0.24/0.47 % Maximum resident set size: 3632 pages
% 0.24/0.47
% 0.24/0.47 % -------------------------------------------------
% 0.24/0.47 % User time : 0.162 s
% 0.24/0.47 % System time : 0.046 s
% 0.24/0.47 % Total time : 0.208 s
% 0.24/0.47 % Maximum resident set size: 4608 pages
% 0.24/0.47 % E exiting
%------------------------------------------------------------------------------