TSTP Solution File: NUM475+2 by ET---2.0

View Problem - Process Solution

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

% Computer : n008.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:32:50 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   26 (  15 unt;   0 def)
%            Number of atoms       :   60 (  26 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   56 (  22   ~;  19   |;  12   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mAddCanc,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => ( ( sdtpldt0(X1,X2) = sdtpldt0(X1,X3)
          | sdtpldt0(X2,X1) = sdtpldt0(X3,X1) )
       => X2 = X3 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddCanc) ).

fof(m__,conjecture,
    xn = sdtasdt0(xl,xr),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(m__1379,hypothesis,
    ( aNaturalNumber0(xq)
    & sdtpldt0(xm,xn) = sdtasdt0(xl,xq)
    & xq = sdtsldt0(sdtpldt0(xm,xn),xl) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1379) ).

fof(m__1324,hypothesis,
    ( aNaturalNumber0(xl)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1324) ).

fof(m__1459,hypothesis,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1459) ).

fof(m__1360,hypothesis,
    ( aNaturalNumber0(xp)
    & xm = sdtasdt0(xl,xp)
    & xp = sdtsldt0(xm,xl) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1360) ).

fof(mSortsB_02,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB_02) ).

fof(m__1422,hypothesis,
    ( aNaturalNumber0(xr)
    & sdtpldt0(xp,xr) = xq
    & xr = sdtmndt0(xq,xp) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1422) ).

fof(c_0_8,plain,
    ! [X4,X5,X6] :
      ( ( sdtpldt0(X4,X5) != sdtpldt0(X4,X6)
        | X5 = X6
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) )
      & ( sdtpldt0(X5,X4) != sdtpldt0(X6,X4)
        | X5 = X6
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddCanc])])]) ).

fof(c_0_9,negated_conjecture,
    xn != sdtasdt0(xl,xr),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_10,plain,
    ( X2 = X1
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | sdtpldt0(X3,X2) != sdtpldt0(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,hypothesis,
    sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
    inference(split_conjunct,[status(thm)],[m__1379]) ).

cnf(c_0_12,hypothesis,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[m__1324]) ).

cnf(c_0_13,hypothesis,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[m__1324]) ).

cnf(c_0_14,hypothesis,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
    inference(split_conjunct,[status(thm)],[m__1459]) ).

cnf(c_0_15,hypothesis,
    xm = sdtasdt0(xl,xp),
    inference(split_conjunct,[status(thm)],[m__1360]) ).

fof(c_0_16,negated_conjecture,
    xn != sdtasdt0(xl,xr),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

cnf(c_0_17,hypothesis,
    ( X1 = xn
    | sdtpldt0(xm,X1) != sdtasdt0(xl,xq)
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).

cnf(c_0_18,hypothesis,
    sdtpldt0(xm,sdtasdt0(xl,xr)) = sdtasdt0(xl,xq),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_11]) ).

cnf(c_0_19,negated_conjecture,
    xn != sdtasdt0(xl,xr),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_20,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | aNaturalNumber0(sdtasdt0(X3,X4)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).

cnf(c_0_21,hypothesis,
    ~ aNaturalNumber0(sdtasdt0(xl,xr)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_22,plain,
    ( aNaturalNumber0(sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_23,hypothesis,
    aNaturalNumber0(xr),
    inference(split_conjunct,[status(thm)],[m__1422]) ).

cnf(c_0_24,hypothesis,
    aNaturalNumber0(xl),
    inference(split_conjunct,[status(thm)],[m__1324]) ).

cnf(c_0_25,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM475+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.14/0.34  % Computer : n008.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jul  7 07:16:08 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.24/1.42  # Preprocessing time       : 0.018 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 26
% 0.24/1.42  # Proof object clause steps            : 14
% 0.24/1.42  # Proof object formula steps           : 12
% 0.24/1.42  # Proof object conjectures             : 4
% 0.24/1.42  # Proof object clause conjectures      : 1
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 10
% 0.24/1.42  # Proof object initial formulas used   : 8
% 0.24/1.42  # Proof object generating inferences   : 3
% 0.24/1.42  # Proof object simplifying inferences  : 10
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 42
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 0
% 0.24/1.42  # Initial clauses                      : 81
% 0.24/1.42  # Removed in clause preprocessing      : 3
% 0.24/1.42  # Initial clauses in saturation        : 78
% 0.24/1.42  # Processed clauses                    : 321
% 0.24/1.42  # ...of these trivial                  : 13
% 0.24/1.42  # ...subsumed                          : 117
% 0.24/1.42  # ...remaining for further processing  : 191
% 0.24/1.42  # Other redundant clauses eliminated   : 14
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 7
% 0.24/1.42  # Backward-rewritten                   : 15
% 0.24/1.42  # Generated clauses                    : 1183
% 0.24/1.42  # ...of the previous two non-trivial   : 1085
% 0.24/1.42  # Contextual simplify-reflections      : 38
% 0.24/1.42  # Paramodulations                      : 1152
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 31
% 0.24/1.42  # Current number of processed clauses  : 168
% 0.24/1.42  #    Positive orientable unit clauses  : 27
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 5
% 0.24/1.42  #    Non-unit-clauses                  : 136
% 0.24/1.42  # Current number of unprocessed clauses: 728
% 0.24/1.42  # ...number of literals in the above   : 3401
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 22
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 6304
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 2841
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 156
% 0.24/1.42  # Unit Clause-clause subsumption calls : 110
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 3
% 0.24/1.42  # BW rewrite match successes           : 3
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 19707
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.041 s
% 0.24/1.42  # System time              : 0.004 s
% 0.24/1.42  # Total time               : 0.045 s
% 0.24/1.42  # Maximum resident set size: 3808 pages
% 0.24/23.41  eprover: CPU time limit exceeded, terminating
% 0.24/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
%------------------------------------------------------------------------------