TSTP Solution File: NUM837+2 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : NUM837+2 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n009.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 : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 09:07:54 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof('qe(171)',conjecture,
    ? [X1] : vd269 = vplus(vd268,X1),
    file('/export/starexec/sandbox/tmp/tmp.kO7I0keyVC/E---3.1_5229.p','qe(171)') ).

fof('def(cond(conseq(axiom(3)), 12), 1)',axiom,
    ! [X16,X17] :
      ( less(X17,X16)
    <=> ? [X18] : X16 = vplus(X17,X18) ),
    file('/export/starexec/sandbox/tmp/tmp.kO7I0keyVC/E---3.1_5229.p','def(cond(conseq(axiom(3)), 12), 1)') ).

fof('holds(conjunct1(170), 270, 0)',axiom,
    less(vd268,vd269),
    file('/export/starexec/sandbox/tmp/tmp.kO7I0keyVC/E---3.1_5229.p','holds(conjunct1(170), 270, 0)') ).

fof(c_0_3,negated_conjecture,
    ~ ? [X1] : vd269 = vplus(vd268,X1),
    inference(assume_negation,[status(cth)],['qe(171)']) ).

fof(c_0_4,negated_conjecture,
    ! [X34] : vd269 != vplus(vd268,X34),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_5,plain,
    ! [X35,X36,X38,X39,X40] :
      ( ( ~ less(X36,X35)
        | X35 = vplus(X36,esk1_2(X35,X36)) )
      & ( X38 != vplus(X39,X40)
        | less(X39,X38) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 12), 1)'])])])])])]) ).

cnf(c_0_6,negated_conjecture,
    vd269 != vplus(vd268,X1),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    ( X2 = vplus(X1,esk1_2(X2,X1))
    | ~ less(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    less(vd268,vd269),
    inference(split_conjunct,[status(thm)],['holds(conjunct1(170), 270, 0)']) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : NUM837+2 : TPTP v8.1.2. Released v4.1.0.
% 0.11/0.12  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n009.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Fri May  3 09:19:10 EDT 2024
% 0.11/0.33  % CPUTime    : 
% 0.17/0.45  Running first-order model finding
% 0.17/0.45  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.kO7I0keyVC/E---3.1_5229.p
% 0.17/0.46  # Version: 3.1.0
% 0.17/0.46  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46  # Starting sh5l with 300s (1) cores
% 0.17/0.46  # new_bool_3 with pid 5309 completed with status 0
% 0.17/0.46  # Result found by new_bool_3
% 0.17/0.46  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46  # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.17/0.46  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46  # SAT001_MinMin_p005000_rr_RG with pid 5312 completed with status 0
% 0.17/0.46  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.46  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46  # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.17/0.46  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46  # Preprocessing time       : 0.001 s
% 0.17/0.46  # Presaturation interreduction done
% 0.17/0.46  
% 0.17/0.46  # Proof found!
% 0.17/0.46  # SZS status Theorem
% 0.17/0.46  # SZS output start CNFRefutation
% See solution above
% 0.17/0.46  # Parsed axioms                        : 22
% 0.17/0.46  # Removed by relevancy pruning/SinE    : 6
% 0.17/0.46  # Initial clauses                      : 18
% 0.17/0.46  # Removed in clause preprocessing      : 0
% 0.17/0.46  # Initial clauses in saturation        : 18
% 0.17/0.46  # Processed clauses                    : 50
% 0.17/0.46  # ...of these trivial                  : 0
% 0.17/0.46  # ...subsumed                          : 5
% 0.17/0.46  # ...remaining for further processing  : 45
% 0.17/0.46  # Other redundant clauses eliminated   : 11
% 0.17/0.46  # Clauses deleted for lack of memory   : 0
% 0.17/0.46  # Backward-subsumed                    : 0
% 0.17/0.46  # Backward-rewritten                   : 1
% 0.17/0.46  # Generated clauses                    : 54
% 0.17/0.46  # ...of the previous two non-redundant : 41
% 0.17/0.46  # ...aggressively subsumed             : 0
% 0.17/0.46  # Contextual simplify-reflections      : 0
% 0.17/0.46  # Paramodulations                      : 42
% 0.17/0.46  # Factorizations                       : 0
% 0.17/0.46  # NegExts                              : 0
% 0.17/0.46  # Equation resolutions                 : 12
% 0.17/0.46  # Disequality decompositions           : 0
% 0.17/0.46  # Total rewrite steps                  : 16
% 0.17/0.46  # ...of those cached                   : 5
% 0.17/0.46  # Propositional unsat checks           : 0
% 0.17/0.46  #    Propositional check models        : 0
% 0.17/0.46  #    Propositional check unsatisfiable : 0
% 0.17/0.46  #    Propositional clauses             : 0
% 0.17/0.46  #    Propositional clauses after purity: 0
% 0.17/0.46  #    Propositional unsat core size     : 0
% 0.17/0.46  #    Propositional preprocessing time  : 0.000
% 0.17/0.46  #    Propositional encoding time       : 0.000
% 0.17/0.46  #    Propositional solver time         : 0.000
% 0.17/0.46  #    Success case prop preproc time    : 0.000
% 0.17/0.46  #    Success case prop encoding time   : 0.000
% 0.17/0.46  #    Success case prop solver time     : 0.000
% 0.17/0.46  # Current number of processed clauses  : 21
% 0.17/0.46  #    Positive orientable unit clauses  : 4
% 0.17/0.46  #    Positive unorientable unit clauses: 0
% 0.17/0.46  #    Negative unit clauses             : 10
% 0.17/0.46  #    Non-unit-clauses                  : 7
% 0.17/0.46  # Current number of unprocessed clauses: 16
% 0.17/0.46  # ...number of literals in the above   : 23
% 0.17/0.46  # Current number of archived formulas  : 0
% 0.17/0.46  # Current number of archived clauses   : 17
% 0.17/0.46  # Clause-clause subsumption calls (NU) : 8
% 0.17/0.46  # Rec. Clause-clause subsumption calls : 8
% 0.17/0.46  # Non-unit clause-clause subsumptions  : 0
% 0.17/0.46  # Unit Clause-clause subsumption calls : 4
% 0.17/0.46  # Rewrite failures with RHS unbound    : 0
% 0.17/0.46  # BW rewrite match attempts            : 1
% 0.17/0.46  # BW rewrite match successes           : 1
% 0.17/0.46  # Condensation attempts                : 0
% 0.17/0.46  # Condensation successes               : 0
% 0.17/0.46  # Termbank termtop insertions          : 1462
% 0.17/0.46  # Search garbage collected termcells   : 304
% 0.17/0.46  
% 0.17/0.46  # -------------------------------------------------
% 0.17/0.46  # User time                : 0.006 s
% 0.17/0.46  # System time              : 0.000 s
% 0.17/0.46  # Total time               : 0.006 s
% 0.17/0.46  # Maximum resident set size: 1728 pages
% 0.17/0.46  
% 0.17/0.46  # -------------------------------------------------
% 0.17/0.46  # User time                : 0.007 s
% 0.17/0.46  # System time              : 0.002 s
% 0.17/0.46  # Total time               : 0.009 s
% 0.17/0.46  # Maximum resident set size: 1732 pages
% 0.17/0.46  % E---3.1 exiting
%------------------------------------------------------------------------------