TSTP Solution File: NUM659_8 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : NUM659_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n022.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:56:55 EDT 2023

% Result   : Theorem 0.17s 0.44s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   17 (   6 unt;   4 typ;   0 def)
%            Number of atoms       :   24 (   8 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   25 (  14   ~;   4   |;   1   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    8 (   0 sgn;   8   !;   0   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    x: nat ).

tff(decl_23,type,
    y: nat ).

tff(decl_24,type,
    less: ( nat * nat ) > $o ).

tff(decl_25,type,
    more: ( nat * nat ) > $o ).

tff(n,axiom,
    ~ ( ~ less(x,y)
     => ( x = y ) ),
    file('/export/starexec/sandbox2/tmp/tmp.b8k65BJiGj/E---3.1_19941.p',n) ).

tff(satz10a,axiom,
    ! [X2: nat,X3: nat] :
      ( ( X2 != X3 )
     => ( ~ more(X2,X3)
       => less(X2,X3) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.b8k65BJiGj/E---3.1_19941.p',satz10a) ).

tff(satz10k,conjecture,
    more(x,y),
    file('/export/starexec/sandbox2/tmp/tmp.b8k65BJiGj/E---3.1_19941.p',satz10k) ).

tff(c_0_3,plain,
    ~ ( ~ less(x,y)
     => ( x = y ) ),
    inference(fof_simplification,[status(thm)],[n]) ).

tff(c_0_4,plain,
    ! [X2: nat,X3: nat] :
      ( ( X2 != X3 )
     => ( ~ more(X2,X3)
       => less(X2,X3) ) ),
    inference(fof_simplification,[status(thm)],[satz10a]) ).

tff(c_0_5,plain,
    ( ~ less(x,y)
    & ( x != y ) ),
    inference(fof_nnf,[status(thm)],[c_0_3]) ).

tff(c_0_6,plain,
    ! [X4: nat,X5: nat] :
      ( ( X4 = X5 )
      | more(X4,X5)
      | less(X4,X5) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).

tff(c_0_7,negated_conjecture,
    ~ more(x,y),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz10k])]) ).

tcf(c_0_8,plain,
    ~ less(x,y),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

tcf(c_0_9,plain,
    ! [X2: nat,X3: nat] :
      ( ( X2 = X3 )
      | more(X2,X3)
      | less(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

tcf(c_0_10,plain,
    x != y,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

tcf(c_0_11,negated_conjecture,
    ~ more(x,y),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : NUM659_8 : TPTP v8.1.2. Released v8.0.0.
% 0.11/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n022.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon Oct  2 13:21:39 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.17/0.43  Running first-order theorem proving
% 0.17/0.43  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/tmp/tmp.b8k65BJiGj/E---3.1_19941.p
% 0.17/0.44  # Version: 3.1pre001
% 0.17/0.44  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44  # Starting sh5l with 300s (1) cores
% 0.17/0.44  # new_bool_3 with pid 20020 completed with status 0
% 0.17/0.44  # Result found by new_bool_3
% 0.17/0.44  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.44  # Search class: FGUSF-FFSF00-SFFFFFNN
% 0.17/0.44  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44  # SAT001_MinMin_p005000_rr_RG with pid 20024 completed with status 0
% 0.17/0.44  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.44  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.44  # Search class: FGUSF-FFSF00-SFFFFFNN
% 0.17/0.44  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44  # Preprocessing time       : 0.001 s
% 0.17/0.44  # Presaturation interreduction done
% 0.17/0.44  
% 0.17/0.44  # Proof found!
% 0.17/0.44  # SZS status Theorem
% 0.17/0.44  # SZS output start CNFRefutation
% See solution above
% 0.17/0.44  # Parsed axioms                        : 9
% 0.17/0.44  # Removed by relevancy pruning/SinE    : 6
% 0.17/0.44  # Initial clauses                      : 4
% 0.17/0.44  # Removed in clause preprocessing      : 0
% 0.17/0.44  # Initial clauses in saturation        : 4
% 0.17/0.44  # Processed clauses                    : 8
% 0.17/0.44  # ...of these trivial                  : 0
% 0.17/0.44  # ...subsumed                          : 0
% 0.17/0.44  # ...remaining for further processing  : 8
% 0.17/0.44  # Other redundant clauses eliminated   : 0
% 0.17/0.44  # Clauses deleted for lack of memory   : 0
% 0.17/0.44  # Backward-subsumed                    : 0
% 0.17/0.44  # Backward-rewritten                   : 0
% 0.17/0.44  # Generated clauses                    : 1
% 0.17/0.44  # ...of the previous two non-redundant : 0
% 0.17/0.44  # ...aggressively subsumed             : 0
% 0.17/0.44  # Contextual simplify-reflections      : 0
% 0.17/0.44  # Paramodulations                      : 1
% 0.17/0.44  # Factorizations                       : 0
% 0.17/0.44  # NegExts                              : 0
% 0.17/0.44  # Equation resolutions                 : 0
% 0.17/0.44  # Total rewrite steps                  : 0
% 0.17/0.44  # Propositional unsat checks           : 0
% 0.17/0.44  #    Propositional check models        : 0
% 0.17/0.44  #    Propositional check unsatisfiable : 0
% 0.17/0.44  #    Propositional clauses             : 0
% 0.17/0.44  #    Propositional clauses after purity: 0
% 0.17/0.44  #    Propositional unsat core size     : 0
% 0.17/0.44  #    Propositional preprocessing time  : 0.000
% 0.17/0.44  #    Propositional encoding time       : 0.000
% 0.17/0.44  #    Propositional solver time         : 0.000
% 0.17/0.44  #    Success case prop preproc time    : 0.000
% 0.17/0.44  #    Success case prop encoding time   : 0.000
% 0.17/0.44  #    Success case prop solver time     : 0.000
% 0.17/0.44  # Current number of processed clauses  : 4
% 0.17/0.44  #    Positive orientable unit clauses  : 0
% 0.17/0.44  #    Positive unorientable unit clauses: 0
% 0.17/0.44  #    Negative unit clauses             : 3
% 0.17/0.44  #    Non-unit-clauses                  : 1
% 0.17/0.44  # Current number of unprocessed clauses: 0
% 0.17/0.44  # ...number of literals in the above   : 0
% 0.17/0.44  # Current number of archived formulas  : 0
% 0.17/0.44  # Current number of archived clauses   : 4
% 0.17/0.44  # Clause-clause subsumption calls (NU) : 0
% 0.17/0.44  # Rec. Clause-clause subsumption calls : 0
% 0.17/0.44  # Non-unit clause-clause subsumptions  : 0
% 0.17/0.44  # Unit Clause-clause subsumption calls : 0
% 0.17/0.44  # Rewrite failures with RHS unbound    : 0
% 0.17/0.44  # BW rewrite match attempts            : 0
% 0.17/0.44  # BW rewrite match successes           : 0
% 0.17/0.44  # Condensation attempts                : 0
% 0.17/0.44  # Condensation successes               : 0
% 0.17/0.44  # Termbank termtop insertions          : 163
% 0.17/0.44  
% 0.17/0.44  # -------------------------------------------------
% 0.17/0.44  # User time                : 0.002 s
% 0.17/0.44  # System time              : 0.002 s
% 0.17/0.44  # Total time               : 0.004 s
% 0.17/0.44  # Maximum resident set size: 1612 pages
% 0.17/0.44  
% 0.17/0.44  # -------------------------------------------------
% 0.17/0.44  # User time                : 0.003 s
% 0.17/0.44  # System time              : 0.003 s
% 0.17/0.44  # Total time               : 0.006 s
% 0.17/0.44  # Maximum resident set size: 1692 pages
% 0.17/0.44  % E---3.1 exiting
% 0.17/0.44  % E---3.1 exiting
%------------------------------------------------------------------------------