↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : FLD005-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 : n003.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:37 PM UTC 2026

% Result   : Unsatisfiable 0.16s 0.64s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   37 (  11 unt;   4 nHn;  37 RR)
%            Number of literals    :   84 (   0 equ;  48 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   62 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(totality_of_order_relation,axiom,
    ( ~ defined(X2)
    | ~ defined(X1)
    | less_or_equal(X2,X1)
    | less_or_equal(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_order_relation) ).

cnf(b_is_defined,hypothesis,
    defined(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).

cnf(antisymmetry_of_order_relation,axiom,
    ( ~ less_or_equal(X2,X1)
    | ~ less_or_equal(X1,X2)
    | sum(additive_identity,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',antisymmetry_of_order_relation) ).

cnf(associativity_addition_1,axiom,
    ( ~ sum(X5,X6,X3)
    | ~ sum(X4,X6,X2)
    | ~ sum(X1,X4,X5)
    | sum(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_addition_1) ).

cnf(totality_of_addition,axiom,
    ( ~ defined(X2)
    | ~ defined(X1)
    | sum(X1,X2,add(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).

cnf(not_sum_3,negated_conjecture,
    ~ sum(a,X1,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_3) ).

cnf(commutativity_addition,axiom,
    ( ~ sum(X2,X1,X3)
    | sum(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).

cnf(existence_of_inverse_addition,axiom,
    ( ~ defined(X1)
    | sum(additive_inverse(X1),X1,additive_identity) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).

cnf(a_is_defined,hypothesis,
    defined(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).

cnf(well_definedness_of_additive_inverse,axiom,
    ( ~ defined(X1)
    | defined(additive_inverse(X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_inverse) ).

cnf(c_0_10,plain,
    ( ~ defined(X2)
    | ~ defined(X1)
    | less_or_equal(X2,X1)
    | less_or_equal(X1,X2) ),
    inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).

cnf(c_0_11,plain,
    ( ~ defined(X2)
    | ~ defined(X1)
    | less_or_equal(X2,X1)
    | less_or_equal(X1,X2) ),
    c_0_10 ).

cnf(c_0_12,hypothesis,
    defined(b),
    b_is_defined ).

cnf(c_0_13,plain,
    ( ~ less_or_equal(X2,X1)
    | ~ less_or_equal(X1,X2)
    | sum(additive_identity,X1,X2) ),
    inference(fof_simplification,[status(thm)],[antisymmetry_of_order_relation]) ).

cnf(c_0_14,hypothesis,
    ( ~ defined(X1)
    | less_or_equal(b,X1)
    | less_or_equal(X1,b) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    ( ~ sum(X5,X6,X3)
    | ~ sum(X4,X6,X2)
    | ~ sum(X1,X4,X5)
    | sum(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[associativity_addition_1]) ).

cnf(c_0_16,plain,
    ( ~ less_or_equal(X2,X1)
    | ~ less_or_equal(X1,X2)
    | sum(additive_identity,X1,X2) ),
    c_0_13 ).

cnf(c_0_17,hypothesis,
    less_or_equal(b,b),
    inference(spm,[status(thm)],[c_0_14,c_0_12]) ).

cnf(c_0_18,plain,
    ( ~ sum(X5,X6,X3)
    | ~ sum(X4,X6,X2)
    | ~ sum(X1,X4,X5)
    | sum(X1,X2,X3) ),
    c_0_15 ).

cnf(c_0_19,hypothesis,
    sum(additive_identity,b,b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17])]) ).

cnf(c_0_20,plain,
    ( ~ defined(X2)
    | ~ defined(X1)
    | sum(X1,X2,add(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[totality_of_addition]) ).

cnf(c_0_21,negated_conjecture,
    ~ sum(a,X1,b),
    inference(fof_simplification,[status(thm)],[not_sum_3]) ).

cnf(c_0_22,hypothesis,
    ( ~ sum(X1,X3,additive_identity)
    | ~ sum(X3,b,X2)
    | sum(X1,X2,b) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    ( ~ defined(X2)
    | ~ defined(X1)
    | sum(X1,X2,add(X1,X2)) ),
    c_0_20 ).

cnf(c_0_24,plain,
    ( ~ sum(X2,X1,X3)
    | sum(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[commutativity_addition]) ).

cnf(c_0_25,plain,
    ( ~ defined(X1)
    | sum(additive_inverse(X1),X1,additive_identity) ),
    inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).

cnf(c_0_26,negated_conjecture,
    ~ sum(a,X1,b),
    c_0_21 ).

cnf(c_0_27,hypothesis,
    ( ~ sum(X1,X2,additive_identity)
    | ~ defined(X2)
    | sum(X1,add(X2,b),b) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12])]) ).

cnf(c_0_28,plain,
    ( ~ sum(X2,X1,X3)
    | sum(X1,X2,X3) ),
    c_0_24 ).

cnf(c_0_29,plain,
    ( ~ defined(X1)
    | sum(additive_inverse(X1),X1,additive_identity) ),
    c_0_25 ).

cnf(c_0_30,negated_conjecture,
    ( ~ sum(a,X1,additive_identity)
    | ~ defined(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,plain,
    ( ~ defined(X1)
    | sum(X1,additive_inverse(X1),additive_identity) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_32,hypothesis,
    defined(a),
    a_is_defined ).

cnf(c_0_33,plain,
    ( ~ defined(X1)
    | defined(additive_inverse(X1)) ),
    inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).

cnf(c_0_34,negated_conjecture,
    ~ defined(additive_inverse(a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).

cnf(c_0_35,plain,
    ( ~ defined(X1)
    | defined(additive_inverse(X1)) ),
    c_0_33 ).

cnf(c_0_36,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : FLD005-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.51  % Computer : n003.cluster.edu
% 0.09/0.51  % Model    : x86_64 x86_64
% 0.09/0.51  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.51  % Memory   : 8046.5625MB
% 0.09/0.51  % OS       : Linux 6.8.0-71-generic
% 0.09/0.51  % CPULimit : 300
% 0.09/0.51  % WCLimit  : 300
% 0.09/0.51  % DateTime : Mon Sep 21 15:38:01 UTC 2026
% 0.09/0.51  % CPUTime  : 
% 0.09/0.51  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.55  Running first-order theorem proving
% 0.09/0.55  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.64  % Version: 3.5.1
% 0.16/0.64  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.64  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.64  % Starting new_bool_1 with 300s (1) cores
% 0.16/0.64  % Starting sh5l with 300s (1) cores
% 0.16/0.64  % new_bool_3 with pid 461307 completed with status 9
% 0.16/0.64  % new_bool_1 with pid 461308 completed with status 9
% 0.16/0.64  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 461306 completed with status 0
% 0.16/0.64  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.64  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.64  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.64  % No SInE strategy applied
% 0.16/0.64  % Search class: FGUNF-FFMS21-SFFFFFNN
% 0.16/0.64  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.64  % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.64  % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.16/0.64  % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.64  % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.64  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 461312 completed with status 0
% 0.16/0.64  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.64  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.64  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.64  % No SInE strategy applied
% 0.16/0.64  % Search class: FGUNF-FFMS21-SFFFFFNN
% 0.16/0.64  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.64  % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.64  % Preprocessing time       : 0.002 s
% 0.16/0.64  % Presaturation interreduction done
% 0.16/0.64  
% 0.16/0.64  % Proof found!
% 0.16/0.64  % SZS status Unsatisfiable
% 0.16/0.64  % SZS output start CNFRefutation
% See solution above
% 0.16/0.64  % Parsed axioms                        : 29
% 0.16/0.64  % Removed by relevancy pruning/SinE    : 0
% 0.16/0.64  % Initial clauses                      : 29
% 0.16/0.64  % Removed in clause preprocessing      : 0
% 0.16/0.64  % Initial clauses in saturation        : 29
% 0.16/0.64  % Processed clauses                    : 779
% 0.16/0.64  % ...of these trivial                  : 7
% 0.16/0.64  % ...subsumed                          : 249
% 0.16/0.64  % ...remaining for further processing  : 523
% 0.16/0.64  % Other redundant clauses eliminated   : 0
% 0.16/0.64  % Clauses deleted for lack of memory   : 0
% 0.16/0.64  % Backward-subsumed                    : 22
% 0.16/0.64  % Backward-rewritten                   : 1
% 0.16/0.64  % Generated clauses                    : 2529
% 0.16/0.64  % ...of the previous two non-redundant : 2013
% 0.16/0.64  % ...aggressively subsumed             : 0
% 0.16/0.64  % Contextual simplify-reflections      : 0
% 0.16/0.64  % Paramodulations                      : 2529
% 0.16/0.64  % Factorizations                       : 0
% 0.16/0.64  % NegExts                              : 0
% 0.16/0.64  % Equation resolutions                 : 0
% 0.16/0.64  % Disequality decompositions           : 0
% 0.16/0.64  % Total rewrite steps                  : 1187
% 0.16/0.64  % ...of those cached                   : 1144
% 0.16/0.64  % Propositional unsat checks           : 0
% 0.16/0.64  %    Propositional check models        : 0
% 0.16/0.64  %    Propositional check unsatisfiable : 0
% 0.16/0.64  %    Propositional clauses             : 0
% 0.16/0.64  %    Propositional clauses after purity: 0
% 0.16/0.64  %    Propositional unsat core size     : 0
% 0.16/0.64  %    Propositional preprocessing time  : 0.000
% 0.16/0.64  %    Propositional encoding time       : 0.000
% 0.16/0.64  %    Propositional solver time         : 0.000
% 0.16/0.64  %    Success case prop preproc time    : 0.000
% 0.16/0.64  %    Success case prop encoding time   : 0.000
% 0.16/0.64  %    Success case prop solver time     : 0.000
% 0.16/0.64  % Current number of processed clauses  : 471
% 0.16/0.64  %    Positive orientable unit clauses  : 46
% 0.16/0.64  %    Positive unorientable unit clauses: 0
% 0.16/0.64  %    Negative unit clauses             : 5
% 0.16/0.64  %    Non-unit-clauses                  : 420
% 0.16/0.64  % Current number of unprocessed clauses: 1292
% 0.16/0.64  % ...number of literals in the above   : 4596
% 0.16/0.64  % Current number of archived formulas  : 0
% 0.16/0.64  % Current number of archived clauses   : 52
% 0.16/0.64  % Clause-clause subsumption calls (NU) : 15345
% 0.16/0.64  % Rec. Clause-clause subsumption calls : 11977
% 0.16/0.64  % Non-unit clause-clause subsumptions  : 257
% 0.16/0.64  % Unit Clause-clause subsumption calls : 519
% 0.16/0.64  % Rewrite failures with RHS unbound    : 0
% 0.16/0.64  % BW rewrite match attempts            : 9
% 0.16/0.64  % BW rewrite match successes           : 2
% 0.16/0.64  % Condensation attempts                : 0
% 0.16/0.64  % Condensation successes               : 0
% 0.16/0.64  % Termbank termtop insertions          : 35509
% 0.16/0.64  % Search garbage collected termcells   : 116
% 0.16/0.64  
% 0.16/0.64  % -------------------------------------------------
% 0.16/0.64  % User time                : 0.064 s
% 0.16/0.64  % System time              : 0.007 s
% 0.16/0.64  % Total time               : 0.071 s
% 0.16/0.64  % Maximum resident set size: 3616 pages
% 0.16/0.64  
% 0.16/0.64  % -------------------------------------------------
% 0.16/0.64  % User time                : 0.354 s
% 0.16/0.64  % System time              : 0.057 s
% 0.16/0.64  % Total time               : 0.411 s
% 0.16/0.64  % Maximum resident set size: 4608 pages
% 0.16/0.64  % E exiting
%------------------------------------------------------------------------------