%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO005-1 : 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 : 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:06:54 PM UTC 2026
% Result : Unsatisfiable 0.16s 5.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 18 unt; 0 nHn; 18 RR)
% Number of literals : 61 ( 8 equ; 32 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 75 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity8,axiom,
( ~ product(X3,X5,X7)
| ~ product(X1,X4,X6)
| ~ sum(X4,X2,X5)
| ~ sum(X1,X2,X3)
| sum(X6,X2,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',distributivity8) ).
cnf(multiplicative_identity1,axiom,
product(multiplicative_identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',multiplicative_identity1) ).
cnf(multiplicative_identity2,axiom,
product(X1,multiplicative_identity,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',multiplicative_identity2) ).
cnf(addition_is_well_defined,axiom,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',addition_is_well_defined) ).
cnf(commutativity_of_addition,axiom,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',commutativity_of_addition) ).
cnf(additive_inverse1,axiom,
sum(inverse(X1),X1,multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',additive_inverse1) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',closure_of_addition) ).
cnf(prove_equations,negated_conjecture,
~ sum(x,multiplicative_identity,multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equations) ).
cnf(c_0_8,plain,
( ~ product(X3,X5,X7)
| ~ product(X1,X4,X6)
| ~ sum(X4,X2,X5)
| ~ sum(X1,X2,X3)
| sum(X6,X2,X7) ),
inference(fof_simplification,[status(thm)],[distributivity8]) ).
cnf(c_0_9,plain,
( ~ product(X3,X5,X7)
| ~ product(X1,X4,X6)
| ~ sum(X4,X2,X5)
| ~ sum(X1,X2,X3)
| sum(X6,X2,X7) ),
c_0_8 ).
cnf(c_0_10,axiom,
product(multiplicative_identity,X1,X1),
multiplicative_identity1 ).
cnf(c_0_11,plain,
( ~ sum(X5,X2,X3)
| ~ sum(X4,X2,multiplicative_identity)
| ~ product(X4,X5,X1)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
product(X1,multiplicative_identity,X1),
multiplicative_identity2 ).
cnf(c_0_13,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_14,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_addition]) ).
cnf(c_0_15,plain,
( ~ sum(multiplicative_identity,X2,X3)
| ~ sum(X1,X2,multiplicative_identity)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
sum(inverse(X1),X1,multiplicative_identity),
additive_inverse1 ).
cnf(c_0_17,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
c_0_13 ).
cnf(c_0_18,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_19,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
c_0_14 ).
cnf(c_0_20,plain,
( ~ sum(multiplicative_identity,X1,X2)
| sum(inverse(X1),X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ sum(X2,X3,X1)
| X1 = add(X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_23,plain,
( ~ sum(inverse(X2),X2,X1)
| X1 = multiplicative_identity ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_24,plain,
sum(inverse(X1),X1,add(multiplicative_identity,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_25,plain,
add(X1,X2) = add(X2,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
add(X1,inverse(X1)) = multiplicative_identity,
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
~ sum(x,multiplicative_identity,multiplicative_identity),
inference(fof_simplification,[status(thm)],[prove_equations]) ).
cnf(c_0_28,plain,
add(multiplicative_identity,X1) = multiplicative_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
~ sum(x,multiplicative_identity,multiplicative_identity),
c_0_27 ).
cnf(c_0_30,plain,
sum(X1,multiplicative_identity,multiplicative_identity),
inference(spm,[status(thm)],[c_0_22,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.38 % Computer : n015.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Mon Sep 21 13:49:12 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.43 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.16/5.45 % Version: 3.5.1
% 0.16/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.45 % Starting sh5l with 300s (1) cores
% 0.16/5.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1620234 completed with status 0
% 0.16/5.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.45 % No SInE strategy applied
% 0.16/5.45 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.16/5.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.16/5.45 % Starting new_bool_3 with 136s (1) cores
% 0.16/5.45 % Starting new_bool_1 with 136s (1) cores
% 0.16/5.45 % new_bool_1 with pid 1620242 completed with status 0
% 0.16/5.45 % Result found by new_bool_1
% 0.16/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.45 % No SInE strategy applied
% 0.16/5.45 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.16/5.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.16/5.45 % Starting new_bool_3 with 136s (1) cores
% 0.16/5.45 % Starting new_bool_1 with 136s (1) cores
% 0.16/5.45 % Preprocessing time : 0.001 s
% 0.16/5.45 % Presaturation interreduction done
% 0.16/5.45
% 0.16/5.45 % Proof found!
% 0.16/5.45 % SZS status Unsatisfiable
% 0.16/5.45 % SZS output start CNFRefutation
% See solution above
% 0.16/5.45 % Parsed axioms : 23
% 0.16/5.45 % Removed by relevancy pruning/SinE : 0
% 0.16/5.45 % Initial clauses : 23
% 0.16/5.45 % Removed in clause preprocessing : 0
% 0.16/5.45 % Initial clauses in saturation : 23
% 0.16/5.45 % Processed clauses : 125
% 0.16/5.45 % ...of these trivial : 15
% 0.16/5.45 % ...subsumed : 13
% 0.16/5.45 % ...remaining for further processing : 97
% 0.16/5.45 % Other redundant clauses eliminated : 0
% 0.16/5.45 % Clauses deleted for lack of memory : 0
% 0.16/5.45 % Backward-subsumed : 3
% 0.16/5.45 % Backward-rewritten : 7
% 0.16/5.45 % Generated clauses : 301
% 0.16/5.45 % ...of the previous two non-redundant : 164
% 0.16/5.45 % ...aggressively subsumed : 0
% 0.16/5.45 % Contextual simplify-reflections : 0
% 0.16/5.45 % Paramodulations : 301
% 0.16/5.45 % Factorizations : 0
% 0.16/5.45 % NegExts : 0
% 0.16/5.45 % Equation resolutions : 0
% 0.16/5.45 % Disequality decompositions : 0
% 0.16/5.45 % Total rewrite steps : 176
% 0.16/5.45 % ...of those cached : 134
% 0.16/5.45 % Propositional unsat checks : 0
% 0.16/5.45 % Propositional check models : 0
% 0.16/5.45 % Propositional check unsatisfiable : 0
% 0.16/5.45 % Propositional clauses : 0
% 0.16/5.45 % Propositional clauses after purity: 0
% 0.16/5.45 % Propositional unsat core size : 0
% 0.16/5.45 % Propositional preprocessing time : 0.000
% 0.16/5.45 % Propositional encoding time : 0.000
% 0.16/5.45 % Propositional solver time : 0.000
% 0.16/5.45 % Success case prop preproc time : 0.000
% 0.16/5.45 % Success case prop encoding time : 0.000
% 0.16/5.45 % Success case prop solver time : 0.000
% 0.16/5.45 % Current number of processed clauses : 64
% 0.16/5.45 % Positive orientable unit clauses : 23
% 0.16/5.45 % Positive unorientable unit clauses: 2
% 0.16/5.45 % Negative unit clauses : 0
% 0.16/5.45 % Non-unit-clauses : 39
% 0.16/5.45 % Current number of unprocessed clauses: 81
% 0.16/5.45 % ...number of literals in the above : 252
% 0.16/5.45 % Current number of archived formulas : 0
% 0.16/5.45 % Current number of archived clauses : 33
% 0.16/5.45 % Clause-clause subsumption calls (NU) : 519
% 0.16/5.45 % Rec. Clause-clause subsumption calls : 350
% 0.16/5.45 % Non-unit clause-clause subsumptions : 14
% 0.16/5.45 % Unit Clause-clause subsumption calls : 0
% 0.16/5.45 % Rewrite failures with RHS unbound : 0
% 0.16/5.45 % BW rewrite match attempts : 108
% 0.16/5.45 % BW rewrite match successes : 33
% 0.16/5.45 % Condensation attempts : 0
% 0.16/5.45 % Condensation successes : 0
% 0.16/5.45 % Termbank termtop insertions : 3696
% 0.16/5.45 % Search garbage collected termcells : 68
% 0.16/5.45
% 0.16/5.45 % -------------------------------------------------
% 0.16/5.45 % User time : 0.006 s
% 0.16/5.45 % System time : 0.002 s
% 0.16/5.45 % Total time : 0.008 s
% 0.16/5.45 % Maximum resident set size: 3652 pages
% 0.16/5.45
% 0.16/5.45 % -------------------------------------------------
% 0.16/5.45 % User time : 0.029 s
% 0.16/5.45 % System time : 0.013 s
% 0.16/5.45 % Total time : 0.042 s
% 0.16/5.45 % Maximum resident set size: 4608 pages
% 0.16/5.45 % E exiting
%------------------------------------------------------------------------------