%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP410-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 : n006.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:43:34 PM UTC 2026
% Result : Unsatisfiable 1.09s 0.72s
% Output : CNFRefutation 1.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 8 RR)
% Number of literals : 30 ( 29 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 15 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 83 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))),inverse(multiply(inverse(X3),X3))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_0_2,axiom,
multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))),inverse(multiply(inverse(X3),X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(inverse(multiply(inverse(X3),X3))))),inverse(multiply(inverse(inverse(multiply(inverse(X3),X3))),inverse(multiply(inverse(X3),X3))))) = multiply(inverse(multiply(X4,inverse(multiply(X2,X3)))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))) = multiply(inverse(multiply(X4,inverse(multiply(X2,X3)))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,inverse(multiply(multiply(X2,inverse(multiply(inverse(X3),X3))),X3)))),multiply(X1,inverse(X3))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(multiply(X3,inverse(X4))))) = multiply(inverse(multiply(X5,inverse(X2))),multiply(X5,inverse(multiply(X3,inverse(X4))))),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(X3))) = multiply(inverse(multiply(X4,inverse(X2))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_6,c_0_2]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(multiply(inverse(X3),X3)))) = multiply(inverse(multiply(multiply(inverse(multiply(X4,inverse(multiply(X5,X3)))),multiply(X4,inverse(X3))),inverse(X2))),X5),
inference(spm,[status(thm)],[c_0_7,c_0_2]) ).
cnf(c_0_9,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X2)))),multiply(X1,inverse(multiply(inverse(X2),X2)))) = multiply(inverse(X3),X3),
inference(spm,[status(thm)],[c_0_8,c_0_2]) ).
cnf(c_0_10,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_2]) ).
cnf(c_0_11,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_12,plain,
multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))),inverse(multiply(inverse(X4),X4))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
c_0_11 ).
cnf(c_0_14,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X2)))),multiply(X1,inverse(multiply(inverse(X3),X3)))) = multiply(inverse(X4),X4),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
multiply(multiply(inverse(X1),X1),a2) != a2,
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_16,plain,
multiply(multiply(inverse(multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(X3,X4))))))),multiply(X1,inverse(inverse(multiply(inverse(b2),b2))))),inverse(multiply(inverse(b2),b2))) = multiply(inverse(multiply(X5,inverse(multiply(multiply(inverse(multiply(X6,inverse(X3))),multiply(X6,inverse(inverse(multiply(inverse(X4),X4))))),inverse(multiply(inverse(b2),b2)))))),multiply(X5,inverse(multiply(X2,inverse(X4))))),
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_3,c_0_3]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_17,plain,
multiply(inverse(multiply(X1,inverse(multiply(multiply(inverse(X2),X2),X3)))),multiply(X1,inverse(X3))) = inverse(inverse(multiply(inverse(X3),X3))),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_18,plain,
multiply(inverse(multiply(X1,inverse(multiply(multiply(X2,inverse(multiply(inverse(X3),X3))),X4)))),multiply(X1,inverse(X4))) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_19,plain,
multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(X2),X2))) = inverse(multiply(inverse(X3),X3)),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
multiply(multiply(multiply(inverse(multiply(X1,inverse(inverse(multiply(multiply(inverse(multiply(X2,inverse(X3))),multiply(X2,inverse(inverse(multiply(inverse(b2),b2))))),inverse(multiply(X3,multiply(inverse(b2),b2)))))))),multiply(X1,inverse(inverse(multiply(inverse(b2),b2))))),inverse(multiply(inverse(b2),b2))),a2) != a2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_10]) ).
cnf(c_0_21,plain,
multiply(inverse(multiply(inverse(X1),X1)),multiply(inverse(inverse(multiply(multiply(inverse(X2),X2),X3))),inverse(X3))) = inverse(inverse(multiply(inverse(X3),X3))),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_22,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(X2),X2)),X3)))),multiply(X1,inverse(X3))) = multiply(inverse(X4),X4),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
multiply(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X2)))),multiply(X1,inverse(X3))),inverse(multiply(inverse(X4),X4))) = inverse(X3),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_24,negated_conjecture,
multiply(inverse(multiply(inverse(b2),b2)),a2) != a2,
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_20,c_0_21]),c_0_10]),c_0_19]),c_0_10]),c_0_10]),c_0_10]),c_0_19]) ).
cnf(c_0_25,plain,
multiply(multiply(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(inverse(multiply(inverse(b2),b2))))),inverse(multiply(inverse(b2),b2))),inverse(multiply(inverse(b2),b2))) = X2,
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_3,c_0_3]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_5]) ).
cnf(c_0_26,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(X2),X2)),X3)))) = inverse(multiply(X1,inverse(X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_22]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
multiply(inverse(multiply(inverse(X1),X1)),a2) != a2,
inference(spm,[status(thm)],[c_0_24,c_0_10]) ).
cnf(c_0_28,plain,
multiply(inverse(multiply(inverse(X1),X1)),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_25]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP410-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n006.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Sun Sep 20 20:12:12 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.09/0.72 % Version: 3.5.1
% 1.09/0.72 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.09/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.09/0.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.09/0.72 % Starting new_bool_3 with 300s (1) cores
% 1.09/0.72 % Starting new_bool_1 with 300s (1) cores
% 1.09/0.72 % Starting sh5l with 300s (1) cores
% 1.09/0.72 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1162464 completed with status 0
% 1.09/0.72 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.09/0.72 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.09/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.09/0.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.09/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.09/0.72 % No SInE strategy applied
% 1.09/0.72 % Search class: FUUPF-FFSF21-DFFFFFNN
% 1.09/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.09/0.72 % Starting SubtermCWHack with 136s (1) cores
% 1.09/0.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.09/0.72 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.09/0.72 % Starting new_bool_3 with 136s (1) cores
% 1.09/0.72 % Starting new_bool_1 with 136s (1) cores
% 1.09/0.72 % U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1162470 completed with status 0
% 1.09/0.72 % Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 1.09/0.72 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.09/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.09/0.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.09/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.09/0.72 % No SInE strategy applied
% 1.09/0.72 % Search class: FUUPF-FFSF21-DFFFFFNN
% 1.09/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.09/0.72 % Starting SubtermCWHack with 136s (1) cores
% 1.09/0.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.09/0.72 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.09/0.72 % Preprocessing time : 0.002 s
% 1.09/0.72 % Presaturation interreduction done
% 1.09/0.72
% 1.09/0.72 % Proof found!
% 1.09/0.72 % SZS status Unsatisfiable
% 1.09/0.72 % SZS output start CNFRefutation
% See solution above
% 1.09/0.72 % Parsed axioms : 2
% 1.09/0.72 % Removed by relevancy pruning/SinE : 0
% 1.09/0.72 % Initial clauses : 2
% 1.09/0.72 % Removed in clause preprocessing : 0
% 1.09/0.72 % Initial clauses in saturation : 2
% 1.09/0.72 % Processed clauses : 799
% 1.09/0.72 % ...of these trivial : 58
% 1.09/0.72 % ...subsumed : 672
% 1.09/0.72 % ...remaining for further processing : 69
% 1.09/0.72 % Other redundant clauses eliminated : 0
% 1.09/0.72 % Clauses deleted for lack of memory : 0
% 1.09/0.72 % Backward-subsumed : 11
% 1.09/0.72 % Backward-rewritten : 16
% 1.09/0.72 % Generated clauses : 5769
% 1.09/0.72 % ...of the previous two non-redundant : 5228
% 1.09/0.72 % ...aggressively subsumed : 0
% 1.09/0.72 % Contextual simplify-reflections : 0
% 1.09/0.72 % Paramodulations : 5769
% 1.09/0.72 % Factorizations : 0
% 1.09/0.72 % NegExts : 0
% 1.09/0.72 % Equation resolutions : 0
% 1.09/0.72 % Disequality decompositions : 0
% 1.09/0.72 % Total rewrite steps : 3467
% 1.09/0.72 % ...of those cached : 2989
% 1.09/0.72 % Propositional unsat checks : 0
% 1.09/0.72 % Propositional check models : 0
% 1.09/0.72 % Propositional check unsatisfiable : 0
% 1.09/0.72 % Propositional clauses : 0
% 1.09/0.72 % Propositional clauses after purity: 0
% 1.09/0.72 % Propositional unsat core size : 0
% 1.09/0.72 % Propositional preprocessing time : 0.000
% 1.09/0.72 % Propositional encoding time : 0.000
% 1.09/0.72 % Propositional solver time : 0.000
% 1.09/0.72 % Success case prop preproc time : 0.000
% 1.09/0.72 % Success case prop encoding time : 0.000
% 1.09/0.72 % Success case prop solver time : 0.000
% 1.09/0.72 % Current number of processed clauses : 40
% 1.09/0.72 % Positive orientable unit clauses : 20
% 1.09/0.72 % Positive unorientable unit clauses: 9
% 1.09/0.72 % Negative unit clauses : 11
% 1.09/0.72 % Non-unit-clauses : 0
% 1.09/0.72 % Current number of unprocessed clauses: 3807
% 1.09/0.72 % ...number of literals in the above : 3807
% 1.09/0.72 % Current number of archived formulas : 0
% 1.09/0.72 % Current number of archived clauses : 29
% 1.09/0.72 % Clause-clause subsumption calls (NU) : 0
% 1.09/0.72 % Rec. Clause-clause subsumption calls : 0
% 1.09/0.72 % Non-unit clause-clause subsumptions : 0
% 1.09/0.72 % Unit Clause-clause subsumption calls : 165
% 1.09/0.72 % Rewrite failures with RHS unbound : 0
% 1.09/0.72 % BW rewrite match attempts : 549
% 1.09/0.72 % BW rewrite match successes : 72
% 1.09/0.72 % Condensation attempts : 0
% 1.09/0.72 % Condensation successes : 0
% 1.09/0.72 % Termbank termtop insertions : 248853
% 1.09/0.72 % Search garbage collected termcells : 2
% 1.09/0.72
% 1.09/0.72 % -------------------------------------------------
% 1.09/0.72 % User time : 0.117 s
% 1.09/0.72 % System time : 0.010 s
% 1.09/0.72 % Total time : 0.127 s
% 1.09/0.72 % Maximum resident set size: 3376 pages
% 1.09/0.72
% 1.09/0.72 % -------------------------------------------------
% 1.09/0.72 % User time : 0.564 s
% 1.09/0.72 % System time : 0.043 s
% 1.09/0.72 % Total time : 0.607 s
% 1.09/0.72 % Maximum resident set size: 4864 pages
% 1.09/0.72 % E exiting
%------------------------------------------------------------------------------