TSTP Solution File: NUM849+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM849+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% 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 : 300s
% WCLimit  : 600s
% DateTime : Mon Jul 18 09:37:08 EDT 2022

% Result   : Theorem 0.22s 1.40s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   37 (  30 unt;   0 def)
%            Number of atoms       :   44 (  43 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   12 (   5   ~;   0   |;   5   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   56 (   2 sgn  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('ass(cond(261, 0), 0)',axiom,
    ! [X8,X9] : vmul(vsucc(X8),X9) = vplus(vmul(X8,X9),X9),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(261, 0), 0)') ).

fof('qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))',axiom,
    ! [X84,X85] :
      ( vplus(X84,vsucc(X85)) = vsucc(vplus(X84,X85))
      & vplus(X84,v1) = vsucc(X84) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).

fof('qu(ind(296), imp(296))',conjecture,
    ! [X1] :
      ( vmul(vmul(vd448,vd449),X1) = vmul(vd448,vmul(vd449,X1))
     => vmul(vmul(vd448,vd449),vsucc(X1)) = vmul(vd448,vmul(vd449,vsucc(X1))) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(ind(296), imp(296))') ).

fof('qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))',axiom,
    ! [X11,X12] :
      ( vmul(X11,vsucc(X12)) = vplus(vmul(X11,X12),X11)
      & vmul(X11,v1) = X11 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))') ).

fof('ass(cond(61, 0), 0)',axiom,
    ! [X76,X77] : vplus(X77,X76) = vplus(X76,X77),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(61, 0), 0)') ).

fof('ass(cond(270, 0), 0)',axiom,
    ! [X6,X7] : vmul(X6,X7) = vmul(X7,X6),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(270, 0), 0)') ).

fof('ass(cond(43, 0), 0)',axiom,
    ! [X80] : vplus(v1,X80) = vsucc(X80),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(43, 0), 0)') ).

fof('ass(cond(281, 0), 0)',axiom,
    ! [X3,X4,X5] : vmul(X3,vplus(X4,X5)) = vplus(vmul(X3,X4),vmul(X3,X5)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(281, 0), 0)') ).

fof(c_0_8,plain,
    ! [X10,X11] : vmul(vsucc(X10),X11) = vplus(vmul(X10,X11),X11),
    inference(variable_rename,[status(thm)],['ass(cond(261, 0), 0)']) ).

fof(c_0_9,plain,
    ! [X86,X87,X86] :
      ( vplus(X86,vsucc(X87)) = vsucc(vplus(X86,X87))
      & vplus(X86,v1) = vsucc(X86) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[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,negated_conjecture,
    ~ ! [X1] :
        ( vmul(vmul(vd448,vd449),X1) = vmul(vd448,vmul(vd449,X1))
       => vmul(vmul(vd448,vd449),vsucc(X1)) = vmul(vd448,vmul(vd449,vsucc(X1))) ),
    inference(assume_negation,[status(cth)],['qu(ind(296), imp(296))']) ).

fof(c_0_11,plain,
    ! [X13,X14,X13] :
      ( vmul(X13,vsucc(X14)) = vplus(vmul(X13,X14),X13)
      & vmul(X13,v1) = X13 ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[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,plain,
    vmul(vsucc(X1),X2) = vplus(vmul(X1,X2),X2),
    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]) ).

fof(c_0_14,plain,
    ! [X78,X79] : vplus(X79,X78) = vplus(X78,X79),
    inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).

fof(c_0_15,negated_conjecture,
    ( vmul(vmul(vd448,vd449),esk1_0) = vmul(vd448,vmul(vd449,esk1_0))
    & vmul(vmul(vd448,vd449),vsucc(esk1_0)) != vmul(vd448,vmul(vd449,vsucc(esk1_0))) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).

fof(c_0_16,plain,
    ! [X8,X9] : vmul(X8,X9) = vmul(X9,X8),
    inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).

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

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

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

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

cnf(c_0_21,negated_conjecture,
    vmul(vmul(vd448,vd449),esk1_0) = vmul(vd448,vmul(vd449,esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

fof(c_0_23,plain,
    ! [X6,X7,X8] : vmul(X6,vplus(X7,X8)) = vplus(vmul(X6,X7),vmul(X6,X8)),
    inference(variable_rename,[status(thm)],['ass(cond(281, 0), 0)']) ).

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

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

cnf(c_0_26,negated_conjecture,
    vmul(vmul(vd448,vd449),vsucc(esk1_0)) != vmul(vd448,vmul(vd449,vsucc(esk1_0))),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

cnf(c_0_28,negated_conjecture,
    vmul(esk1_0,vmul(vd448,vd449)) = vmul(vd448,vmul(vd449,esk1_0)),
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_29,plain,
    vmul(X1,vplus(X2,X3)) = vplus(vmul(X1,X2),vmul(X1,X3)),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

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

cnf(c_0_31,plain,
    vplus(X1,vmul(X1,X2)) = vmul(X1,vplus(X2,v1)),
    inference(rw,[status(thm)],[c_0_25,c_0_20]) ).

cnf(c_0_32,negated_conjecture,
    vmul(vmul(vd448,vd449),vplus(esk1_0,v1)) != vmul(vd448,vmul(vd449,vplus(esk1_0,v1))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_13]),c_0_13]) ).

cnf(c_0_33,negated_conjecture,
    vmul(vd448,vplus(vd449,vmul(vd449,esk1_0))) = vmul(vmul(vd448,vd449),vplus(v1,esk1_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),c_0_22]) ).

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

cnf(c_0_35,negated_conjecture,
    vmul(vmul(vd448,vd449),vplus(v1,esk1_0)) != vmul(vd448,vmul(vd449,vplus(v1,esk1_0))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_30]),c_0_30]) ).

cnf(c_0_36,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : NUM849+1 : TPTP v8.1.0. Released v4.1.0.
% 0.12/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n012.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jul  6 23:41:30 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.22/1.40  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.22/1.40  # Preprocessing time       : 0.017 s
% 0.22/1.40  
% 0.22/1.40  # Proof found!
% 0.22/1.40  # SZS status Theorem
% 0.22/1.40  # SZS output start CNFRefutation
% See solution above
% 0.22/1.41  # Proof object total steps             : 37
% 0.22/1.41  # Proof object clause steps            : 20
% 0.22/1.41  # Proof object formula steps           : 17
% 0.22/1.41  # Proof object conjectures             : 10
% 0.22/1.41  # Proof object clause conjectures      : 7
% 0.22/1.41  # Proof object formula conjectures     : 3
% 0.22/1.41  # Proof object initial clauses used    : 9
% 0.22/1.41  # Proof object initial formulas used   : 8
% 0.22/1.41  # Proof object generating inferences   : 2
% 0.22/1.41  # Proof object simplifying inferences  : 15
% 0.22/1.41  # Training examples: 0 positive, 0 negative
% 0.22/1.41  # Parsed axioms                        : 56
% 0.22/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.22/1.41  # Initial clauses                      : 67
% 0.22/1.41  # Removed in clause preprocessing      : 3
% 0.22/1.41  # Initial clauses in saturation        : 64
% 0.22/1.41  # Processed clauses                    : 150
% 0.22/1.41  # ...of these trivial                  : 5
% 0.22/1.41  # ...subsumed                          : 41
% 0.22/1.41  # ...remaining for further processing  : 104
% 0.22/1.41  # Other redundant clauses eliminated   : 24
% 0.22/1.41  # Clauses deleted for lack of memory   : 0
% 0.22/1.41  # Backward-subsumed                    : 4
% 0.22/1.41  # Backward-rewritten                   : 21
% 0.22/1.41  # Generated clauses                    : 989
% 0.22/1.41  # ...of the previous two non-trivial   : 872
% 0.22/1.41  # Contextual simplify-reflections      : 0
% 0.22/1.41  # Paramodulations                      : 956
% 0.22/1.41  # Factorizations                       : 0
% 0.22/1.41  # Equation resolutions                 : 33
% 0.22/1.41  # Current number of processed clauses  : 73
% 0.22/1.41  #    Positive orientable unit clauses  : 13
% 0.22/1.41  #    Positive unorientable unit clauses: 7
% 0.22/1.41  #    Negative unit clauses             : 13
% 0.22/1.41  #    Non-unit-clauses                  : 40
% 0.22/1.41  # Current number of unprocessed clauses: 624
% 0.22/1.41  # ...number of literals in the above   : 1348
% 0.22/1.41  # Current number of archived formulas  : 0
% 0.22/1.41  # Current number of archived clauses   : 26
% 0.22/1.41  # Clause-clause subsumption calls (NU) : 190
% 0.22/1.41  # Rec. Clause-clause subsumption calls : 179
% 0.22/1.41  # Non-unit clause-clause subsumptions  : 13
% 0.22/1.41  # Unit Clause-clause subsumption calls : 103
% 0.22/1.41  # Rewrite failures with RHS unbound    : 0
% 0.22/1.41  # BW rewrite match attempts            : 76
% 0.22/1.41  # BW rewrite match successes           : 54
% 0.22/1.41  # Condensation attempts                : 0
% 0.22/1.41  # Condensation successes               : 0
% 0.22/1.41  # Termbank termtop insertions          : 14345
% 0.22/1.41  
% 0.22/1.41  # -------------------------------------------------
% 0.22/1.41  # User time                : 0.032 s
% 0.22/1.41  # System time              : 0.001 s
% 0.22/1.41  # Total time               : 0.033 s
% 0.22/1.41  # Maximum resident set size: 3668 pages
% 0.22/23.42  eprover: CPU time limit exceeded, terminating
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
%------------------------------------------------------------------------------