TSTP Solution File: NUM845+2 by E---3.1

View Problem - Process Solution

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

% Computer : n015.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:57:45 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof('qu(ind(267), imp(267))',conjecture,
    ! [X1] :
      ( vmul(vsucc(vd411),X1) = vplus(vmul(vd411,X1),X1)
     => vmul(vsucc(vd411),vsucc(X1)) = vplus(vmul(vd411,vsucc(X1)),vsucc(X1)) ),
    file('/export/starexec/sandbox/tmp/tmp.QpocIFs4Dl/E---3.1_29555.p','qu(ind(267), imp(267))') ).

fof('qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))',axiom,
    ! [X11,X12] :
      ( vplus(X11,vsucc(X12)) = vsucc(vplus(X11,X12))
      & vplus(X11,v1) = vsucc(X11) ),
    file('/export/starexec/sandbox/tmp/tmp.QpocIFs4Dl/E---3.1_29555.p','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).

fof('ass(cond(43, 0), 0)',axiom,
    ! [X7] : vplus(v1,X7) = vsucc(X7),
    file('/export/starexec/sandbox/tmp/tmp.QpocIFs4Dl/E---3.1_29555.p','ass(cond(43, 0), 0)') ).

fof('qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))',axiom,
    ! [X3,X4] :
      ( vmul(X3,vsucc(X4)) = vplus(vmul(X3,X4),X3)
      & vmul(X3,v1) = X3 ),
    file('/export/starexec/sandbox/tmp/tmp.QpocIFs4Dl/E---3.1_29555.p','qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))') ).

fof('ass(cond(61, 0), 0)',axiom,
    ! [X5,X6] : vplus(X6,X5) = vplus(X5,X6),
    file('/export/starexec/sandbox/tmp/tmp.QpocIFs4Dl/E---3.1_29555.p','ass(cond(61, 0), 0)') ).

fof('ass(cond(conseq(263), 1), 7)',axiom,
    ! [X2] :
      ( vmul(vsucc(vd411),X2) = vplus(vmul(vd411,X2),X2)
     => vmul(vsucc(vd411),vsucc(X2)) = vplus(vmul(vsucc(vd411),X2),vsucc(vd411)) ),
    file('/export/starexec/sandbox/tmp/tmp.QpocIFs4Dl/E---3.1_29555.p','ass(cond(conseq(263), 1), 7)') ).

fof('ass(cond(33, 0), 0)',axiom,
    ! [X8,X9,X10] : vplus(vplus(X8,X9),X10) = vplus(X8,vplus(X9,X10)),
    file('/export/starexec/sandbox/tmp/tmp.QpocIFs4Dl/E---3.1_29555.p','ass(cond(33, 0), 0)') ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1] :
        ( vmul(vsucc(vd411),X1) = vplus(vmul(vd411,X1),X1)
       => vmul(vsucc(vd411),vsucc(X1)) = vplus(vmul(vd411,vsucc(X1)),vsucc(X1)) ),
    inference(assume_negation,[status(cth)],['qu(ind(267), imp(267))']) ).

fof(c_0_8,negated_conjecture,
    ( vmul(vsucc(vd411),esk1_0) = vplus(vmul(vd411,esk1_0),esk1_0)
    & vmul(vsucc(vd411),vsucc(esk1_0)) != vplus(vmul(vd411,vsucc(esk1_0)),vsucc(esk1_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

fof(c_0_9,plain,
    ! [X30,X31] :
      ( vplus(X30,vsucc(X31)) = vsucc(vplus(X30,X31))
      & vplus(X30,v1) = vsucc(X30) ),
    inference(variable_rename,[status(thm)],['qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))']) ).

fof(c_0_10,plain,
    ! [X26] : vplus(v1,X26) = vsucc(X26),
    inference(variable_rename,[status(thm)],['ass(cond(43, 0), 0)']) ).

fof(c_0_11,plain,
    ! [X22,X23] :
      ( vmul(X22,vsucc(X23)) = vplus(vmul(X22,X23),X22)
      & vmul(X22,v1) = X22 ),
    inference(variable_rename,[status(thm)],['qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))']) ).

cnf(c_0_12,negated_conjecture,
    vmul(vsucc(vd411),vsucc(esk1_0)) != vplus(vmul(vd411,vsucc(esk1_0)),vsucc(esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    vplus(X1,v1) = vsucc(X1),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    vplus(v1,X1) = vsucc(X1),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

fof(c_0_16,plain,
    ! [X24,X25] : vplus(X25,X24) = vplus(X24,X25),
    inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).

fof(c_0_17,plain,
    ! [X21] :
      ( vmul(vsucc(vd411),X21) != vplus(vmul(vd411,X21),X21)
      | vmul(vsucc(vd411),vsucc(X21)) = vplus(vmul(vsucc(vd411),X21),vsucc(vd411)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(conseq(263), 1), 7)'])]) ).

cnf(c_0_18,negated_conjecture,
    vmul(vplus(vd411,v1),vplus(esk1_0,v1)) != vplus(vmul(vd411,vplus(esk1_0,v1)),vplus(esk1_0,v1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_13]),c_0_13]) ).

cnf(c_0_19,plain,
    vplus(v1,X1) = vplus(X1,v1),
    inference(rw,[status(thm)],[c_0_14,c_0_13]) ).

fof(c_0_20,plain,
    ! [X27,X28,X29] : vplus(vplus(X27,X28),X29) = vplus(X27,vplus(X28,X29)),
    inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).

cnf(c_0_21,plain,
    vmul(X1,vplus(X2,v1)) = vplus(vmul(X1,X2),X1),
    inference(rw,[status(thm)],[c_0_15,c_0_13]) ).

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

cnf(c_0_23,plain,
    ( vmul(vsucc(vd411),vsucc(X1)) = vplus(vmul(vsucc(vd411),X1),vsucc(vd411))
    | vmul(vsucc(vd411),X1) != vplus(vmul(vd411,X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_24,negated_conjecture,
    vmul(vsucc(vd411),esk1_0) = vplus(vmul(vd411,esk1_0),esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_25,negated_conjecture,
    vplus(vmul(vd411,vplus(v1,esk1_0)),vplus(v1,esk1_0)) != vmul(vplus(vd411,v1),vplus(v1,esk1_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_19]) ).

cnf(c_0_26,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_27,plain,
    vmul(X1,vplus(X2,v1)) = vplus(X1,vmul(X1,X2)),
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_28,plain,
    ( vmul(vplus(vd411,v1),vplus(X1,v1)) = vplus(vmul(vplus(vd411,v1),X1),vplus(vd411,v1))
    | vmul(vplus(vd411,v1),X1) != vplus(vmul(vd411,X1),X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_13]),c_0_13]),c_0_13]),c_0_13]),c_0_13]) ).

cnf(c_0_29,negated_conjecture,
    vplus(vmul(vd411,esk1_0),esk1_0) = vmul(vplus(vd411,v1),esk1_0),
    inference(rw,[status(thm)],[c_0_24,c_0_13]) ).

cnf(c_0_30,negated_conjecture,
    vplus(v1,vplus(esk1_0,vmul(vd411,vplus(v1,esk1_0)))) != vmul(vplus(vd411,v1),vplus(v1,esk1_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_22]),c_0_26]) ).

cnf(c_0_31,plain,
    vmul(X1,vplus(v1,X2)) = vplus(X1,vmul(X1,X2)),
    inference(spm,[status(thm)],[c_0_27,c_0_22]) ).

cnf(c_0_32,plain,
    ( vplus(vd411,vplus(v1,vmul(vplus(vd411,v1),X1))) = vmul(vplus(vd411,v1),vplus(X1,v1))
    | vmul(vplus(vd411,v1),X1) != vplus(X1,vmul(vd411,X1)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_22]),c_0_26]),c_0_22]) ).

cnf(c_0_33,negated_conjecture,
    vmul(vplus(vd411,v1),esk1_0) = vplus(esk1_0,vmul(vd411,esk1_0)),
    inference(rw,[status(thm)],[c_0_29,c_0_22]) ).

cnf(c_0_34,negated_conjecture,
    vplus(v1,vplus(esk1_0,vplus(vd411,vmul(vd411,esk1_0)))) != vmul(vplus(vd411,v1),vplus(v1,esk1_0)),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,plain,
    vplus(X1,vplus(X2,X3)) = vplus(X3,vplus(X1,X2)),
    inference(spm,[status(thm)],[c_0_22,c_0_26]) ).

cnf(c_0_36,negated_conjecture,
    vplus(vd411,vplus(v1,vplus(esk1_0,vmul(vd411,esk1_0)))) = vmul(vplus(vd411,v1),vplus(v1,esk1_0)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_19]) ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_22]),c_0_35]),c_0_26]),c_0_22]),c_0_35]),c_0_22]),c_0_36])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem    : NUM845+2 : TPTP v8.1.2. Released v4.1.0.
% 0.05/0.12  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n015.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   : 2400
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Mon Oct  2 14:44:16 EDT 2023
% 0.11/0.33  % CPUTime    : 
% 0.17/0.44  Running first-order theorem proving
% 0.17/0.44  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.QpocIFs4Dl/E---3.1_29555.p
% 0.17/0.46  # Version: 3.1pre001
% 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  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29677 completed with status 0
% 0.17/0.46  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 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  # No SInE strategy applied
% 0.17/0.46  # Search class: FHUPM-FFMF22-MFFFFFNN
% 0.17/0.46  # partial match(1): FHUPM-FFSF22-MFFFFFNN
% 0.17/0.46  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46  # Starting U----_210g_05_C07_19_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.46  # Starting U----_210g_05_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.46  # Starting new_bool_3 with 136s (1) cores
% 0.17/0.46  # Starting new_bool_1 with 136s (1) cores
% 0.17/0.46  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29682 completed with status 0
% 0.17/0.46  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 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  # No SInE strategy applied
% 0.17/0.46  # Search class: FHUPM-FFMF22-MFFFFFNN
% 0.17/0.46  # partial match(1): FHUPM-FFSF22-MFFFFFNN
% 0.17/0.46  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46  # Starting U----_210g_05_C07_19_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (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                        : 15
% 0.17/0.46  # Removed by relevancy pruning/SinE    : 0
% 0.17/0.46  # Initial clauses                      : 18
% 0.17/0.46  # Removed in clause preprocessing      : 3
% 0.17/0.46  # Initial clauses in saturation        : 15
% 0.17/0.46  # Processed clauses                    : 39
% 0.17/0.46  # ...of these trivial                  : 8
% 0.17/0.46  # ...subsumed                          : 4
% 0.17/0.46  # ...remaining for further processing  : 27
% 0.17/0.46  # Other redundant clauses eliminated   : 0
% 0.17/0.46  # Clauses deleted for lack of memory   : 0
% 0.17/0.46  # Backward-subsumed                    : 1
% 0.17/0.46  # Backward-rewritten                   : 7
% 0.17/0.46  # Generated clauses                    : 91
% 0.17/0.46  # ...of the previous two non-redundant : 49
% 0.17/0.46  # ...aggressively subsumed             : 0
% 0.17/0.46  # Contextual simplify-reflections      : 0
% 0.17/0.46  # Paramodulations                      : 91
% 0.17/0.46  # Factorizations                       : 0
% 0.17/0.46  # NegExts                              : 0
% 0.17/0.46  # Equation resolutions                 : 0
% 0.17/0.46  # Total rewrite steps                  : 136
% 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  : 12
% 0.17/0.46  #    Positive orientable unit clauses  : 5
% 0.17/0.46  #    Positive unorientable unit clauses: 5
% 0.17/0.46  #    Negative unit clauses             : 1
% 0.17/0.46  #    Non-unit-clauses                  : 1
% 0.17/0.46  # Current number of unprocessed clauses: 29
% 0.17/0.46  # ...number of literals in the above   : 32
% 0.17/0.46  # Current number of archived formulas  : 0
% 0.17/0.46  # Current number of archived clauses   : 16
% 0.17/0.46  # Clause-clause subsumption calls (NU) : 0
% 0.17/0.46  # Rec. Clause-clause subsumption calls : 0
% 0.17/0.46  # Non-unit clause-clause subsumptions  : 0
% 0.17/0.46  # Unit Clause-clause subsumption calls : 18
% 0.17/0.46  # Rewrite failures with RHS unbound    : 0
% 0.17/0.46  # BW rewrite match attempts            : 89
% 0.17/0.46  # BW rewrite match successes           : 51
% 0.17/0.46  # Condensation attempts                : 0
% 0.17/0.46  # Condensation successes               : 0
% 0.17/0.46  # Termbank termtop insertions          : 2775
% 0.17/0.46  
% 0.17/0.46  # -------------------------------------------------
% 0.17/0.46  # User time                : 0.004 s
% 0.17/0.46  # System time              : 0.002 s
% 0.17/0.46  # Total time               : 0.007 s
% 0.17/0.46  # Maximum resident set size: 1796 pages
% 0.17/0.46  
% 0.17/0.46  # -------------------------------------------------
% 0.17/0.46  # User time                : 0.020 s
% 0.17/0.46  # System time              : 0.009 s
% 0.17/0.46  # Total time               : 0.028 s
% 0.17/0.46  # Maximum resident set size: 1684 pages
% 0.17/0.46  % E---3.1 exiting
% 0.17/0.46  % E---3.1 exiting
%------------------------------------------------------------------------------