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

View Problem - Process Solution

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

% Computer : n012.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 19:08:38 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof('holds(214, 352, 0)',conjecture,
    greater(vplus(vd344,vd347),vplus(vd345,vd348)),
    file('/export/starexec/sandbox2/tmp/tmp.ISf4K5i08z/E---3.1_11802.p','holds(214, 352, 0)') ).

fof('ass(cond(61, 0), 0)',axiom,
    ! [X47,X48] : vplus(X48,X47) = vplus(X47,X48),
    file('/export/starexec/sandbox2/tmp/tmp.ISf4K5i08z/E---3.1_11802.p','ass(cond(61, 0), 0)') ).

fof('ass(cond(goal(130), 0), 2)',axiom,
    ! [X30,X31] :
      ( ~ greater(X30,X31)
      | ~ less(X30,X31) ),
    file('/export/starexec/sandbox2/tmp/tmp.ISf4K5i08z/E---3.1_11802.p','ass(cond(goal(130), 0), 2)') ).

fof('ass(cond(goal(130), 0), 0)',axiom,
    ! [X30,X31] :
      ( X30 = X31
      | greater(X30,X31)
      | less(X30,X31) ),
    file('/export/starexec/sandbox2/tmp/tmp.ISf4K5i08z/E---3.1_11802.p','ass(cond(goal(130), 0), 0)') ).

fof('holds(212, 350, 0)',axiom,
    greater(vplus(vd344,vd347),vplus(vd345,vd347)),
    file('/export/starexec/sandbox2/tmp/tmp.ISf4K5i08z/E---3.1_11802.p','holds(212, 350, 0)') ).

fof('ass(cond(168, 0), 0)',axiom,
    ! [X15,X16,X17] :
      ( ( less(X16,X17)
        & less(X15,X16) )
     => less(X15,X17) ),
    file('/export/starexec/sandbox2/tmp/tmp.ISf4K5i08z/E---3.1_11802.p','ass(cond(168, 0), 0)') ).

fof('ass(cond(140, 0), 0)',axiom,
    ! [X28,X29] :
      ( greater(X28,X29)
     => less(X29,X28) ),
    file('/export/starexec/sandbox2/tmp/tmp.ISf4K5i08z/E---3.1_11802.p','ass(cond(140, 0), 0)') ).

fof('holds(213, 351, 1)',axiom,
    greater(vplus(vd347,vd345),vplus(vd348,vd345)),
    file('/export/starexec/sandbox2/tmp/tmp.ISf4K5i08z/E---3.1_11802.p','holds(213, 351, 1)') ).

fof('holds(213, 351, 0)',axiom,
    vplus(vd345,vd347) = vplus(vd347,vd345),
    file('/export/starexec/sandbox2/tmp/tmp.ISf4K5i08z/E---3.1_11802.p','holds(213, 351, 0)') ).

fof('holds(213, 351, 2)',axiom,
    vplus(vd348,vd345) = vplus(vd345,vd348),
    file('/export/starexec/sandbox2/tmp/tmp.ISf4K5i08z/E---3.1_11802.p','holds(213, 351, 2)') ).

fof(c_0_10,negated_conjecture,
    ~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(214, 352, 0)'])]) ).

fof(c_0_11,plain,
    ! [X144,X145] : vplus(X145,X144) = vplus(X144,X145),
    inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).

fof(c_0_12,plain,
    ! [X30,X31] :
      ( ~ greater(X30,X31)
      | ~ less(X30,X31) ),
    inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 2)']) ).

cnf(c_0_13,negated_conjecture,
    ~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    vplus(X1,X2) = vplus(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_15,plain,
    ! [X105,X106] :
      ( X105 = X106
      | greater(X105,X106)
      | less(X105,X106) ),
    inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).

fof(c_0_16,plain,
    ! [X109,X110] :
      ( ~ greater(X109,X110)
      | ~ less(X109,X110) ),
    inference(variable_rename,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    greater(vplus(vd344,vd347),vplus(vd345,vd347)),
    inference(split_conjunct,[status(thm)],['holds(212, 350, 0)']) ).

fof(c_0_18,plain,
    ! [X90,X91,X92] :
      ( ~ less(X91,X92)
      | ~ less(X90,X91)
      | less(X90,X92) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(168, 0), 0)'])]) ).

cnf(c_0_19,negated_conjecture,
    ~ greater(vplus(vd347,vd344),vplus(vd345,vd348)),
    inference(rw,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,plain,
    ( X1 = X2
    | greater(X1,X2)
    | less(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_21,plain,
    ! [X103,X104] :
      ( ~ greater(X103,X104)
      | less(X104,X103) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])]) ).

cnf(c_0_22,plain,
    greater(vplus(vd347,vd345),vplus(vd348,vd345)),
    inference(split_conjunct,[status(thm)],['holds(213, 351, 1)']) ).

cnf(c_0_23,plain,
    vplus(vd345,vd347) = vplus(vd347,vd345),
    inference(split_conjunct,[status(thm)],['holds(213, 351, 0)']) ).

cnf(c_0_24,plain,
    vplus(vd348,vd345) = vplus(vd345,vd348),
    inference(split_conjunct,[status(thm)],['holds(213, 351, 2)']) ).

cnf(c_0_25,plain,
    ( ~ greater(X1,X2)
    | ~ less(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_26,plain,
    greater(vplus(vd347,vd344),vplus(vd345,vd347)),
    inference(rw,[status(thm)],[c_0_17,c_0_14]) ).

cnf(c_0_27,plain,
    ( less(X3,X2)
    | ~ less(X1,X2)
    | ~ less(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_28,negated_conjecture,
    ( vplus(vd347,vd344) = vplus(vd345,vd348)
    | less(vplus(vd347,vd344),vplus(vd345,vd348)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_29,plain,
    ( less(X2,X1)
    | ~ greater(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_30,plain,
    greater(vplus(vd345,vd347),vplus(vd345,vd348)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

cnf(c_0_31,plain,
    ~ less(vplus(vd347,vd344),vplus(vd345,vd347)),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_32,negated_conjecture,
    ( vplus(vd347,vd344) = vplus(vd345,vd348)
    | less(vplus(vd347,vd344),X1)
    | ~ less(vplus(vd345,vd348),X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_33,plain,
    less(vplus(vd345,vd348),vplus(vd345,vd347)),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_34,negated_conjecture,
    vplus(vd347,vd344) = vplus(vd345,vd348),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).

cnf(c_0_35,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_34]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : NUM841+1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.13/0.36  % Computer : n012.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit   : 2400
% 0.13/0.36  % WCLimit    : 300
% 0.13/0.36  % DateTime   : Mon Oct  2 14:51:50 EDT 2023
% 0.13/0.36  % CPUTime    : 
% 0.21/0.48  Running first-order model finding
% 0.21/0.48  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.ISf4K5i08z/E---3.1_11802.p
% 0.21/0.51  # Version: 3.1pre001
% 0.21/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51  # Starting sh5l with 300s (1) cores
% 0.21/0.51  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11883 completed with status 0
% 0.21/0.51  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51  # No SInE strategy applied
% 0.21/0.51  # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.21/0.51  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.21/0.51  # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.21/0.51  # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 11891 completed with status 0
% 0.21/0.51  # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.21/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51  # No SInE strategy applied
% 0.21/0.51  # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.21/0.51  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.21/0.51  # Preprocessing time       : 0.002 s
% 0.21/0.51  
% 0.21/0.51  # Proof found!
% 0.21/0.51  # SZS status Theorem
% 0.21/0.51  # SZS output start CNFRefutation
% See solution above
% 0.21/0.51  # Parsed axioms                        : 45
% 0.21/0.51  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.51  # Initial clauses                      : 53
% 0.21/0.51  # Removed in clause preprocessing      : 2
% 0.21/0.51  # Initial clauses in saturation        : 51
% 0.21/0.51  # Processed clauses                    : 118
% 0.21/0.51  # ...of these trivial                  : 6
% 0.21/0.51  # ...subsumed                          : 28
% 0.21/0.51  # ...remaining for further processing  : 84
% 0.21/0.51  # Other redundant clauses eliminated   : 39
% 0.21/0.51  # Clauses deleted for lack of memory   : 0
% 0.21/0.51  # Backward-subsumed                    : 4
% 0.21/0.51  # Backward-rewritten                   : 12
% 0.21/0.51  # Generated clauses                    : 450
% 0.21/0.51  # ...of the previous two non-redundant : 349
% 0.21/0.51  # ...aggressively subsumed             : 0
% 0.21/0.51  # Contextual simplify-reflections      : 0
% 0.21/0.51  # Paramodulations                      : 399
% 0.21/0.51  # Factorizations                       : 2
% 0.21/0.51  # NegExts                              : 0
% 0.21/0.51  # Equation resolutions                 : 49
% 0.21/0.51  # Total rewrite steps                  : 46
% 0.21/0.51  # Propositional unsat checks           : 0
% 0.21/0.51  #    Propositional check models        : 0
% 0.21/0.51  #    Propositional check unsatisfiable : 0
% 0.21/0.51  #    Propositional clauses             : 0
% 0.21/0.51  #    Propositional clauses after purity: 0
% 0.21/0.51  #    Propositional unsat core size     : 0
% 0.21/0.51  #    Propositional preprocessing time  : 0.000
% 0.21/0.51  #    Propositional encoding time       : 0.000
% 0.21/0.51  #    Propositional solver time         : 0.000
% 0.21/0.51  #    Success case prop preproc time    : 0.000
% 0.21/0.51  #    Success case prop encoding time   : 0.000
% 0.21/0.51  #    Success case prop solver time     : 0.000
% 0.21/0.51  # Current number of processed clauses  : 62
% 0.21/0.51  #    Positive orientable unit clauses  : 14
% 0.21/0.51  #    Positive unorientable unit clauses: 1
% 0.21/0.51  #    Negative unit clauses             : 9
% 0.21/0.51  #    Non-unit-clauses                  : 38
% 0.21/0.51  # Current number of unprocessed clauses: 242
% 0.21/0.51  # ...number of literals in the above   : 610
% 0.21/0.51  # Current number of archived formulas  : 0
% 0.21/0.51  # Current number of archived clauses   : 17
% 0.21/0.51  # Clause-clause subsumption calls (NU) : 111
% 0.21/0.51  # Rec. Clause-clause subsumption calls : 109
% 0.21/0.51  # Non-unit clause-clause subsumptions  : 12
% 0.21/0.51  # Unit Clause-clause subsumption calls : 94
% 0.21/0.51  # Rewrite failures with RHS unbound    : 0
% 0.21/0.51  # BW rewrite match attempts            : 52
% 0.21/0.51  # BW rewrite match successes           : 27
% 0.21/0.51  # Condensation attempts                : 0
% 0.21/0.51  # Condensation successes               : 0
% 0.21/0.51  # Termbank termtop insertions          : 4617
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.014 s
% 0.21/0.51  # System time              : 0.002 s
% 0.21/0.51  # Total time               : 0.016 s
% 0.21/0.51  # Maximum resident set size: 1916 pages
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.059 s
% 0.21/0.51  # System time              : 0.012 s
% 0.21/0.51  # Total time               : 0.072 s
% 0.21/0.51  # Maximum resident set size: 1752 pages
% 0.21/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------