↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : FLD013-5 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n013.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:40 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.45s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   32 (  17 unt;   0 nHn;  32 RR)
%            Number of literals    :   55 (   0 equ;  26 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   40 (   0 sgn)

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

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

cnf(sum_9,negated_conjecture,
    sum(a,c,u),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_9) ).

cnf(sum_7,negated_conjecture,
    sum(additive_identity,a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_7) ).

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

cnf(c_is_defined,hypothesis,
    defined(c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).

cnf(sum_10,negated_conjecture,
    sum(d,b,v),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_10) ).

cnf(not_sum_11,negated_conjecture,
    ~ sum(additive_identity,u,v),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_sum_11) ).

cnf(sum_8,negated_conjecture,
    sum(additive_identity,c,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_8) ).

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

cnf(c_0_10,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_11,plain,
    ( ~ sum(X2,X1,X3)
    | sum(X1,X2,X3) ),
    c_0_9 ).

cnf(c_0_12,negated_conjecture,
    sum(a,c,u),
    sum_9 ).

cnf(c_0_13,plain,
    ( ~ sum(X5,X6,X3)
    | ~ sum(X4,X6,X2)
    | ~ sum(X1,X4,X5)
    | sum(X1,X2,X3) ),
    c_0_10 ).

cnf(c_0_14,negated_conjecture,
    sum(c,a,u),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ sum(X1,X3,c)
    | ~ sum(X3,a,X2)
    | sum(X1,X2,u) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,negated_conjecture,
    sum(additive_identity,a,b),
    sum_7 ).

cnf(c_0_17,plain,
    ( ~ defined(X1)
    | sum(additive_identity,X1,X1) ),
    inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ sum(X1,additive_identity,c)
    | sum(X1,b,u) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( ~ defined(X1)
    | sum(additive_identity,X1,X1) ),
    c_0_17 ).

cnf(c_0_20,negated_conjecture,
    ( ~ sum(X1,additive_identity,c)
    | sum(b,X1,u) ),
    inference(spm,[status(thm)],[c_0_11,c_0_18]) ).

cnf(c_0_21,plain,
    ( ~ defined(X1)
    | sum(X1,additive_identity,X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_19]) ).

cnf(c_0_22,hypothesis,
    defined(c),
    c_is_defined ).

cnf(c_0_23,negated_conjecture,
    sum(d,b,v),
    sum_10 ).

cnf(c_0_24,negated_conjecture,
    sum(b,c,u),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

cnf(c_0_25,negated_conjecture,
    ~ sum(additive_identity,u,v),
    inference(fof_simplification,[status(thm)],[not_sum_11]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ sum(X1,X3,d)
    | ~ sum(X3,b,X2)
    | sum(X1,X2,v) ),
    inference(spm,[status(thm)],[c_0_13,c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    sum(c,b,u),
    inference(spm,[status(thm)],[c_0_11,c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ~ sum(additive_identity,u,v),
    c_0_25 ).

cnf(c_0_29,negated_conjecture,
    ( ~ sum(X1,c,d)
    | sum(X1,u,v) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    sum(additive_identity,c,d),
    sum_8 ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD013-5 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n013.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 15:36:51 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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.10/0.45  % Version: 3.5.1
% 0.10/0.45  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45  % Starting sh5l with 300s (1) cores
% 0.10/0.45  % new_bool_1 with pid 1101208 completed with status 0
% 0.10/0.45  % Result found by new_bool_1
% 0.10/0.45  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45  % Search class: FHUNF-FFSM00-SFFFFFNN
% 0.10/0.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45  % SubtermCWHack with pid 1101215 completed with status 0
% 0.10/0.45  % Result found by SubtermCWHack
% 0.10/0.45  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45  % Search class: FHUNF-FFSM00-SFFFFFNN
% 0.10/0.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45  % Preprocessing time       : 0.002 s
% 0.10/0.45  
% 0.10/0.45  % Proof found!
% 0.10/0.45  % SZS status Unsatisfiable
% 0.10/0.45  % SZS output start CNFRefutation
% See solution above
% 0.10/0.45  % Parsed axioms                        : 37
% 0.10/0.45  % Removed by relevancy pruning/SinE    : 21
% 0.10/0.45  % Initial clauses                      : 16
% 0.10/0.45  % Removed in clause preprocessing      : 0
% 0.10/0.45  % Initial clauses in saturation        : 16
% 0.10/0.45  % Processed clauses                    : 51
% 0.10/0.45  % ...of these trivial                  : 0
% 0.10/0.45  % ...subsumed                          : 1
% 0.10/0.45  % ...remaining for further processing  : 50
% 0.10/0.45  % Other redundant clauses eliminated   : 0
% 0.10/0.45  % Clauses deleted for lack of memory   : 0
% 0.10/0.45  % Backward-subsumed                    : 0
% 0.10/0.45  % Backward-rewritten                   : 0
% 0.10/0.45  % Generated clauses                    : 118
% 0.10/0.45  % ...of the previous two non-redundant : 103
% 0.10/0.45  % ...aggressively subsumed             : 0
% 0.10/0.45  % Contextual simplify-reflections      : 0
% 0.10/0.45  % Paramodulations                      : 118
% 0.10/0.45  % Factorizations                       : 0
% 0.10/0.45  % NegExts                              : 0
% 0.10/0.45  % Equation resolutions                 : 0
% 0.10/0.45  % Disequality decompositions           : 0
% 0.10/0.45  % Total rewrite steps                  : 20
% 0.10/0.45  % ...of those cached                   : 6
% 0.10/0.45  % Propositional unsat checks           : 0
% 0.10/0.45  %    Propositional check models        : 0
% 0.10/0.45  %    Propositional check unsatisfiable : 0
% 0.10/0.45  %    Propositional clauses             : 0
% 0.10/0.45  %    Propositional clauses after purity: 0
% 0.10/0.45  %    Propositional unsat core size     : 0
% 0.10/0.45  %    Propositional preprocessing time  : 0.000
% 0.10/0.45  %    Propositional encoding time       : 0.000
% 0.10/0.45  %    Propositional solver time         : 0.000
% 0.10/0.45  %    Success case prop preproc time    : 0.000
% 0.10/0.45  %    Success case prop encoding time   : 0.000
% 0.10/0.45  %    Success case prop solver time     : 0.000
% 0.10/0.45  % Current number of processed clauses  : 50
% 0.10/0.45  %    Positive orientable unit clauses  : 23
% 0.10/0.45  %    Positive unorientable unit clauses: 0
% 0.10/0.45  %    Negative unit clauses             : 1
% 0.10/0.45  %    Non-unit-clauses                  : 26
% 0.10/0.45  % Current number of unprocessed clauses: 68
% 0.10/0.45  % ...number of literals in the above   : 223
% 0.10/0.45  % Current number of archived formulas  : 0
% 0.10/0.45  % Current number of archived clauses   : 0
% 0.10/0.45  % Clause-clause subsumption calls (NU) : 57
% 0.10/0.45  % Rec. Clause-clause subsumption calls : 57
% 0.10/0.45  % Non-unit clause-clause subsumptions  : 1
% 0.10/0.45  % Unit Clause-clause subsumption calls : 0
% 0.10/0.45  % Rewrite failures with RHS unbound    : 0
% 0.10/0.45  % BW rewrite match attempts            : 3
% 0.10/0.45  % BW rewrite match successes           : 0
% 0.10/0.45  % Condensation attempts                : 0
% 0.10/0.45  % Condensation successes               : 0
% 0.10/0.45  % Termbank termtop insertions          : 1806
% 0.10/0.45  % Search garbage collected termcells   : 156
% 0.10/0.45  
% 0.10/0.45  % -------------------------------------------------
% 0.10/0.45  % User time                : 0.009 s
% 0.10/0.45  % System time              : 0.002 s
% 0.10/0.45  % Total time               : 0.011 s
% 0.10/0.45  % Maximum resident set size: 3660 pages
% 0.10/0.45  
% 0.10/0.45  % -------------------------------------------------
% 0.10/0.45  % User time                : 0.012 s
% 0.10/0.45  % System time              : 0.006 s
% 0.10/0.45  % Total time               : 0.018 s
% 0.10/0.45  % Maximum resident set size: 4864 pages
% 0.10/0.45  % E exiting
%------------------------------------------------------------------------------