%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO068-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 : n010.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:07:04 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.49s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 4 RR)
% Number of literals : 25 ( 24 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 91 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(multiply(X1,inverse(X1),X2),inverse(multiply(multiply(X3,X4,X5),X6,multiply(X3,X4,X7))),multiply(X4,multiply(X7,X6,X5),X3)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_tba_axioms_2,negated_conjecture,
multiply(b,a,a) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_tba_axioms_2) ).
cnf(c_0_2,axiom,
multiply(multiply(X1,inverse(X1),X2),inverse(multiply(multiply(X3,X4,X5),X6,multiply(X3,X4,X7))),multiply(X4,multiply(X7,X6,X5),X3)) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(multiply(X1,inverse(X1),X2),inverse(multiply(multiply(X3,X4,multiply(X5,multiply(X6,X7,X8),X9)),inverse(multiply(multiply(X9,X5,X8),X7,multiply(X9,X5,X6))),multiply(X3,X4,multiply(X10,inverse(X10),X11)))),multiply(X4,X11,X3)) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(multiply(X1,X2,X3),inverse(multiply(multiply(X4,X5,X6),X7,multiply(X4,X5,X8))),multiply(X5,multiply(X8,X7,X6),X4)) = multiply(X2,multiply(X3,inverse(multiply(X1,X2,X9)),X9),X1),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_5,plain,
multiply(multiply(X1,inverse(X1),X2),inverse(multiply(X3,inverse(X3),multiply(X4,inverse(X4),X5))),multiply(inverse(X3),X5,X3)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_3]),c_0_2]) ).
cnf(c_0_6,plain,
multiply(inverse(X1),multiply(X2,inverse(multiply(X1,inverse(X1),X3)),X3),X1) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_7,plain,
multiply(inverse(X1),X2,X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_5]),c_0_2]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(multiply(X2,inverse(X2),X3)),X3) = X1,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
inverse(multiply(X1,inverse(X1),X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
multiply(X1,inverse(X2),X2) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
multiply(X1,inverse(X1),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_7]),c_0_9]),c_0_9]),c_0_10]) ).
cnf(c_0_12,plain,
multiply(multiply(X1,inverse(X1),X2),inverse(multiply(multiply(X3,inverse(X3),X4),inverse(multiply(X3,inverse(X3),X4)),multiply(X3,inverse(X3),X5))),X5) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_6]) ).
cnf(c_0_13,plain,
multiply(X1,multiply(X2,inverse(multiply(X3,X1,X4)),X4),X3) = multiply(X1,multiply(X2,inverse(multiply(X3,X1,X5)),X5),X3),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_14,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_15,plain,
multiply(multiply(X1,inverse(X1),X2),inverse(multiply(X3,inverse(X3),multiply(multiply(X3,inverse(X3),X4),inverse(multiply(X3,inverse(X3),X4)),X5))),X5) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_12]) ).
cnf(c_0_16,plain,
multiply(X1,multiply(multiply(X2,X1,X3),inverse(multiply(X2,X1,X4)),X4),X2) = multiply(X1,X3,X2),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_17,plain,
multiply(X1,X2,inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_18,plain,
multiply(multiply(X1,X2,X3),inverse(multiply(X4,inverse(X4),multiply(multiply(X4,inverse(X4),X5),inverse(multiply(X4,inverse(X4),X5)),X6))),X6) = multiply(X2,multiply(X3,inverse(multiply(X1,X2,X7)),X7),X1),
inference(spm,[status(thm)],[c_0_15,c_0_2]) ).
cnf(c_0_19,negated_conjecture,
multiply(b,a,a) != a,
inference(fof_simplification,[status(thm)],[prove_tba_axioms_2]) ).
cnf(c_0_20,plain,
multiply(X1,multiply(X1,inverse(multiply(X2,X1,X3)),X3),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_10]) ).
cnf(c_0_21,plain,
multiply(X1,multiply(X2,inverse(multiply(X3,X1,X4)),X4),X3) = multiply(X3,X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_9]),c_0_9]),c_0_11]),c_0_11]),c_0_10]) ).
cnf(c_0_22,negated_conjecture,
multiply(b,a,a) != a,
c_0_19 ).
cnf(c_0_23,plain,
multiply(X1,X2,X2) = X2,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : BOO068-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.11/0.38 % Computer : n010.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 13:52:25 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.11/0.49 % Version: 3.5.1
% 0.11/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.49 % Starting sh5l with 300s (1) cores
% 0.11/0.49 % new_bool_3 with pid 1028899 completed with status 9
% 0.11/0.49 % new_bool_1 with pid 1028900 completed with status 9
% 0.11/0.49 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1028898 completed with status 0
% 0.11/0.49 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.11/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.49 % No SInE strategy applied
% 0.11/0.49 % Search class: FUUPF-FFSF32-MFFFFFNN
% 0.11/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.49 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.49 % new_bool_3 with pid 1028908 completed with status 0
% 0.11/0.49 % Result found by new_bool_3
% 0.11/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.49 % No SInE strategy applied
% 0.11/0.49 % Search class: FUUPF-FFSF32-MFFFFFNN
% 0.11/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.49 % Preprocessing time : 0.001 s
% 0.11/0.49 % Presaturation interreduction done
% 0.11/0.49
% 0.11/0.49 % Proof found!
% 0.11/0.49 % SZS status Unsatisfiable
% 0.11/0.49 % SZS output start CNFRefutation
% See solution above
% 0.11/0.49 % Parsed axioms : 2
% 0.11/0.49 % Removed by relevancy pruning/SinE : 0
% 0.11/0.49 % Initial clauses : 2
% 0.11/0.49 % Removed in clause preprocessing : 0
% 0.11/0.49 % Initial clauses in saturation : 2
% 0.11/0.49 % Processed clauses : 52
% 0.11/0.49 % ...of these trivial : 7
% 0.11/0.49 % ...subsumed : 11
% 0.11/0.49 % ...remaining for further processing : 34
% 0.11/0.49 % Other redundant clauses eliminated : 0
% 0.11/0.49 % Clauses deleted for lack of memory : 0
% 0.11/0.49 % Backward-subsumed : 0
% 0.11/0.49 % Backward-rewritten : 22
% 0.11/0.49 % Generated clauses : 1585
% 0.11/0.49 % ...of the previous two non-redundant : 1442
% 0.11/0.49 % ...aggressively subsumed : 0
% 0.11/0.49 % Contextual simplify-reflections : 0
% 0.11/0.49 % Paramodulations : 1585
% 0.11/0.49 % Factorizations : 0
% 0.11/0.49 % NegExts : 0
% 0.11/0.49 % Equation resolutions : 0
% 0.11/0.49 % Disequality decompositions : 0
% 0.11/0.49 % Total rewrite steps : 484
% 0.11/0.49 % ...of those cached : 254
% 0.11/0.49 % Propositional unsat checks : 0
% 0.11/0.49 % Propositional check models : 0
% 0.11/0.49 % Propositional check unsatisfiable : 0
% 0.11/0.49 % Propositional clauses : 0
% 0.11/0.49 % Propositional clauses after purity: 0
% 0.11/0.49 % Propositional unsat core size : 0
% 0.11/0.49 % Propositional preprocessing time : 0.000
% 0.11/0.49 % Propositional encoding time : 0.000
% 0.11/0.49 % Propositional solver time : 0.000
% 0.11/0.49 % Success case prop preproc time : 0.000
% 0.11/0.49 % Success case prop encoding time : 0.000
% 0.11/0.49 % Success case prop solver time : 0.000
% 0.11/0.49 % Current number of processed clauses : 10
% 0.11/0.49 % Positive orientable unit clauses : 10
% 0.11/0.49 % Positive unorientable unit clauses: 0
% 0.11/0.49 % Negative unit clauses : 0
% 0.11/0.49 % Non-unit-clauses : 0
% 0.11/0.49 % Current number of unprocessed clauses: 1376
% 0.11/0.49 % ...number of literals in the above : 1376
% 0.11/0.49 % Current number of archived formulas : 0
% 0.11/0.49 % Current number of archived clauses : 24
% 0.11/0.49 % Clause-clause subsumption calls (NU) : 0
% 0.11/0.49 % Rec. Clause-clause subsumption calls : 0
% 0.11/0.49 % Non-unit clause-clause subsumptions : 0
% 0.11/0.49 % Unit Clause-clause subsumption calls : 8
% 0.11/0.49 % Rewrite failures with RHS unbound : 116
% 0.11/0.49 % BW rewrite match attempts : 186
% 0.11/0.49 % BW rewrite match successes : 36
% 0.11/0.49 % Condensation attempts : 0
% 0.11/0.49 % Condensation successes : 0
% 0.11/0.49 % Termbank termtop insertions : 42647
% 0.11/0.49 % Search garbage collected termcells : 2
% 0.11/0.49
% 0.11/0.49 % -------------------------------------------------
% 0.11/0.49 % User time : 0.031 s
% 0.11/0.49 % System time : 0.011 s
% 0.11/0.49 % Total time : 0.042 s
% 0.11/0.49 % Maximum resident set size: 3632 pages
% 0.11/0.49
% 0.11/0.49 % -------------------------------------------------
% 0.11/0.49 % User time : 0.201 s
% 0.11/0.49 % System time : 0.053 s
% 0.11/0.49 % Total time : 0.254 s
% 0.11/0.49 % Maximum resident set size: 4608 pages
% 0.11/0.49 % E exiting
%------------------------------------------------------------------------------