%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : BOO011-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:12 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 19 ( 7 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(addition_is_well_defined,axiom,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',addition_is_well_defined) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',additive_identity1) ).
cnf(prove_equation,negated_conjecture,
inverse(additive_identity) != multiplicative_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equation) ).
cnf(additive_inverse2,axiom,
sum(X1,inverse(X1),multiplicative_identity),
file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',additive_inverse2) ).
cnf(c_0_4,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_5,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
c_0_4 ).
cnf(c_0_6,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_7,negated_conjecture,
inverse(additive_identity) != multiplicative_identity,
inference(fof_simplification,[status(thm)],[prove_equation]) ).
cnf(c_0_8,plain,
( ~ sum(additive_identity,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,axiom,
sum(X1,inverse(X1),multiplicative_identity),
additive_inverse2 ).
cnf(c_0_10,negated_conjecture,
inverse(additive_identity) != multiplicative_identity,
c_0_7 ).
cnf(c_0_11,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO011-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.37 % Computer : n001.cluster.edu
% 0.12/5.37 % Model : x86_64 x86_64
% 0.12/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.37 % Memory : 8046.5625MB
% 0.12/5.37 % OS : Linux 6.8.0-71-generic
% 0.12/5.37 % CPULimit : 300
% 0.12/5.37 % WCLimit : 300
% 0.12/5.37 % DateTime : Mon Sep 21 13:53:20 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 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.15/5.44 % Version: 3.5.1
% 0.15/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.44 % Starting sh5l with 300s (1) cores
% 0.15/5.44 % sh5l with pid 3288571 completed with status 0
% 0.15/5.44 % Result found by sh5l
% 0.15/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.44 % Starting sh5l with 300s (1) cores
% 0.15/5.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.44 % Search class: FHUSM-FFMF11-SFFFFFNN
% 0.15/5.44 % partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.15/5.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.44 % SubtermCWHack with pid 3288573 completed with status 0
% 0.15/5.44 % Result found by SubtermCWHack
% 0.15/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.44 % Starting sh5l with 300s (1) cores
% 0.15/5.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.44 % Search class: FHUSM-FFMF11-SFFFFFNN
% 0.15/5.44 % partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.15/5.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.44 % Preprocessing time : 0.001 s
% 0.15/5.44
% 0.15/5.44 % Proof found!
% 0.15/5.44 % SZS status Unsatisfiable
% 0.15/5.44 % SZS output start CNFRefutation
% See solution above
% 0.15/5.44 % Parsed axioms : 23
% 0.15/5.44 % Removed by relevancy pruning/SinE : 2
% 0.15/5.44 % Initial clauses : 21
% 0.15/5.44 % Removed in clause preprocessing : 0
% 0.15/5.44 % Initial clauses in saturation : 21
% 0.15/5.44 % Processed clauses : 13
% 0.15/5.44 % ...of these trivial : 0
% 0.15/5.44 % ...subsumed : 0
% 0.15/5.44 % ...remaining for further processing : 13
% 0.15/5.44 % Other redundant clauses eliminated : 0
% 0.15/5.44 % Clauses deleted for lack of memory : 0
% 0.15/5.44 % Backward-subsumed : 0
% 0.15/5.44 % Backward-rewritten : 0
% 0.15/5.44 % Generated clauses : 13
% 0.15/5.44 % ...of the previous two non-redundant : 4
% 0.15/5.44 % ...aggressively subsumed : 0
% 0.15/5.44 % Contextual simplify-reflections : 0
% 0.15/5.44 % Paramodulations : 13
% 0.15/5.44 % Factorizations : 0
% 0.15/5.44 % NegExts : 0
% 0.15/5.44 % Equation resolutions : 0
% 0.15/5.44 % Disequality decompositions : 0
% 0.15/5.44 % Total rewrite steps : 8
% 0.15/5.44 % ...of those cached : 0
% 0.15/5.44 % Propositional unsat checks : 0
% 0.15/5.44 % Propositional check models : 0
% 0.15/5.44 % Propositional check unsatisfiable : 0
% 0.15/5.44 % Propositional clauses : 0
% 0.15/5.44 % Propositional clauses after purity: 0
% 0.15/5.44 % Propositional unsat core size : 0
% 0.15/5.44 % Propositional preprocessing time : 0.000
% 0.15/5.44 % Propositional encoding time : 0.000
% 0.15/5.44 % Propositional solver time : 0.000
% 0.15/5.44 % Success case prop preproc time : 0.000
% 0.15/5.44 % Success case prop encoding time : 0.000
% 0.15/5.44 % Success case prop solver time : 0.000
% 0.15/5.44 % Current number of processed clauses : 13
% 0.15/5.44 % Positive orientable unit clauses : 8
% 0.15/5.44 % Positive unorientable unit clauses: 0
% 0.15/5.44 % Negative unit clauses : 1
% 0.15/5.44 % Non-unit-clauses : 4
% 0.15/5.44 % Current number of unprocessed clauses: 12
% 0.15/5.44 % ...number of literals in the above : 49
% 0.15/5.44 % Current number of archived formulas : 0
% 0.15/5.44 % Current number of archived clauses : 0
% 0.15/5.44 % Clause-clause subsumption calls (NU) : 2
% 0.15/5.44 % Rec. Clause-clause subsumption calls : 2
% 0.15/5.44 % Non-unit clause-clause subsumptions : 0
% 0.15/5.44 % Unit Clause-clause subsumption calls : 0
% 0.15/5.44 % Rewrite failures with RHS unbound : 0
% 0.15/5.44 % BW rewrite match attempts : 0
% 0.15/5.44 % BW rewrite match successes : 0
% 0.15/5.44 % Condensation attempts : 0
% 0.15/5.44 % Condensation successes : 0
% 0.15/5.44 % Termbank termtop insertions : 770
% 0.15/5.44 % Search garbage collected termcells : 74
% 0.15/5.44
% 0.15/5.44 % -------------------------------------------------
% 0.15/5.44 % User time : 0.002 s
% 0.15/5.44 % System time : 0.002 s
% 0.15/5.44 % Total time : 0.004 s
% 0.15/5.44 % Maximum resident set size: 3652 pages
% 0.15/5.44
% 0.15/5.44 % -------------------------------------------------
% 0.15/5.44 % User time : 0.005 s
% 0.15/5.44 % System time : 0.006 s
% 0.15/5.44 % Total time : 0.011 s
% 0.15/5.44 % Maximum resident set size: 4864 pages
% 0.15/5.44 % E exiting
%------------------------------------------------------------------------------