%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO035-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:02 PM UTC 2026
% Result : Unsatisfiable 0.78s 0.60s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of clauses : 34 ( 27 unt; 0 nHn; 9 RR)
% Number of literals : 54 ( 53 equ; 28 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 103 ( 2 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,negated_conjecture,
( multiply(inverse(b),b,a) != a
| multiply(a,a,b) != a
| multiply(a,b,inverse(b)) != a
| multiply(b,a,a) != a
| multiply(multiply(d,e,a),b,multiply(d,e,c)) != multiply(d,e,multiply(a,b,c)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_tba_axioms) ).
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,negated_conjecture,
( multiply(inverse(b),b,a) != a
| multiply(a,a,b) != a
| multiply(a,b,inverse(b)) != a
| multiply(b,a,a) != a
| multiply(multiply(d,e,a),b,multiply(d,e,c)) != multiply(d,e,multiply(a,b,c)) ),
inference(fof_simplification,[status(thm)],[prove_tba_axioms]) ).
cnf(c_0_13,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( multiply(inverse(b),b,a) != a
| multiply(a,a,b) != a
| multiply(a,b,inverse(b)) != a
| multiply(b,a,a) != a
| multiply(multiply(d,e,a),b,multiply(d,e,c)) != multiply(d,e,multiply(a,b,c)) ),
c_0_12 ).
cnf(c_0_15,plain,
multiply(inverse(X1),X1,X2) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_16,plain,
multiply(multiply(X1,X2,X3),inverse(multiply(X4,X5,X6)),multiply(multiply(X4,X5,X6),inverse(multiply(multiply(X7,X8,X9),X10,multiply(X7,X8,X11))),multiply(X8,multiply(X11,X10,X9),X7))) = multiply(X2,multiply(X3,inverse(multiply(X1,X2,X12)),X12),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_11]) ).
cnf(c_0_17,plain,
multiply(X1,inverse(multiply(multiply(X2,X3,X4),X5,multiply(X2,X3,X6))),multiply(X3,multiply(X6,X5,X4),X2)) = X1,
inference(rw,[status(thm)],[c_0_2,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( multiply(b,a,a) != a
| multiply(a,a,b) != a
| multiply(a,b,inverse(b)) != a
| multiply(multiply(d,e,a),b,multiply(d,e,c)) != multiply(d,e,multiply(a,b,c)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_19,plain,
multiply(X1,X2,inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_20,plain,
multiply(X1,multiply(X2,inverse(multiply(X3,X1,X4)),X4),X3) = multiply(X3,X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( multiply(b,a,a) != a
| multiply(a,a,b) != a
| multiply(multiply(d,e,a),b,multiply(d,e,c)) != multiply(d,e,multiply(a,b,c)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_22,plain,
multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5)) = multiply(X2,multiply(X5,X4,X3),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_13]) ).
cnf(c_0_23,plain,
multiply(X1,X2,inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_24,plain,
multiply(X1,X2,multiply(X1,X2,X3)) = multiply(X2,X3,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_13]) ).
cnf(c_0_25,negated_conjecture,
( multiply(b,a,a) != a
| multiply(a,a,b) != a
| multiply(e,multiply(c,b,a),d) != multiply(d,e,multiply(a,b,c)) ),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
multiply(X1,X2,X3) = multiply(X3,X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_15]),c_0_23]) ).
cnf(c_0_27,plain,
multiply(X1,X2,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_10]) ).
cnf(c_0_28,negated_conjecture,
( multiply(a,a,b) != a
| multiply(d,multiply(a,b,c),e) != multiply(d,e,multiply(a,b,c)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]),c_0_26])]) ).
cnf(c_0_29,plain,
multiply(X1,X1,X2) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
multiply(X1,X2,X3) = multiply(X3,X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_27]),c_0_10]) ).
cnf(c_0_31,negated_conjecture,
multiply(d,multiply(a,b,c),e) != multiply(d,e,multiply(a,b,c)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_32,plain,
multiply(X1,X2,X3) = multiply(X1,X3,X2),
inference(spm,[status(thm)],[c_0_26,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO035-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n020.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 : Mon Sep 21 13:49:48 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.45 Running first-order theorem proving
% 0.15/0.45 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.78/0.60 % Version: 3.5.1
% 0.78/0.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.78/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.78/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.78/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.78/0.60 % Starting sh5l with 300s (1) cores
% 0.78/0.60 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3090876 completed with status 0
% 0.78/0.60 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.78/0.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.78/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.78/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.78/0.60 % No SInE strategy applied
% 0.78/0.60 % Search class: FUHPF-FFSF32-MFFFFFNN
% 0.78/0.60 % partial match(1): FUHPF-FFSF22-MFFFFFNN
% 0.78/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.78/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.78/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.78/0.60 % Starting new_bool_3 with 313s (1) cores
% 0.78/0.60 % Starting new_bool_1 with 309s (1) cores
% 0.78/0.60 % Starting sh5l with 304s (1) cores
% 0.78/0.60 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3090882 completed with status 0
% 0.78/0.60 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.78/0.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.78/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.78/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.78/0.60 % No SInE strategy applied
% 0.78/0.60 % Search class: FUHPF-FFSF32-MFFFFFNN
% 0.78/0.60 % partial match(1): FUHPF-FFSF22-MFFFFFNN
% 0.78/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.78/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.78/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.78/0.60 % Preprocessing time : 0.008 s
% 0.78/0.60
% 0.78/0.60 % Proof found!
% 0.78/0.60 % SZS status Unsatisfiable
% 0.78/0.60 % SZS output start CNFRefutation
% See solution above
% 0.78/0.60 % Parsed axioms : 2
% 0.78/0.60 % Removed by relevancy pruning/SinE : 0
% 0.78/0.60 % Initial clauses : 2
% 0.78/0.60 % Removed in clause preprocessing : 0
% 0.78/0.60 % Initial clauses in saturation : 2
% 0.78/0.60 % Processed clauses : 70
% 0.78/0.60 % ...of these trivial : 14
% 0.78/0.60 % ...subsumed : 11
% 0.78/0.60 % ...remaining for further processing : 45
% 0.78/0.60 % Other redundant clauses eliminated : 0
% 0.78/0.60 % Clauses deleted for lack of memory : 0
% 0.78/0.60 % Backward-subsumed : 0
% 0.78/0.60 % Backward-rewritten : 30
% 0.78/0.60 % Generated clauses : 2757
% 0.78/0.60 % ...of the previous two non-redundant : 2442
% 0.78/0.60 % ...aggressively subsumed : 0
% 0.78/0.60 % Contextual simplify-reflections : 0
% 0.78/0.60 % Paramodulations : 2757
% 0.78/0.60 % Factorizations : 0
% 0.78/0.60 % NegExts : 0
% 0.78/0.60 % Equation resolutions : 0
% 0.78/0.60 % Disequality decompositions : 0
% 0.78/0.60 % Total rewrite steps : 1541
% 0.78/0.60 % ...of those cached : 1049
% 0.78/0.60 % Propositional unsat checks : 0
% 0.78/0.60 % Propositional check models : 0
% 0.78/0.60 % Propositional check unsatisfiable : 0
% 0.78/0.60 % Propositional clauses : 0
% 0.78/0.60 % Propositional clauses after purity: 0
% 0.78/0.60 % Propositional unsat core size : 0
% 0.78/0.60 % Propositional preprocessing time : 0.000
% 0.78/0.60 % Propositional encoding time : 0.000
% 0.78/0.60 % Propositional solver time : 0.000
% 0.78/0.60 % Success case prop preproc time : 0.000
% 0.78/0.60 % Success case prop encoding time : 0.000
% 0.78/0.60 % Success case prop solver time : 0.000
% 0.78/0.60 % Current number of processed clauses : 15
% 0.78/0.60 % Positive orientable unit clauses : 11
% 0.78/0.60 % Positive unorientable unit clauses: 4
% 0.78/0.60 % Negative unit clauses : 0
% 0.78/0.60 % Non-unit-clauses : 0
% 0.78/0.60 % Current number of unprocessed clauses: 1400
% 0.78/0.60 % ...number of literals in the above : 1400
% 0.78/0.60 % Current number of archived formulas : 0
% 0.78/0.60 % Current number of archived clauses : 30
% 0.78/0.60 % Clause-clause subsumption calls (NU) : 0
% 0.78/0.60 % Rec. Clause-clause subsumption calls : 0
% 0.78/0.60 % Non-unit clause-clause subsumptions : 0
% 0.78/0.60 % Unit Clause-clause subsumption calls : 35
% 0.78/0.60 % Rewrite failures with RHS unbound : 0
% 0.78/0.60 % BW rewrite match attempts : 570
% 0.78/0.60 % BW rewrite match successes : 316
% 0.78/0.60 % Condensation attempts : 0
% 0.78/0.60 % Condensation successes : 0
% 0.78/0.60 % Termbank termtop insertions : 65357
% 0.78/0.60 % Search garbage collected termcells : 14
% 0.78/0.60
% 0.78/0.60 % -------------------------------------------------
% 0.78/0.60 % User time : 0.117 s
% 0.78/0.60 % System time : 0.012 s
% 0.78/0.60 % Total time : 0.129 s
% 0.78/0.60 % Maximum resident set size: 3632 pages
% 0.78/0.60
% 0.78/0.60 % -------------------------------------------------
% 0.78/0.60 % User time : 0.566 s
% 0.78/0.60 % System time : 0.045 s
% 0.78/0.60 % Total time : 0.611 s
% 0.78/0.60 % Maximum resident set size: 4864 pages
% 0.78/0.60 % E exiting
%------------------------------------------------------------------------------