%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO067-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 : n017.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.36s 0.78s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 2
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 6 RR)
% Number of literals : 34 ( 33 equ; 5 neg)
% Maximal clause size : 1 ( 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 : 120 ( 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_1,negated_conjecture,
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_1) ).
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(multiply(X1,inverse(X1),X2),inverse(multiply(X3,inverse(X3),multiply(X4,inverse(X4),X5))),X5) = X2,
inference(rw,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_11,plain,
multiply(X1,inverse(X2),X2) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
multiply(X1,inverse(X1),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9]),c_0_9]),c_0_11]) ).
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_12]) ).
cnf(c_0_15,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_12]) ).
cnf(c_0_16,plain,
multiply(X1,X2,inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
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_12]) ).
cnf(c_0_18,plain,
multiply(X1,multiply(X1,inverse(multiply(X2,X1,X3)),X3),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_11]) ).
cnf(c_0_19,plain,
multiply(inverse(X1),X1,X2) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_20,plain,
multiply(X1,inverse(multiply(X2,X3,X3)),X3) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12]) ).
cnf(c_0_21,plain,
multiply(multiply(X1,multiply(multiply(X2,X3,X4),inverse(multiply(multiply(X2,X3,X5),X1,X6)),X6),multiply(X2,X3,X5)),inverse(multiply(multiply(X7,X8,X9),X10,multiply(X7,X8,X11))),multiply(X8,multiply(X11,X10,X9),X7)) = multiply(X3,multiply(X4,X1,X5),X2),
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_22,plain,
multiply(X1,multiply(X2,inverse(multiply(X3,X1,X4)),X4),X3) = multiply(X3,X1,X2),
inference(rw,[status(thm)],[c_0_4,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
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_1]) ).
cnf(c_0_24,plain,
multiply(X1,X2,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14]) ).
cnf(c_0_25,plain,
multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5)) = multiply(X2,multiply(X5,X4,X3),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_17]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
multiply(multiply(d,e,a),b,multiply(d,e,c)) != multiply(d,e,multiply(a,b,c)),
c_0_23 ).
cnf(c_0_27,plain,
multiply(X1,X2,X3) = multiply(X3,X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_24]),c_0_11]) ).
cnf(c_0_28,plain,
multiply(X1,X2,X3) = multiply(X3,X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_12]),c_0_12]),c_0_7]) ).
cnf(c_0_29,negated_conjecture,
multiply(b,multiply(d,e,c),multiply(d,e,a)) != multiply(d,e,multiply(a,b,c)),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
multiply(X1,X2,X3) = multiply(X1,X3,X2),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
multiply(b,multiply(d,e,a),multiply(d,e,c)) != multiply(d,e,multiply(a,b,c)),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
multiply(X1,multiply(X2,X3,X4),multiply(X2,X3,X5)) = multiply(X3,multiply(X4,X1,X5),X2),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : BOO067-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.09 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.45 % Computer : n017.cluster.edu
% 0.21/0.45 % Model : x86_64 x86_64
% 0.21/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.45 % Memory : 8046.5625MB
% 0.21/0.45 % OS : Linux 6.8.0-71-generic
% 0.21/0.45 % CPULimit : 300
% 0.21/0.45 % WCLimit : 300
% 0.21/0.45 % DateTime : Mon Sep 21 13:46:27 UTC 2026
% 0.21/0.45 % CPUTime :
% 0.21/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.29/0.57 Running first-order theorem proving
% 0.29/0.57 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.36/0.78 % Version: 3.5.1
% 0.36/0.78 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.36/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.78 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.36/0.78 % Starting new_bool_3 with 300s (1) cores
% 0.36/0.78 % Starting new_bool_1 with 300s (1) cores
% 0.36/0.78 % Starting sh5l with 300s (1) cores
% 0.36/0.78 % new_bool_1 with pid 2471360 completed with status 9
% 0.36/0.78 % new_bool_3 with pid 2471359 completed with status 9
% 0.36/0.78 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2471358 completed with status 0
% 0.36/0.78 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.36/0.78 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.36/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.78 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.36/0.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.36/0.78 % No SInE strategy applied
% 0.36/0.78 % Search class: FUUPF-FFSF32-MFFFFFNN
% 0.36/0.78 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.78 % Starting SubtermCWHack with 136s (1) cores
% 0.36/0.78 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.36/0.78 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.36/0.78 % Starting new_bool_3 with 136s (1) cores
% 0.36/0.78 % Starting new_bool_1 with 136s (1) cores
% 0.36/0.78 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 2471367 completed with status 0
% 0.36/0.78 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.36/0.78 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.36/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.78 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.36/0.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.36/0.78 % No SInE strategy applied
% 0.36/0.78 % Search class: FUUPF-FFSF32-MFFFFFNN
% 0.36/0.78 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.78 % Starting SubtermCWHack with 136s (1) cores
% 0.36/0.78 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.36/0.78 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.36/0.78 % Preprocessing time : 0.007 s
% 0.36/0.78
% 0.36/0.78 % Proof found!
% 0.36/0.78 % SZS status Unsatisfiable
% 0.36/0.78 % SZS output start CNFRefutation
% See solution above
% 0.36/0.78 % Parsed axioms : 2
% 0.36/0.78 % Removed by relevancy pruning/SinE : 0
% 0.36/0.78 % Initial clauses : 2
% 0.36/0.78 % Removed in clause preprocessing : 0
% 0.36/0.78 % Initial clauses in saturation : 2
% 0.36/0.78 % Processed clauses : 107
% 0.36/0.78 % ...of these trivial : 23
% 0.36/0.78 % ...subsumed : 24
% 0.36/0.78 % ...remaining for further processing : 60
% 0.36/0.78 % Other redundant clauses eliminated : 0
% 0.36/0.78 % Clauses deleted for lack of memory : 0
% 0.36/0.78 % Backward-subsumed : 0
% 0.36/0.78 % Backward-rewritten : 38
% 0.36/0.78 % Generated clauses : 3035
% 0.36/0.78 % ...of the previous two non-redundant : 2645
% 0.36/0.78 % ...aggressively subsumed : 0
% 0.36/0.78 % Contextual simplify-reflections : 0
% 0.36/0.78 % Paramodulations : 3035
% 0.36/0.78 % Factorizations : 0
% 0.36/0.78 % NegExts : 0
% 0.36/0.78 % Equation resolutions : 0
% 0.36/0.78 % Disequality decompositions : 0
% 0.36/0.78 % Total rewrite steps : 1294
% 0.36/0.78 % ...of those cached : 865
% 0.36/0.78 % Propositional unsat checks : 0
% 0.36/0.78 % Propositional check models : 0
% 0.36/0.78 % Propositional check unsatisfiable : 0
% 0.36/0.78 % Propositional clauses : 0
% 0.36/0.78 % Propositional clauses after purity: 0
% 0.36/0.78 % Propositional unsat core size : 0
% 0.36/0.78 % Propositional preprocessing time : 0.000
% 0.36/0.78 % Propositional encoding time : 0.000
% 0.36/0.78 % Propositional solver time : 0.000
% 0.36/0.78 % Success case prop preproc time : 0.000
% 0.36/0.78 % Success case prop encoding time : 0.000
% 0.36/0.78 % Success case prop solver time : 0.000
% 0.36/0.78 % Current number of processed clauses : 22
% 0.36/0.78 % Positive orientable unit clauses : 18
% 0.36/0.78 % Positive unorientable unit clauses: 4
% 0.36/0.78 % Negative unit clauses : 0
% 0.36/0.78 % Non-unit-clauses : 0
% 0.36/0.78 % Current number of unprocessed clauses: 1581
% 0.36/0.78 % ...number of literals in the above : 1581
% 0.36/0.78 % Current number of archived formulas : 0
% 0.36/0.78 % Current number of archived clauses : 38
% 0.36/0.78 % Clause-clause subsumption calls (NU) : 0
% 0.36/0.78 % Rec. Clause-clause subsumption calls : 0
% 0.36/0.78 % Non-unit clause-clause subsumptions : 0
% 0.36/0.78 % Unit Clause-clause subsumption calls : 35
% 0.36/0.78 % Rewrite failures with RHS unbound : 0
% 0.36/0.78 % BW rewrite match attempts : 820
% 0.36/0.78 % BW rewrite match successes : 255
% 0.36/0.78 % Condensation attempts : 0
% 0.36/0.78 % Condensation successes : 0
% 0.36/0.78 % Termbank termtop insertions : 48447
% 0.36/0.78 % Search garbage collected termcells : 2
% 0.36/0.78
% 0.36/0.78 % -------------------------------------------------
% 0.36/0.78 % User time : 0.126 s
% 0.36/0.78 % System time : 0.008 s
% 0.36/0.78 % Total time : 0.133 s
% 0.36/0.78 % Maximum resident set size: 3580 pages
% 0.36/0.78
% 0.36/0.78 % -------------------------------------------------
% 0.36/0.78 % User time : 0.754 s
% 0.36/0.78 % System time : 0.101 s
% 0.36/0.78 % Total time : 0.854 s
% 0.36/0.78 % Maximum resident set size: 4608 pages
% 0.36/0.78 % E exiting
%------------------------------------------------------------------------------