%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : BOO004-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 : n018.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:09 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.48s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 18 unt; 0 nHn; 15 RR)
% Number of literals : 55 ( 7 equ; 29 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 64 ( 0 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_inverse1,axiom,
product(inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',multiplicative_inverse1) ).
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(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',closure_of_addition) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',additive_identity1) ).
cnf(additive_inverse1,axiom,
sum(inverse(X1),X1,multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',additive_inverse1) ).
cnf(prove_both_equalities,negated_conjecture,
~ sum(x,x,x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_both_equalities) ).
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(inverse(X1),X1,additive_identity),
multiplicative_inverse1 ).
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(X3,X1,X2)
| ~ sum(inverse(X3),X1,multiplicative_identity)
| sum(additive_identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_16,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
c_0_13 ).
cnf(c_0_17,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_18,plain,
( ~ sum(inverse(X2),X1,multiplicative_identity)
| sum(additive_identity,X1,add(X2,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
sum(inverse(X1),X1,multiplicative_identity),
additive_inverse1 ).
cnf(c_0_20,plain,
( ~ sum(additive_identity,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ sum(X2,X3,X1)
| X1 = add(X2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_22,plain,
sum(additive_identity,X1,add(X1,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_24,negated_conjecture,
~ sum(x,x,x),
inference(fof_simplification,[status(thm)],[prove_both_equalities]) ).
cnf(c_0_25,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
~ sum(x,x,x),
c_0_24 ).
cnf(c_0_27,plain,
sum(X1,X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO004-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.15/0.40 % Computer : n018.cluster.edu
% 0.15/0.40 % Model : x86_64 x86_64
% 0.15/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40 % Memory : 8046.5625MB
% 0.15/0.40 % OS : Linux 6.8.0-71-generic
% 0.15/0.40 % CPULimit : 300
% 0.15/0.40 % WCLimit : 300
% 0.15/0.40 % DateTime : Mon Sep 21 13:48:00 UTC 2026
% 0.15/0.40 % CPUTime :
% 0.15/0.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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.23/0.48 % Version: 3.5.1
% 0.23/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.48 % Starting sh5l with 300s (1) cores
% 0.23/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2049476 completed with status 0
% 0.23/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.48 % No SInE strategy applied
% 0.23/0.48 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.23/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.23/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.48 % new_bool_3 with pid 2049486 completed with status 0
% 0.23/0.48 % Result found by new_bool_3
% 0.23/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.48 % No SInE strategy applied
% 0.23/0.48 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.23/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.23/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.48 % Preprocessing time : 0.001 s
% 0.23/0.48 % Presaturation interreduction done
% 0.23/0.48
% 0.23/0.48 % Proof found!
% 0.23/0.48 % SZS status Unsatisfiable
% 0.23/0.48 % SZS output start CNFRefutation
% See solution above
% 0.23/0.48 % Parsed axioms : 23
% 0.23/0.48 % Removed by relevancy pruning/SinE : 0
% 0.23/0.48 % Initial clauses : 23
% 0.23/0.48 % Removed in clause preprocessing : 0
% 0.23/0.48 % Initial clauses in saturation : 23
% 0.23/0.48 % Processed clauses : 152
% 0.23/0.48 % ...of these trivial : 14
% 0.23/0.48 % ...subsumed : 27
% 0.23/0.48 % ...remaining for further processing : 111
% 0.23/0.48 % Other redundant clauses eliminated : 0
% 0.23/0.48 % Clauses deleted for lack of memory : 0
% 0.23/0.48 % Backward-subsumed : 3
% 0.23/0.48 % Backward-rewritten : 8
% 0.23/0.48 % Generated clauses : 398
% 0.23/0.48 % ...of the previous two non-redundant : 203
% 0.23/0.48 % ...aggressively subsumed : 0
% 0.23/0.48 % Contextual simplify-reflections : 0
% 0.23/0.48 % Paramodulations : 398
% 0.23/0.48 % Factorizations : 0
% 0.23/0.48 % NegExts : 0
% 0.23/0.48 % Equation resolutions : 0
% 0.23/0.48 % Disequality decompositions : 0
% 0.23/0.48 % Total rewrite steps : 266
% 0.23/0.48 % ...of those cached : 210
% 0.23/0.48 % Propositional unsat checks : 0
% 0.23/0.48 % Propositional check models : 0
% 0.23/0.48 % Propositional check unsatisfiable : 0
% 0.23/0.48 % Propositional clauses : 0
% 0.23/0.48 % Propositional clauses after purity: 0
% 0.23/0.48 % Propositional unsat core size : 0
% 0.23/0.48 % Propositional preprocessing time : 0.000
% 0.23/0.48 % Propositional encoding time : 0.000
% 0.23/0.48 % Propositional solver time : 0.000
% 0.23/0.48 % Success case prop preproc time : 0.000
% 0.23/0.48 % Success case prop encoding time : 0.000
% 0.23/0.48 % Success case prop solver time : 0.000
% 0.23/0.48 % Current number of processed clauses : 77
% 0.23/0.48 % Positive orientable unit clauses : 26
% 0.23/0.48 % Positive unorientable unit clauses: 2
% 0.23/0.48 % Negative unit clauses : 0
% 0.23/0.48 % Non-unit-clauses : 49
% 0.23/0.48 % Current number of unprocessed clauses: 87
% 0.23/0.48 % ...number of literals in the above : 281
% 0.23/0.48 % Current number of archived formulas : 0
% 0.23/0.48 % Current number of archived clauses : 34
% 0.23/0.48 % Clause-clause subsumption calls (NU) : 949
% 0.23/0.48 % Rec. Clause-clause subsumption calls : 684
% 0.23/0.48 % Non-unit clause-clause subsumptions : 28
% 0.23/0.48 % Unit Clause-clause subsumption calls : 32
% 0.23/0.48 % Rewrite failures with RHS unbound : 0
% 0.23/0.48 % BW rewrite match attempts : 198
% 0.23/0.48 % BW rewrite match successes : 34
% 0.23/0.48 % Condensation attempts : 0
% 0.23/0.48 % Condensation successes : 0
% 0.23/0.48 % Termbank termtop insertions : 4672
% 0.23/0.48 % Search garbage collected termcells : 68
% 0.23/0.48
% 0.23/0.48 % -------------------------------------------------
% 0.23/0.48 % User time : 0.008 s
% 0.23/0.48 % System time : 0.003 s
% 0.23/0.48 % Total time : 0.010 s
% 0.23/0.48 % Maximum resident set size: 3652 pages
% 0.23/0.48
% 0.23/0.48 % -------------------------------------------------
% 0.23/0.48 % User time : 0.035 s
% 0.23/0.48 % System time : 0.014 s
% 0.23/0.48 % Total time : 0.049 s
% 0.23/0.48 % Maximum resident set size: 4608 pages
% 0.23/0.48 % E exiting
%------------------------------------------------------------------------------