%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO012-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 : n020.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:57 PM UTC 2026
% Result : Unsatisfiable 0.22s 5.60s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 41 ( 26 unt; 0 nHn; 19 RR)
% Number of literals : 72 ( 12 equ; 34 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 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 : 86 ( 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/sandbox/benchmark/Axioms/BOO002-0.ax',distributivity8) ).
cnf(multiplicative_identity1,axiom,
product(multiplicative_identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',multiplicative_identity1) ).
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(commutativity_of_addition,axiom,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',commutativity_of_addition) ).
cnf(multiplicative_inverse2,axiom,
product(X1,inverse(X1),additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',multiplicative_inverse2) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',closure_of_addition) ).
cnf(additive_inverse1,axiom,
sum(inverse(X1),X1,multiplicative_identity),
file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',additive_inverse1) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',additive_identity1) ).
cnf(multiplicative_inverse1,axiom,
product(inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',multiplicative_inverse1) ).
cnf(additive_inverse2,axiom,
sum(X1,inverse(X1),multiplicative_identity),
file('/export/starexec/sandbox/benchmark/Axioms/BOO002-0.ax',additive_inverse2) ).
cnf(prove_inverse_is_an_involution,negated_conjecture,
inverse(inverse(x)) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_inverse_is_an_involution) ).
cnf(c_0_11,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_12,plain,
( ~ product(X3,X5,X7)
| ~ product(X1,X4,X6)
| ~ sum(X4,X2,X5)
| ~ sum(X1,X2,X3)
| sum(X6,X2,X7) ),
c_0_11 ).
cnf(c_0_13,axiom,
product(multiplicative_identity,X1,X1),
multiplicative_identity1 ).
cnf(c_0_14,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_15,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_addition]) ).
cnf(c_0_16,plain,
( ~ sum(X5,X2,X3)
| ~ sum(X4,X2,multiplicative_identity)
| ~ product(X4,X5,X1)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
product(X1,inverse(X1),additive_identity),
multiplicative_inverse2 ).
cnf(c_0_18,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
c_0_14 ).
cnf(c_0_19,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_20,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
c_0_15 ).
cnf(c_0_21,plain,
( ~ sum(X3,X1,multiplicative_identity)
| ~ sum(inverse(X3),X1,X2)
| sum(additive_identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
sum(inverse(X1),X1,multiplicative_identity),
additive_inverse1 ).
cnf(c_0_23,plain,
( ~ sum(X2,X3,X1)
| X1 = add(X2,X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_25,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_26,plain,
( ~ sum(inverse(inverse(X1)),X1,X2)
| sum(additive_identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
add(X1,X2) = add(X2,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ sum(additive_identity,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_29,plain,
sum(additive_identity,X1,add(X1,inverse(inverse(X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_27]) ).
cnf(c_0_30,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_31,axiom,
product(inverse(X1),X1,additive_identity),
multiplicative_inverse1 ).
cnf(c_0_32,plain,
add(X1,inverse(inverse(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_29]),c_0_30]) ).
cnf(c_0_33,plain,
( ~ sum(X3,X1,X2)
| ~ sum(inverse(X3),X1,multiplicative_identity)
| sum(additive_identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_34,plain,
sum(X1,inverse(inverse(X1)),X1),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_35,axiom,
sum(X1,inverse(X1),multiplicative_identity),
additive_inverse2 ).
cnf(c_0_36,negated_conjecture,
inverse(inverse(x)) != x,
inference(fof_simplification,[status(thm)],[prove_inverse_is_an_involution]) ).
cnf(c_0_37,plain,
sum(additive_identity,inverse(inverse(X1)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_38,negated_conjecture,
inverse(inverse(x)) != x,
c_0_36 ).
cnf(c_0_39,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_37]),c_0_30]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO012-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.47 % Computer : n020.cluster.edu
% 0.16/5.47 % Model : x86_64 x86_64
% 0.16/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.47 % Memory : 8046.5625MB
% 0.16/5.47 % OS : Linux 6.8.0-71-generic
% 0.16/5.48 % CPULimit : 300
% 0.16/5.48 % WCLimit : 300
% 0.16/5.48 % DateTime : Mon Sep 21 13:49:08 UTC 2026
% 0.16/5.48 % CPUTime :
% 0.16/5.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/5.53 Running first-order theorem proving
% 0.22/5.53 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.22/5.60 % Version: 3.5.1
% 0.22/5.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/5.60 % Starting new_bool_3 with 300s (1) cores
% 0.22/5.60 % Starting new_bool_1 with 300s (1) cores
% 0.22/5.60 % Starting sh5l with 300s (1) cores
% 0.22/5.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3089264 completed with status 0
% 0.22/5.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/5.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/5.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.60 % No SInE strategy applied
% 0.22/5.60 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.22/5.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.60 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/5.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.22/5.60 % Starting new_bool_3 with 136s (1) cores
% 0.22/5.60 % Starting new_bool_1 with 136s (1) cores
% 0.22/5.60 % G-E--_208_C18_F1_SE_CS_SP_PS_S4d with pid 3089270 completed with status 0
% 0.22/5.60 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S4d
% 0.22/5.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/5.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.60 % No SInE strategy applied
% 0.22/5.60 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.22/5.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.60 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/5.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.22/5.60 % Preprocessing time : 0.002 s
% 0.22/5.60 % Presaturation interreduction done
% 0.22/5.60
% 0.22/5.60 % Proof found!
% 0.22/5.60 % SZS status Unsatisfiable
% 0.22/5.60 % SZS output start CNFRefutation
% See solution above
% 0.22/5.60 % Parsed axioms : 23
% 0.22/5.60 % Removed by relevancy pruning/SinE : 0
% 0.22/5.60 % Initial clauses : 23
% 0.22/5.60 % Removed in clause preprocessing : 0
% 0.22/5.60 % Initial clauses in saturation : 23
% 0.22/5.60 % Processed clauses : 167
% 0.22/5.60 % ...of these trivial : 18
% 0.22/5.60 % ...subsumed : 28
% 0.22/5.60 % ...remaining for further processing : 121
% 0.22/5.60 % Other redundant clauses eliminated : 0
% 0.22/5.60 % Clauses deleted for lack of memory : 0
% 0.22/5.60 % Backward-subsumed : 3
% 0.22/5.60 % Backward-rewritten : 16
% 0.22/5.60 % Generated clauses : 483
% 0.22/5.60 % ...of the previous two non-redundant : 233
% 0.22/5.60 % ...aggressively subsumed : 0
% 0.22/5.60 % Contextual simplify-reflections : 0
% 0.22/5.60 % Paramodulations : 483
% 0.22/5.60 % Factorizations : 0
% 0.22/5.60 % NegExts : 0
% 0.22/5.60 % Equation resolutions : 0
% 0.22/5.60 % Disequality decompositions : 0
% 0.22/5.60 % Total rewrite steps : 399
% 0.22/5.60 % ...of those cached : 332
% 0.22/5.60 % Propositional unsat checks : 0
% 0.22/5.60 % Propositional check models : 0
% 0.22/5.60 % Propositional check unsatisfiable : 0
% 0.22/5.60 % Propositional clauses : 0
% 0.22/5.60 % Propositional clauses after purity: 0
% 0.22/5.60 % Propositional unsat core size : 0
% 0.22/5.60 % Propositional preprocessing time : 0.000
% 0.22/5.60 % Propositional encoding time : 0.000
% 0.22/5.60 % Propositional solver time : 0.000
% 0.22/5.60 % Success case prop preproc time : 0.000
% 0.22/5.60 % Success case prop encoding time : 0.000
% 0.22/5.60 % Success case prop solver time : 0.000
% 0.22/5.60 % Current number of processed clauses : 79
% 0.22/5.60 % Positive orientable unit clauses : 27
% 0.22/5.60 % Positive unorientable unit clauses: 2
% 0.22/5.60 % Negative unit clauses : 0
% 0.22/5.60 % Non-unit-clauses : 50
% 0.22/5.60 % Current number of unprocessed clauses: 93
% 0.22/5.60 % ...number of literals in the above : 297
% 0.22/5.60 % Current number of archived formulas : 0
% 0.22/5.60 % Current number of archived clauses : 42
% 0.22/5.60 % Clause-clause subsumption calls (NU) : 975
% 0.22/5.60 % Rec. Clause-clause subsumption calls : 680
% 0.22/5.60 % Non-unit clause-clause subsumptions : 29
% 0.22/5.60 % Unit Clause-clause subsumption calls : 23
% 0.22/5.60 % Rewrite failures with RHS unbound : 0
% 0.22/5.60 % BW rewrite match attempts : 172
% 0.22/5.60 % BW rewrite match successes : 37
% 0.22/5.60 % Condensation attempts : 0
% 0.22/5.60 % Condensation successes : 0
% 0.22/5.60 % Termbank termtop insertions : 5429
% 0.22/5.60 % Search garbage collected termcells : 68
% 0.22/5.60
% 0.22/5.60 % -------------------------------------------------
% 0.22/5.60 % User time : 0.018 s
% 0.22/5.60 % System time : 0.005 s
% 0.22/5.60 % Total time : 0.023 s
% 0.22/5.60 % Maximum resident set size: 3652 pages
% 0.22/5.60
% 0.22/5.60 % -------------------------------------------------
% 0.22/5.60 % User time : 0.054 s
% 0.22/5.60 % System time : 0.012 s
% 0.22/5.60 % Total time : 0.066 s
% 0.22/5.60 % Maximum resident set size: 4864 pages
% 0.22/5.60 % E exiting
%------------------------------------------------------------------------------