TSTP Solution File: NUM478+2 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : NUM478+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n005.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 : Fri May  3 02:49:29 EDT 2024

% Result   : Theorem 4.36s 1.25s
% Output   : CNFRefutation 4.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   41 (  20 unt;   0 def)
%            Number of atoms       :   87 (  38 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   82 (  36   ~;  30   |;  12   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   33 (   0 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f9,axiom,
    ! [X0,X1] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).

fof(f10,axiom,
    ! [X0,X1,X2] :
      ( ( aNaturalNumber0(X2)
        & aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulAsso) ).

fof(f36,axiom,
    ( aNaturalNumber0(xm)
    & aNaturalNumber0(xl) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1524) ).

fof(f38,axiom,
    aNaturalNumber0(xn),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1553) ).

fof(f39,conjecture,
    ( ( xm = sdtasdt0(xl,sdtsldt0(xm,xl))
      & aNaturalNumber0(sdtsldt0(xm,xl)) )
   => ( sdtasdt0(xn,sdtsldt0(xm,xl)) = sdtsldt0(sdtasdt0(xn,xm),xl)
      | sdtasdt0(xn,xm) = sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f40,negated_conjecture,
    ~ ( ( xm = sdtasdt0(xl,sdtsldt0(xm,xl))
        & aNaturalNumber0(sdtsldt0(xm,xl)) )
     => ( sdtasdt0(xn,sdtsldt0(xm,xl)) = sdtsldt0(sdtasdt0(xn,xm),xl)
        | sdtasdt0(xn,xm) = sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))) ) ),
    inference(negated_conjecture,[],[f39]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f54,plain,
    ! [X0,X1] :
      ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(flattening,[],[f53]) ).

fof(f55,plain,
    ! [X0,X1,X2] :
      ( sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2))
      | ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f56,plain,
    ! [X0,X1,X2] :
      ( sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2))
      | ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(flattening,[],[f55]) ).

fof(f100,plain,
    ( sdtasdt0(xn,sdtsldt0(xm,xl)) != sdtsldt0(sdtasdt0(xn,xm),xl)
    & sdtasdt0(xn,xm) != sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))
    & xm = sdtasdt0(xl,sdtsldt0(xm,xl))
    & aNaturalNumber0(sdtsldt0(xm,xl)) ),
    inference(ennf_transformation,[],[f40]) ).

fof(f101,plain,
    ( sdtasdt0(xn,sdtsldt0(xm,xl)) != sdtsldt0(sdtasdt0(xn,xm),xl)
    & sdtasdt0(xn,xm) != sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))
    & xm = sdtasdt0(xl,sdtsldt0(xm,xl))
    & aNaturalNumber0(sdtsldt0(xm,xl)) ),
    inference(flattening,[],[f100]) ).

fof(f125,plain,
    ! [X0,X1] :
      ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f54]) ).

fof(f126,plain,
    ! [X2,X0,X1] :
      ( sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2))
      | ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f56]) ).

fof(f172,plain,
    aNaturalNumber0(xl),
    inference(cnf_transformation,[],[f36]) ).

fof(f173,plain,
    aNaturalNumber0(xm),
    inference(cnf_transformation,[],[f36]) ).

fof(f178,plain,
    aNaturalNumber0(xn),
    inference(cnf_transformation,[],[f38]) ).

fof(f179,plain,
    aNaturalNumber0(sdtsldt0(xm,xl)),
    inference(cnf_transformation,[],[f101]) ).

fof(f180,plain,
    xm = sdtasdt0(xl,sdtsldt0(xm,xl)),
    inference(cnf_transformation,[],[f101]) ).

fof(f181,plain,
    sdtasdt0(xn,xm) != sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))),
    inference(cnf_transformation,[],[f101]) ).

cnf(c_58,plain,
    ( ~ aNaturalNumber0(X0)
    | ~ aNaturalNumber0(X1)
    | sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
    inference(cnf_transformation,[],[f125]) ).

cnf(c_59,plain,
    ( ~ aNaturalNumber0(X0)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ),
    inference(cnf_transformation,[],[f126]) ).

cnf(c_104,plain,
    aNaturalNumber0(xm),
    inference(cnf_transformation,[],[f173]) ).

cnf(c_105,plain,
    aNaturalNumber0(xl),
    inference(cnf_transformation,[],[f172]) ).

cnf(c_110,plain,
    aNaturalNumber0(xn),
    inference(cnf_transformation,[],[f178]) ).

cnf(c_112,negated_conjecture,
    sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))) != sdtasdt0(xn,xm),
    inference(cnf_transformation,[],[f181]) ).

cnf(c_113,negated_conjecture,
    sdtasdt0(xl,sdtsldt0(xm,xl)) = xm,
    inference(cnf_transformation,[],[f180]) ).

cnf(c_114,negated_conjecture,
    aNaturalNumber0(sdtsldt0(xm,xl)),
    inference(cnf_transformation,[],[f179]) ).

cnf(c_2791,plain,
    ( ~ aNaturalNumber0(X0)
    | sdtasdt0(X0,xn) = sdtasdt0(xn,X0) ),
    inference(superposition,[status(thm)],[c_110,c_58]) ).

cnf(c_2833,plain,
    ( ~ aNaturalNumber0(X0)
    | ~ aNaturalNumber0(X1)
    | sdtasdt0(sdtasdt0(X0,xl),X1) = sdtasdt0(X0,sdtasdt0(xl,X1)) ),
    inference(superposition,[status(thm)],[c_105,c_59]) ).

cnf(c_2834,plain,
    ( ~ aNaturalNumber0(X0)
    | ~ aNaturalNumber0(X1)
    | sdtasdt0(sdtasdt0(X0,xn),X1) = sdtasdt0(X0,sdtasdt0(xn,X1)) ),
    inference(superposition,[status(thm)],[c_110,c_59]) ).

cnf(c_2873,plain,
    sdtasdt0(xm,xn) = sdtasdt0(xn,xm),
    inference(superposition,[status(thm)],[c_104,c_2791]) ).

cnf(c_2874,plain,
    sdtasdt0(xl,xn) = sdtasdt0(xn,xl),
    inference(superposition,[status(thm)],[c_105,c_2791]) ).

cnf(c_2878,plain,
    sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))) != sdtasdt0(xm,xn),
    inference(demodulation,[status(thm)],[c_112,c_2873]) ).

cnf(c_3118,plain,
    ( ~ aNaturalNumber0(X0)
    | sdtasdt0(sdtasdt0(X0,xn),sdtsldt0(xm,xl)) = sdtasdt0(X0,sdtasdt0(xn,sdtsldt0(xm,xl))) ),
    inference(superposition,[status(thm)],[c_114,c_2834]) ).

cnf(c_3145,plain,
    ( ~ aNaturalNumber0(X0)
    | sdtasdt0(sdtasdt0(X0,xl),sdtsldt0(xm,xl)) = sdtasdt0(X0,sdtasdt0(xl,sdtsldt0(xm,xl))) ),
    inference(superposition,[status(thm)],[c_114,c_2833]) ).

cnf(c_4003,plain,
    sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))),
    inference(superposition,[status(thm)],[c_105,c_3118]) ).

cnf(c_4128,plain,
    ( ~ aNaturalNumber0(X0)
    | sdtasdt0(sdtasdt0(X0,xl),sdtsldt0(xm,xl)) = sdtasdt0(X0,xm) ),
    inference(light_normalisation,[status(thm)],[c_3145,c_113]) ).

cnf(c_4137,plain,
    sdtasdt0(sdtasdt0(xn,xl),sdtsldt0(xm,xl)) = sdtasdt0(xn,xm),
    inference(superposition,[status(thm)],[c_110,c_4128]) ).

cnf(c_8596,plain,
    sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))) = sdtasdt0(xm,xn),
    inference(light_normalisation,[status(thm)],[c_4137,c_2873,c_2874,c_4003]) ).

cnf(c_8597,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_8596,c_2878]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : NUM478+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n005.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu May  2 19:19:41 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.36/1.25  % SZS status Started for theBenchmark.p
% 4.36/1.25  % SZS status Theorem for theBenchmark.p
% 4.36/1.25  
% 4.36/1.25  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.36/1.25  
% 4.36/1.25  ------  iProver source info
% 4.36/1.25  
% 4.36/1.25  git: date: 2024-05-02 19:28:25 +0000
% 4.36/1.25  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.36/1.25  git: non_committed_changes: false
% 4.36/1.25  
% 4.36/1.25  ------ Parsing...
% 4.36/1.25  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 4.36/1.25  
% 4.36/1.25  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 4.36/1.25  
% 4.36/1.25  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 4.36/1.25  
% 4.36/1.25  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 4.36/1.25  ------ Proving...
% 4.36/1.25  ------ Problem Properties 
% 4.36/1.25  
% 4.36/1.25  
% 4.36/1.25  clauses                                 61
% 4.36/1.25  conjectures                             4
% 4.36/1.25  EPR                                     16
% 4.36/1.25  Horn                                    47
% 4.36/1.25  unary                                   14
% 4.36/1.25  binary                                  7
% 4.36/1.25  lits                                    210
% 4.36/1.25  lits eq                                 55
% 4.36/1.25  fd_pure                                 0
% 4.36/1.25  fd_pseudo                               0
% 4.36/1.25  fd_cond                                 7
% 4.36/1.25  fd_pseudo_cond                          9
% 4.36/1.25  AC symbols                              0
% 4.36/1.25  
% 4.36/1.25  ------ Input Options Time Limit: Unbounded
% 4.36/1.25  
% 4.36/1.25  
% 4.36/1.25  ------ 
% 4.36/1.25  Current options:
% 4.36/1.25  ------ 
% 4.36/1.25  
% 4.36/1.25  
% 4.36/1.25  
% 4.36/1.25  
% 4.36/1.25  ------ Proving...
% 4.36/1.25  
% 4.36/1.25  
% 4.36/1.25  % SZS status Theorem for theBenchmark.p
% 4.36/1.25  
% 4.36/1.25  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.36/1.25  
% 4.36/1.25  
%------------------------------------------------------------------------------