%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO017-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:00 PM UTC 2026
% Result : Unsatisfiable 0.15s 10.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 6 RR)
% Number of literals : 31 ( 30 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 45 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity2,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',distributivity2) ).
cnf(additive_inverse1,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',additive_inverse1) ).
cnf(multiplicative_id1,axiom,
multiply(X1,multiplicative_identity) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',multiplicative_id1) ).
cnf(multiplicative_id2,axiom,
multiply(multiplicative_identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',multiplicative_id2) ).
cnf(distributivity4,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',distributivity4) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',commutativity_of_add) ).
cnf(additive_id2,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',additive_id2) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',commutativity_of_multiply) ).
cnf(distributivity1,axiom,
add(multiply(X1,X2),X3) = multiply(add(X1,X3),add(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',distributivity1) ).
cnf(prove_sum,negated_conjecture,
multiply(x,z) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_sum) ).
cnf(x_times_y,hypothesis,
add(x,y) = z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_times_y) ).
cnf(c_0_11,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
distributivity2 ).
cnf(c_0_12,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
additive_inverse1 ).
cnf(c_0_13,axiom,
multiply(X1,multiplicative_identity) = X1,
multiplicative_id1 ).
cnf(c_0_14,plain,
add(X1,multiply(X2,inverse(X1))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,axiom,
multiply(multiplicative_identity,X1) = X1,
multiplicative_id2 ).
cnf(c_0_16,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distributivity4 ).
cnf(c_0_17,plain,
add(X1,multiplicative_identity) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_12]) ).
cnf(c_0_18,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_19,axiom,
add(additive_identity,X1) = X1,
additive_id2 ).
cnf(c_0_20,plain,
add(X1,multiply(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_17]),c_0_13]),c_0_18]) ).
cnf(c_0_21,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_22,plain,
multiply(additive_identity,X1) = additive_identity,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
add(multiply(X1,X2),X3) = multiply(add(X1,X3),add(X2,X3)),
distributivity1 ).
cnf(c_0_24,plain,
multiply(X1,additive_identity) = additive_identity,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
multiply(X1,add(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_24]),c_0_19]),c_0_21]) ).
cnf(c_0_26,negated_conjecture,
multiply(x,z) != x,
inference(fof_simplification,[status(thm)],[prove_sum]) ).
cnf(c_0_27,plain,
multiply(X1,add(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_28,hypothesis,
add(x,y) = z,
x_times_y ).
cnf(c_0_29,negated_conjecture,
multiply(x,z) != x,
c_0_26 ).
cnf(c_0_30,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO017-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/10.39 % Computer : n019.cluster.edu
% 0.13/10.39 % Model : x86_64 x86_64
% 0.13/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/10.39 % Memory : 8046.5625MB
% 0.13/10.39 % OS : Linux 6.8.0-71-generic
% 0.13/10.39 % CPULimit : 300
% 0.13/10.39 % WCLimit : 300
% 0.13/10.39 % DateTime : Mon Sep 21 13:48:46 UTC 2026
% 0.13/10.40 % CPUTime :
% 0.13/10.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.44 Running first-order theorem proving
% 0.15/10.44 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.15/10.46 % Version: 3.5.1
% 0.15/10.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/10.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.46 % Starting sh5l with 300s (1) cores
% 0.15/10.46 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2737046 completed with status 0
% 0.15/10.46 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/10.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/10.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.46 % No SInE strategy applied
% 0.15/10.46 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.15/10.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/10.46 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.15/10.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/10.46 % Starting new_bool_1 with 136s (1) cores
% 0.15/10.46 % SubtermCWHack with pid 2737050 completed with status 0
% 0.15/10.46 % Result found by SubtermCWHack
% 0.15/10.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/10.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.46 % No SInE strategy applied
% 0.15/10.46 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.15/10.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.46 % Preprocessing time : 0.001 s
% 0.15/10.46
% 0.15/10.46 % Proof found!
% 0.15/10.46 % SZS status Unsatisfiable
% 0.15/10.46 % SZS output start CNFRefutation
% See solution above
% 0.15/10.46 % Parsed axioms : 16
% 0.15/10.46 % Removed by relevancy pruning/SinE : 0
% 0.15/10.46 % Initial clauses : 16
% 0.15/10.46 % Removed in clause preprocessing : 0
% 0.15/10.46 % Initial clauses in saturation : 16
% 0.15/10.46 % Processed clauses : 41
% 0.15/10.46 % ...of these trivial : 9
% 0.15/10.46 % ...subsumed : 0
% 0.15/10.46 % ...remaining for further processing : 32
% 0.15/10.46 % Other redundant clauses eliminated : 0
% 0.15/10.46 % Clauses deleted for lack of memory : 0
% 0.15/10.46 % Backward-subsumed : 0
% 0.15/10.46 % Backward-rewritten : 2
% 0.15/10.46 % Generated clauses : 221
% 0.15/10.46 % ...of the previous two non-redundant : 114
% 0.15/10.46 % ...aggressively subsumed : 0
% 0.15/10.46 % Contextual simplify-reflections : 0
% 0.15/10.46 % Paramodulations : 221
% 0.15/10.46 % Factorizations : 0
% 0.15/10.46 % NegExts : 0
% 0.15/10.46 % Equation resolutions : 0
% 0.15/10.46 % Disequality decompositions : 0
% 0.15/10.46 % Total rewrite steps : 189
% 0.15/10.46 % ...of those cached : 121
% 0.15/10.46 % Propositional unsat checks : 0
% 0.15/10.46 % Propositional check models : 0
% 0.15/10.46 % Propositional check unsatisfiable : 0
% 0.15/10.46 % Propositional clauses : 0
% 0.15/10.46 % Propositional clauses after purity: 0
% 0.15/10.46 % Propositional unsat core size : 0
% 0.15/10.46 % Propositional preprocessing time : 0.000
% 0.15/10.46 % Propositional encoding time : 0.000
% 0.15/10.46 % Propositional solver time : 0.000
% 0.15/10.46 % Success case prop preproc time : 0.000
% 0.15/10.46 % Success case prop encoding time : 0.000
% 0.15/10.46 % Success case prop solver time : 0.000
% 0.15/10.46 % Current number of processed clauses : 30
% 0.15/10.46 % Positive orientable unit clauses : 27
% 0.15/10.46 % Positive unorientable unit clauses: 2
% 0.15/10.46 % Negative unit clauses : 1
% 0.15/10.46 % Non-unit-clauses : 0
% 0.15/10.46 % Current number of unprocessed clauses: 85
% 0.15/10.46 % ...number of literals in the above : 85
% 0.15/10.46 % Current number of archived formulas : 0
% 0.15/10.46 % Current number of archived clauses : 2
% 0.15/10.46 % Clause-clause subsumption calls (NU) : 0
% 0.15/10.46 % Rec. Clause-clause subsumption calls : 0
% 0.15/10.46 % Non-unit clause-clause subsumptions : 0
% 0.15/10.46 % Unit Clause-clause subsumption calls : 0
% 0.15/10.46 % Rewrite failures with RHS unbound : 0
% 0.15/10.46 % BW rewrite match attempts : 62
% 0.15/10.46 % BW rewrite match successes : 20
% 0.15/10.46 % Condensation attempts : 0
% 0.15/10.46 % Condensation successes : 0
% 0.15/10.46 % Termbank termtop insertions : 1447
% 0.15/10.46 % Search garbage collected termcells : 2
% 0.15/10.46
% 0.15/10.46 % -------------------------------------------------
% 0.15/10.46 % User time : 0.004 s
% 0.15/10.46 % System time : 0.002 s
% 0.15/10.46 % Total time : 0.006 s
% 0.15/10.46 % Maximum resident set size: 3640 pages
% 0.15/10.46
% 0.15/10.46 % -------------------------------------------------
% 0.15/10.46 % User time : 0.013 s
% 0.15/10.46 % System time : 0.010 s
% 0.15/10.46 % Total time : 0.024 s
% 0.15/10.46 % Maximum resident set size: 4864 pages
% 0.15/10.46 % E exiting
%------------------------------------------------------------------------------