%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD030-3 : TPTP v9.3.1. Bugfixed v2.1.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:22:45 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.67s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 11 unt; 0 nHn; 26 RR)
% Number of literals : 53 ( 0 equ; 30 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_multiplication_2,axiom,
( ~ product(X4,X6,X3)
| ~ product(X5,X2,X6)
| ~ product(X4,X5,X1)
| product(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_multiplication_2) ).
cnf(existence_of_identity_multiplication,axiom,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_multiplication) ).
cnf(commutativity_multiplication,axiom,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_multiplication) ).
cnf(product_4,negated_conjecture,
product(multiplicative_identity,a,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_4) ).
cnf(totality_of_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| product(X1,X2,multiply(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_multiplication) ).
cnf(not_product_5,negated_conjecture,
~ product(d,b,multiply(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_product_5) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_0_8,plain,
( ~ product(X4,X6,X3)
| ~ product(X5,X2,X6)
| ~ product(X4,X5,X1)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[associativity_multiplication_2]) ).
cnf(c_0_9,plain,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_10,plain,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_11,plain,
( ~ product(X4,X6,X3)
| ~ product(X5,X2,X6)
| ~ product(X4,X5,X1)
| product(X1,X2,X3) ),
c_0_8 ).
cnf(c_0_12,plain,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
c_0_9 ).
cnf(c_0_13,plain,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
product(multiplicative_identity,a,d),
product_4 ).
cnf(c_0_15,plain,
( ~ defined(X2)
| ~ product(X4,X2,X3)
| ~ product(X4,multiplicative_identity,X1)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
product(a,multiplicative_identity,d),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ defined(X2)
| ~ defined(X1)
| product(X1,X2,multiply(X1,X2)) ),
inference(fof_simplification,[status(thm)],[totality_of_multiplication]) ).
cnf(c_0_18,negated_conjecture,
~ product(d,b,multiply(a,b)),
inference(fof_simplification,[status(thm)],[not_product_5]) ).
cnf(c_0_19,negated_conjecture,
( ~ defined(X1)
| ~ product(a,X1,X2)
| product(d,X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ defined(X2)
| ~ defined(X1)
| product(X1,X2,multiply(X1,X2)) ),
c_0_17 ).
cnf(c_0_21,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_22,negated_conjecture,
~ product(d,b,multiply(a,b)),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
( ~ defined(X1)
| product(d,X1,multiply(a,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD030-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.57 % Computer : n020.cluster.edu
% 0.13/0.57 % Model : x86_64 x86_64
% 0.13/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.57 % Memory : 8046.5625MB
% 0.13/0.57 % OS : Linux 6.8.0-71-generic
% 0.13/0.57 % CPULimit : 300
% 0.13/0.57 % WCLimit : 300
% 0.13/0.57 % DateTime : Mon Sep 21 15:39:33 UTC 2026
% 0.13/0.57 % CPUTime :
% 0.13/0.57 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.61 Running first-order theorem proving
% 0.16/0.61 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.16/0.67 % Version: 3.5.1
% 0.16/0.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.67 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.67 % Starting sh5l with 300s (1) cores
% 0.16/0.67 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3281982 completed with status 0
% 0.16/0.67 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.67 % No SInE strategy applied
% 0.16/0.67 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.16/0.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.67 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.67 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.16/0.67 % Starting new_bool_3 with 269s (1) cores
% 0.16/0.67 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.16/0.67 % H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 3281990 completed with status 0
% 0.16/0.67 % Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.16/0.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.67 % No SInE strategy applied
% 0.16/0.67 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.16/0.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.67 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.67 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.16/0.67 % Preprocessing time : 0.001 s
% 0.16/0.67 % Presaturation interreduction done
% 0.16/0.67
% 0.16/0.67 % Proof found!
% 0.16/0.67 % SZS status Unsatisfiable
% 0.16/0.67 % SZS output start CNFRefutation
% See solution above
% 0.16/0.67 % Parsed axioms : 31
% 0.16/0.67 % Removed by relevancy pruning/SinE : 0
% 0.16/0.67 % Initial clauses : 31
% 0.16/0.67 % Removed in clause preprocessing : 0
% 0.16/0.67 % Initial clauses in saturation : 31
% 0.16/0.67 % Processed clauses : 398
% 0.16/0.67 % ...of these trivial : 21
% 0.16/0.67 % ...subsumed : 93
% 0.16/0.67 % ...remaining for further processing : 284
% 0.16/0.67 % Other redundant clauses eliminated : 0
% 0.16/0.67 % Clauses deleted for lack of memory : 0
% 0.16/0.67 % Backward-subsumed : 1
% 0.16/0.67 % Backward-rewritten : 10
% 0.16/0.67 % Generated clauses : 1757
% 0.16/0.67 % ...of the previous two non-redundant : 1377
% 0.16/0.67 % ...aggressively subsumed : 0
% 0.16/0.67 % Contextual simplify-reflections : 1
% 0.16/0.67 % Paramodulations : 1753
% 0.16/0.67 % Factorizations : 4
% 0.16/0.67 % NegExts : 0
% 0.16/0.67 % Equation resolutions : 0
% 0.16/0.67 % Disequality decompositions : 0
% 0.16/0.67 % Total rewrite steps : 1032
% 0.16/0.67 % ...of those cached : 967
% 0.16/0.67 % Propositional unsat checks : 0
% 0.16/0.67 % Propositional check models : 0
% 0.16/0.67 % Propositional check unsatisfiable : 0
% 0.16/0.67 % Propositional clauses : 0
% 0.16/0.67 % Propositional clauses after purity: 0
% 0.16/0.67 % Propositional unsat core size : 0
% 0.16/0.67 % Propositional preprocessing time : 0.000
% 0.16/0.67 % Propositional encoding time : 0.000
% 0.16/0.67 % Propositional solver time : 0.000
% 0.16/0.67 % Success case prop preproc time : 0.000
% 0.16/0.67 % Success case prop encoding time : 0.000
% 0.16/0.67 % Success case prop solver time : 0.000
% 0.16/0.67 % Current number of processed clauses : 242
% 0.16/0.67 % Positive orientable unit clauses : 73
% 0.16/0.67 % Positive unorientable unit clauses: 0
% 0.16/0.67 % Negative unit clauses : 2
% 0.16/0.67 % Non-unit-clauses : 167
% 0.16/0.67 % Current number of unprocessed clauses: 1019
% 0.16/0.67 % ...number of literals in the above : 3321
% 0.16/0.67 % Current number of archived formulas : 0
% 0.16/0.67 % Current number of archived clauses : 42
% 0.16/0.67 % Clause-clause subsumption calls (NU) : 2199
% 0.16/0.67 % Rec. Clause-clause subsumption calls : 1766
% 0.16/0.67 % Non-unit clause-clause subsumptions : 95
% 0.16/0.67 % Unit Clause-clause subsumption calls : 127
% 0.16/0.67 % Rewrite failures with RHS unbound : 0
% 0.16/0.67 % BW rewrite match attempts : 36
% 0.16/0.67 % BW rewrite match successes : 10
% 0.16/0.67 % Condensation attempts : 0
% 0.16/0.67 % Condensation successes : 0
% 0.16/0.67 % Termbank termtop insertions : 24676
% 0.16/0.67 % Search garbage collected termcells : 116
% 0.16/0.67
% 0.16/0.67 % -------------------------------------------------
% 0.16/0.67 % User time : 0.031 s
% 0.16/0.67 % System time : 0.007 s
% 0.16/0.67 % Total time : 0.038 s
% 0.16/0.67 % Maximum resident set size: 3660 pages
% 0.16/0.67
% 0.16/0.67 % -------------------------------------------------
% 0.16/0.67 % User time : 0.165 s
% 0.16/0.67 % System time : 0.027 s
% 0.16/0.67 % Total time : 0.192 s
% 0.16/0.67 % Maximum resident set size: 4608 pages
% 0.16/0.67 % E exiting
%------------------------------------------------------------------------------