%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP418-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 : n015.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:46 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 4 RR)
% Number of literals : 18 ( 17 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 15 ( 4 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 : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c_0_2,axiom,
inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),multiply(X4,X5)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(inverse(multiply(a1,inverse(multiply(inverse(inverse(X1)),inverse(multiply(a1,inverse(multiply(inverse(a1),a1)))))))),multiply(a1,a1)) = X1,
inference(rw,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),multiply(X4,X5)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_6,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(inverse(X2)),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)) = multiply(inverse(multiply(X4,inverse(multiply(X2,inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),multiply(X4,X5)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_3]),c_0_3]),c_0_6]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)) = multiply(inverse(multiply(inverse(multiply(X4,inverse(multiply(inverse(inverse(X5)),inverse(multiply(X6,inverse(multiply(inverse(X6),X6)))))))),inverse(multiply(X2,inverse(multiply(multiply(X4,X6),inverse(multiply(inverse(multiply(X4,X6)),multiply(X4,X6))))))))),X5),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
inverse(multiply(inverse(multiply(X1,multiply(inverse(multiply(a1,inverse(multiply(inverse(X2),inverse(multiply(a1,inverse(multiply(inverse(a1),a1)))))))),multiply(a1,a1)))),multiply(X1,X3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(inverse(inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))),inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),inverse(multiply(X2,inverse(multiply(multiply(X4,X5),inverse(multiply(inverse(multiply(X4,X5)),multiply(X4,X5)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_8]),c_0_6]),c_0_3]) ).
cnf(c_0_10,plain,
multiply(inverse(inverse(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,X3)))),inverse(multiply(X3,inverse(multiply(inverse(X3),X3))))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_9]),c_0_6]),c_0_6]) ).
cnf(c_0_11,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,X3)) = multiply(inverse(multiply(X4,inverse(X2))),multiply(X4,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_10]),c_0_6]) ).
cnf(c_0_12,plain,
multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(inverse(X2),X2)))))),multiply(X1,X3)) = multiply(inverse(X4),multiply(inverse(inverse(multiply(inverse(multiply(X5,inverse(X4))),multiply(X5,X2)))),X3)),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_14,plain,
multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(inverse(X2),X2)))))),multiply(X1,inverse(multiply(X2,inverse(multiply(inverse(X2),X2)))))) = multiply(inverse(X3),X3),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_13 ).
cnf(c_0_16,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_14]),c_0_10]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP418-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 : n015.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:16:20 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.15/0.47 % Version: 3.5.1
% 0.15/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 % Starting sh5l with 300s (1) cores
% 0.15/0.47 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3835655 completed with status 0
% 0.15/0.47 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.47 % No SInE strategy applied
% 0.15/0.47 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.15/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.47 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.47 % U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 3835662 completed with status 0
% 0.15/0.47 % Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.47 % No SInE strategy applied
% 0.15/0.47 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.15/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.47 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.47 % Preprocessing time : 0.001 s
% 0.15/0.47 % Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 % Proof found!
% 0.15/0.47 % SZS status Unsatisfiable
% 0.15/0.47 % SZS output start CNFRefutation
% See solution above
% 0.15/0.47 % Parsed axioms : 2
% 0.15/0.47 % Removed by relevancy pruning/SinE : 0
% 0.15/0.47 % Initial clauses : 2
% 0.15/0.47 % Removed in clause preprocessing : 0
% 0.15/0.47 % Initial clauses in saturation : 2
% 0.15/0.47 % Processed clauses : 88
% 0.15/0.47 % ...of these trivial : 18
% 0.15/0.47 % ...subsumed : 47
% 0.15/0.47 % ...remaining for further processing : 23
% 0.15/0.47 % Other redundant clauses eliminated : 0
% 0.15/0.47 % Clauses deleted for lack of memory : 0
% 0.15/0.47 % Backward-subsumed : 1
% 0.15/0.47 % Backward-rewritten : 7
% 0.15/0.47 % Generated clauses : 1380
% 0.15/0.47 % ...of the previous two non-redundant : 1158
% 0.15/0.47 % ...aggressively subsumed : 0
% 0.15/0.47 % Contextual simplify-reflections : 0
% 0.15/0.47 % Paramodulations : 1379
% 0.15/0.47 % Factorizations : 0
% 0.15/0.47 % NegExts : 0
% 0.15/0.47 % Equation resolutions : 0
% 0.15/0.47 % Disequality decompositions : 0
% 0.15/0.47 % Total rewrite steps : 372
% 0.15/0.47 % ...of those cached : 266
% 0.15/0.47 % Propositional unsat checks : 0
% 0.15/0.47 % Propositional check models : 0
% 0.15/0.47 % Propositional check unsatisfiable : 0
% 0.15/0.47 % Propositional clauses : 0
% 0.15/0.47 % Propositional clauses after purity: 0
% 0.15/0.47 % Propositional unsat core size : 0
% 0.15/0.47 % Propositional preprocessing time : 0.000
% 0.15/0.47 % Propositional encoding time : 0.000
% 0.15/0.47 % Propositional solver time : 0.000
% 0.15/0.47 % Success case prop preproc time : 0.000
% 0.15/0.47 % Success case prop encoding time : 0.000
% 0.15/0.47 % Success case prop solver time : 0.000
% 0.15/0.47 % Current number of processed clauses : 12
% 0.15/0.47 % Positive orientable unit clauses : 3
% 0.15/0.47 % Positive unorientable unit clauses: 9
% 0.15/0.47 % Negative unit clauses : 0
% 0.15/0.47 % Non-unit-clauses : 0
% 0.15/0.47 % Current number of unprocessed clauses: 1041
% 0.15/0.47 % ...number of literals in the above : 1041
% 0.15/0.47 % Current number of archived formulas : 0
% 0.15/0.47 % Current number of archived clauses : 11
% 0.15/0.47 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.47 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.47 % Non-unit clause-clause subsumptions : 0
% 0.15/0.47 % Unit Clause-clause subsumption calls : 47
% 0.15/0.47 % Rewrite failures with RHS unbound : 0
% 0.15/0.47 % BW rewrite match attempts : 182
% 0.15/0.47 % BW rewrite match successes : 57
% 0.15/0.47 % Condensation attempts : 0
% 0.15/0.47 % Condensation successes : 0
% 0.15/0.47 % Termbank termtop insertions : 80129
% 0.15/0.47 % Search garbage collected termcells : 2
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.035 s
% 0.15/0.47 % System time : 0.005 s
% 0.15/0.47 % Total time : 0.040 s
% 0.15/0.47 % Maximum resident set size: 3384 pages
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.180 s
% 0.15/0.47 % System time : 0.024 s
% 0.15/0.47 % Total time : 0.204 s
% 0.15/0.47 % Maximum resident set size: 4608 pages
% 0.15/0.47 % E exiting
%------------------------------------------------------------------------------