TSTP Solution File: NUM435+3 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : NUM435+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %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 : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 11:30:27 EDT 2023

% Result   : Theorem 43.47s 6.76s
% Output   : CNFRefutation 43.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   44 (  19 unt;   0 def)
%            Number of atoms       :  101 (  60 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  109 (  52   ~;  46   |;   9   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   40 (   0 sgn;  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f11,axiom,
    ! [X0,X1,X2] :
      ( ( aInteger0(X2)
        & aInteger0(X1)
        & aInteger0(X0) )
     => sdtasdt0(X0,sdtasdt0(X1,X2)) = sdtasdt0(sdtasdt0(X0,X1),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulAsso) ).

fof(f12,axiom,
    ! [X0,X1] :
      ( ( aInteger0(X1)
        & aInteger0(X0) )
     => sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).

fof(f23,axiom,
    ( sz00 != xq
    & aInteger0(xq)
    & sz00 != xp
    & aInteger0(xp)
    & aInteger0(xb)
    & aInteger0(xa) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__979) ).

fof(f25,axiom,
    ( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),xm)
    & aInteger0(xm) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1032) ).

fof(f26,conjecture,
    sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f27,negated_conjecture,
    sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
    inference(negated_conjecture,[],[f26]) ).

fof(f29,plain,
    sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
    inference(flattening,[],[f27]) ).

fof(f41,plain,
    ! [X0,X1,X2] :
      ( sdtasdt0(X0,sdtasdt0(X1,X2)) = sdtasdt0(sdtasdt0(X0,X1),X2)
      | ~ aInteger0(X2)
      | ~ aInteger0(X1)
      | ~ aInteger0(X0) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f42,plain,
    ! [X0,X1,X2] :
      ( sdtasdt0(X0,sdtasdt0(X1,X2)) = sdtasdt0(sdtasdt0(X0,X1),X2)
      | ~ aInteger0(X2)
      | ~ aInteger0(X1)
      | ~ aInteger0(X0) ),
    inference(flattening,[],[f41]) ).

fof(f43,plain,
    ! [X0,X1] :
      ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
      | ~ aInteger0(X1)
      | ~ aInteger0(X0) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f44,plain,
    ! [X0,X1] :
      ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
      | ~ aInteger0(X1)
      | ~ aInteger0(X0) ),
    inference(flattening,[],[f43]) ).

fof(f80,plain,
    ! [X2,X0,X1] :
      ( sdtasdt0(X0,sdtasdt0(X1,X2)) = sdtasdt0(sdtasdt0(X0,X1),X2)
      | ~ aInteger0(X2)
      | ~ aInteger0(X1)
      | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f42]) ).

fof(f81,plain,
    ! [X0,X1] :
      ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
      | ~ aInteger0(X1)
      | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f44]) ).

fof(f103,plain,
    aInteger0(xp),
    inference(cnf_transformation,[],[f23]) ).

fof(f105,plain,
    aInteger0(xq),
    inference(cnf_transformation,[],[f23]) ).

fof(f112,plain,
    aInteger0(xm),
    inference(cnf_transformation,[],[f25]) ).

fof(f113,plain,
    sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),xm),
    inference(cnf_transformation,[],[f25]) ).

fof(f114,plain,
    sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
    inference(cnf_transformation,[],[f29]) ).

cnf(c_60,plain,
    ( ~ aInteger0(X0)
    | ~ aInteger0(X1)
    | ~ aInteger0(X2)
    | sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ),
    inference(cnf_transformation,[],[f80]) ).

cnf(c_61,plain,
    ( ~ aInteger0(X0)
    | ~ aInteger0(X1)
    | sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
    inference(cnf_transformation,[],[f81]) ).

cnf(c_82,plain,
    aInteger0(xq),
    inference(cnf_transformation,[],[f105]) ).

cnf(c_84,plain,
    aInteger0(xp),
    inference(cnf_transformation,[],[f103]) ).

cnf(c_92,plain,
    sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
    inference(cnf_transformation,[],[f113]) ).

cnf(c_93,plain,
    aInteger0(xm),
    inference(cnf_transformation,[],[f112]) ).

cnf(c_94,negated_conjecture,
    sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtpldt0(xa,smndt0(xb)),
    inference(cnf_transformation,[],[f114]) ).

cnf(c_799,plain,
    X0 = X0,
    theory(equality) ).

cnf(c_801,plain,
    ( X0 != X1
    | X2 != X1
    | X2 = X0 ),
    theory(equality) ).

cnf(c_1385,plain,
    ( sdtasdt0(xq,sdtasdt0(xp,xm)) != X0
    | sdtpldt0(xa,smndt0(xb)) != X0
    | sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtpldt0(xa,smndt0(xb)) ),
    inference(instantiation,[status(thm)],[c_801]) ).

cnf(c_1406,plain,
    ( sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(xq,sdtasdt0(xp,xm))
    | sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm))
    | sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtpldt0(xa,smndt0(xb)) ),
    inference(instantiation,[status(thm)],[c_1385]) ).

cnf(c_1407,plain,
    sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
    inference(instantiation,[status(thm)],[c_799]) ).

cnf(c_1408,plain,
    ( sdtasdt0(xq,sdtasdt0(xp,xm)) != X0
    | X1 != X0
    | sdtasdt0(xq,sdtasdt0(xp,xm)) = X1 ),
    inference(instantiation,[status(thm)],[c_801]) ).

cnf(c_1575,plain,
    ( sdtasdt0(xq,sdtasdt0(xp,xm)) != X0
    | sdtpldt0(xa,smndt0(xb)) != X0
    | sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)) ),
    inference(instantiation,[status(thm)],[c_801]) ).

cnf(c_1596,plain,
    ( sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(xq,sdtasdt0(xp,xm))
    | X0 != sdtasdt0(xq,sdtasdt0(xp,xm))
    | sdtasdt0(xq,sdtasdt0(xp,xm)) = X0 ),
    inference(instantiation,[status(thm)],[c_1408]) ).

cnf(c_1598,plain,
    ( sdtpldt0(xa,smndt0(xb)) != X0
    | sdtasdt0(X1,X2) != X0
    | sdtpldt0(xa,smndt0(xb)) = sdtasdt0(X1,X2) ),
    inference(instantiation,[status(thm)],[c_801]) ).

cnf(c_1884,plain,
    sdtpldt0(xa,smndt0(xb)) = sdtpldt0(xa,smndt0(xb)),
    inference(instantiation,[status(thm)],[c_799]) ).

cnf(c_2468,plain,
    ( sdtasdt0(sdtasdt0(xq,xp),xm) != sdtasdt0(xq,sdtasdt0(xp,xm))
    | sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(xq,sdtasdt0(xp,xm))
    | sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtasdt0(sdtasdt0(xq,xp),xm) ),
    inference(instantiation,[status(thm)],[c_1596]) ).

cnf(c_2469,plain,
    ( ~ aInteger0(xq)
    | ~ aInteger0(xp)
    | ~ aInteger0(xm)
    | sdtasdt0(sdtasdt0(xq,xp),xm) = sdtasdt0(xq,sdtasdt0(xp,xm)) ),
    inference(instantiation,[status(thm)],[c_60]) ).

cnf(c_3176,plain,
    ( sdtpldt0(xa,smndt0(xb)) != sdtpldt0(xa,smndt0(xb))
    | sdtasdt0(X0,X1) != sdtpldt0(xa,smndt0(xb))
    | sdtpldt0(xa,smndt0(xb)) = sdtasdt0(X0,X1) ),
    inference(instantiation,[status(thm)],[c_1598]) ).

cnf(c_13643,plain,
    ( sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(sdtasdt0(xq,xp),xm)
    | sdtpldt0(xa,smndt0(xb)) != sdtasdt0(sdtasdt0(xq,xp),xm)
    | sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)) ),
    inference(instantiation,[status(thm)],[c_1575]) ).

cnf(c_15806,plain,
    ( ~ aInteger0(X0)
    | sdtasdt0(X0,xq) = sdtasdt0(xq,X0) ),
    inference(superposition,[status(thm)],[c_82,c_61]) ).

cnf(c_16369,plain,
    sdtasdt0(xq,xp) = sdtasdt0(xp,xq),
    inference(superposition,[status(thm)],[c_84,c_15806]) ).

cnf(c_17819,plain,
    sdtasdt0(sdtasdt0(xq,xp),xm) = sdtpldt0(xa,smndt0(xb)),
    inference(demodulation,[status(thm)],[c_92,c_16369]) ).

cnf(c_40907,plain,
    ( sdtasdt0(sdtasdt0(xq,xp),xm) != sdtpldt0(xa,smndt0(xb))
    | sdtpldt0(xa,smndt0(xb)) != sdtpldt0(xa,smndt0(xb))
    | sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xq,xp),xm) ),
    inference(instantiation,[status(thm)],[c_3176]) ).

cnf(c_40908,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_40907,c_17819,c_13643,c_2469,c_2468,c_1884,c_1407,c_1406,c_94,c_82,c_84,c_93]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM435+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n015.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 : Fri Aug 25 12:00:52 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.47  Running first-order theorem proving
% 0.21/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 43.47/6.76  % SZS status Started for theBenchmark.p
% 43.47/6.76  % SZS status Theorem for theBenchmark.p
% 43.47/6.76  
% 43.47/6.76  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 43.47/6.76  
% 43.47/6.76  ------  iProver source info
% 43.47/6.76  
% 43.47/6.76  git: date: 2023-05-31 18:12:56 +0000
% 43.47/6.76  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 43.47/6.76  git: non_committed_changes: false
% 43.47/6.76  git: last_make_outside_of_git: false
% 43.47/6.76  
% 43.47/6.76  ------ Parsing...
% 43.47/6.76  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 43.47/6.76  
% 43.47/6.76  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 43.47/6.76  
% 43.47/6.76  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 43.47/6.76  
% 43.47/6.76  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 43.47/6.76  ------ Proving...
% 43.47/6.76  ------ Problem Properties 
% 43.47/6.76  
% 43.47/6.76  
% 43.47/6.76  clauses                                 46
% 43.47/6.76  conjectures                             1
% 43.47/6.76  EPR                                     15
% 43.47/6.76  Horn                                    39
% 43.47/6.76  unary                                   16
% 43.47/6.76  binary                                  12
% 43.47/6.76  lits                                    116
% 43.47/6.76  lits eq                                 32
% 43.69/6.76  fd_pure                                 0
% 43.69/6.76  fd_pseudo                               0
% 43.69/6.76  fd_cond                                 7
% 43.69/6.76  fd_pseudo_cond                          0
% 43.69/6.76  AC symbols                              0
% 43.69/6.76  
% 43.69/6.76  ------ Input Options Time Limit: Unbounded
% 43.69/6.76  
% 43.69/6.76  
% 43.69/6.76  ------ 
% 43.69/6.76  Current options:
% 43.69/6.76  ------ 
% 43.69/6.76  
% 43.69/6.76  
% 43.69/6.76  
% 43.69/6.76  
% 43.69/6.76  ------ Proving...
% 43.69/6.76  
% 43.69/6.76  
% 43.69/6.76  % SZS status Theorem for theBenchmark.p
% 43.69/6.76  
% 43.69/6.76  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 43.69/6.76  
% 43.69/6.76  
%------------------------------------------------------------------------------