TSTP Solution File: NUM343+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : NUM343+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 18:58:48 EDT 2023

% Result   : Theorem 0.14s 0.44s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   3 unt;   0 def)
%            Number of atoms       :   27 (   5 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   30 (  13   ~;   5   |;   8   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   13 (   1 sgn;   7   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(less_property,axiom,
    ! [X1,X2] :
      ( less(X1,X2)
    <=> ( ~ less(X2,X1)
        & X2 != X1 ) ),
    file('/export/starexec/sandbox/tmp/tmp.9AlbnNpI3x/E---3.1_2753.p',less_property) ).

fof(sum_something_n0_samething,conjecture,
    ? [X1] :
      ( ( less(nn1,X1)
        & less(X1,n1) )
     => sum(n21,X1,n21) ),
    file('/export/starexec/sandbox/tmp/tmp.9AlbnNpI3x/E---3.1_2753.p',sum_something_n0_samething) ).

fof(c_0_2,plain,
    ! [X1,X2] :
      ( less(X1,X2)
    <=> ( ~ less(X2,X1)
        & X2 != X1 ) ),
    inference(fof_simplification,[status(thm)],[less_property]) ).

fof(c_0_3,plain,
    ! [X90,X91] :
      ( ( ~ less(X91,X90)
        | ~ less(X90,X91) )
      & ( X91 != X90
        | ~ less(X90,X91) )
      & ( less(X91,X90)
        | X91 = X90
        | less(X90,X91) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

fof(c_0_4,negated_conjecture,
    ~ ? [X1] :
        ( ( less(nn1,X1)
          & less(X1,n1) )
       => sum(n21,X1,n21) ),
    inference(assume_negation,[status(cth)],[sum_something_n0_samething]) ).

cnf(c_0_5,plain,
    ( X1 != X2
    | ~ less(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

fof(c_0_6,negated_conjecture,
    ! [X33] :
      ( less(nn1,X33)
      & less(X33,n1)
      & ~ sum(n21,X33,n21) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).

cnf(c_0_7,plain,
    ~ less(X1,X1),
    inference(er,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    less(X1,n1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_7,c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09  % Problem    : NUM343+1 : TPTP v8.1.2. Released v3.1.0.
% 0.09/0.10  % Command    : run_E %s %d THM
% 0.09/0.30  % Computer : n026.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 2400
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Mon Oct  2 14:15:14 EDT 2023
% 0.09/0.30  % CPUTime    : 
% 0.14/0.41  Running first-order model finding
% 0.14/0.41  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.9AlbnNpI3x/E---3.1_2753.p
% 0.14/0.44  # Version: 3.1pre001
% 0.14/0.44  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.14/0.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.14/0.44  # Starting new_bool_3 with 600s (2) cores
% 0.14/0.44  # Starting new_bool_1 with 600s (2) cores
% 0.14/0.44  # Starting sh5l with 300s (1) cores
% 0.14/0.44  # new_bool_3 with pid 2834 completed with status 0
% 0.14/0.44  # Result found by new_bool_3
% 0.14/0.44  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.14/0.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.14/0.44  # Starting new_bool_3 with 600s (2) cores
% 0.14/0.44  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44  # Search class: FGHSS-FFMM21-MFFFFFNN
% 0.14/0.44  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.14/0.44  # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 361s (1) cores
% 0.14/0.44  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 61s (1) cores
% 0.14/0.44  # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 2840 completed with status 0
% 0.14/0.44  # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 0.14/0.44  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.14/0.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.14/0.44  # Starting new_bool_3 with 600s (2) cores
% 0.14/0.44  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44  # Search class: FGHSS-FFMM21-MFFFFFNN
% 0.14/0.44  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.14/0.44  # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 361s (1) cores
% 0.14/0.44  # Preprocessing time       : 0.002 s
% 0.14/0.44  # Presaturation interreduction done
% 0.14/0.44  
% 0.14/0.44  # Proof found!
% 0.14/0.44  # SZS status Theorem
% 0.14/0.44  # SZS output start CNFRefutation
% See solution above
% 0.14/0.44  # Parsed axioms                        : 402
% 0.14/0.44  # Removed by relevancy pruning/SinE    : 256
% 0.14/0.44  # Initial clauses                      : 150
% 0.14/0.44  # Removed in clause preprocessing      : 0
% 0.14/0.44  # Initial clauses in saturation        : 150
% 0.14/0.44  # Processed clauses                    : 155
% 0.14/0.44  # ...of these trivial                  : 0
% 0.14/0.44  # ...subsumed                          : 0
% 0.14/0.44  # ...remaining for further processing  : 155
% 0.14/0.44  # Other redundant clauses eliminated   : 1
% 0.14/0.44  # Clauses deleted for lack of memory   : 0
% 0.14/0.44  # Backward-subsumed                    : 0
% 0.14/0.44  # Backward-rewritten                   : 0
% 0.14/0.44  # Generated clauses                    : 3
% 0.14/0.44  # ...of the previous two non-redundant : 1
% 0.14/0.44  # ...aggressively subsumed             : 0
% 0.14/0.44  # Contextual simplify-reflections      : 0
% 0.14/0.44  # Paramodulations                      : 2
% 0.14/0.44  # Factorizations                       : 0
% 0.14/0.44  # NegExts                              : 0
% 0.14/0.44  # Equation resolutions                 : 1
% 0.14/0.44  # Total rewrite steps                  : 0
% 0.14/0.44  # Propositional unsat checks           : 0
% 0.14/0.44  #    Propositional check models        : 0
% 0.14/0.44  #    Propositional check unsatisfiable : 0
% 0.14/0.44  #    Propositional clauses             : 0
% 0.14/0.44  #    Propositional clauses after purity: 0
% 0.14/0.44  #    Propositional unsat core size     : 0
% 0.14/0.44  #    Propositional preprocessing time  : 0.000
% 0.14/0.44  #    Propositional encoding time       : 0.000
% 0.14/0.44  #    Propositional solver time         : 0.000
% 0.14/0.44  #    Success case prop preproc time    : 0.000
% 0.14/0.44  #    Success case prop encoding time   : 0.000
% 0.14/0.44  #    Success case prop solver time     : 0.000
% 0.14/0.44  # Current number of processed clauses  : 4
% 0.14/0.44  #    Positive orientable unit clauses  : 1
% 0.14/0.44  #    Positive unorientable unit clauses: 0
% 0.14/0.44  #    Negative unit clauses             : 2
% 0.14/0.44  #    Non-unit-clauses                  : 1
% 0.14/0.44  # Current number of unprocessed clauses: 146
% 0.14/0.44  # ...number of literals in the above   : 212
% 0.14/0.44  # Current number of archived formulas  : 0
% 0.14/0.44  # Current number of archived clauses   : 150
% 0.14/0.44  # Clause-clause subsumption calls (NU) : 364
% 0.14/0.44  # Rec. Clause-clause subsumption calls : 111
% 0.14/0.44  # Non-unit clause-clause subsumptions  : 0
% 0.14/0.44  # Unit Clause-clause subsumption calls : 33
% 0.14/0.44  # Rewrite failures with RHS unbound    : 0
% 0.14/0.44  # BW rewrite match attempts            : 0
% 0.14/0.44  # BW rewrite match successes           : 0
% 0.14/0.44  # Condensation attempts                : 0
% 0.14/0.44  # Condensation successes               : 0
% 0.14/0.44  # Termbank termtop insertions          : 10704
% 0.14/0.44  
% 0.14/0.44  # -------------------------------------------------
% 0.14/0.44  # User time                : 0.009 s
% 0.14/0.44  # System time              : 0.006 s
% 0.14/0.44  # Total time               : 0.015 s
% 0.14/0.44  # Maximum resident set size: 2752 pages
% 0.14/0.44  
% 0.14/0.44  # -------------------------------------------------
% 0.14/0.44  # User time                : 0.024 s
% 0.14/0.44  # System time              : 0.008 s
% 0.14/0.44  # Total time               : 0.033 s
% 0.14/0.44  # Maximum resident set size: 2036 pages
% 0.14/0.44  % E---3.1 exiting
%------------------------------------------------------------------------------