↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM477+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 02:25:10 PM UTC 2026

% Result   : Theorem 4.04s 17.14s
% Output   : CNFRefutation 4.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   32 (  16 unt;   0 def)
%            Number of atoms       :   69 (  27 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   62 (  25   ~;  21   |;  13   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn  15   !;   3   ?;   3   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f12,axiom,
    ! [X0] :
      ( aNaturalNumber0(X0)
     => ( sz00 = sdtasdt0(sz00,X0)
        & sdtasdt0(X0,sz00) = sz00 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulZero) ).

fof(f27,axiom,
    ! [X0,X1] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => ( X0 != sz00
       => sdtlseqdt0(X1,sdtasdt0(X1,X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMonMul2) ).

fof(f35,axiom,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1494) ).

fof(f36,axiom,
    ( xn != sz00
    & doDivides0(xm,xn)
    & ? [X0] :
        ( xn = sdtasdt0(xm,X0)
        & aNaturalNumber0(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1494_04) ).

fof(f37,conjecture,
    ( sdtlseqdt0(xm,xn)
    | ? [X0] :
        ( sdtpldt0(xm,X0) = xn
        & aNaturalNumber0(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f38,negated_conjecture,
    ~ ( sdtlseqdt0(xm,xn)
      | ? [X0] :
          ( sdtpldt0(xm,X0) = xn
          & aNaturalNumber0(X0) ) ),
    inference(negated_conjecture,[status(cth)],[f37]) ).

fof(f56,plain,
    ! [X0] :
      ( ~ aNaturalNumber0(X0)
      | ( sz00 = sdtasdt0(sz00,X0)
        & sdtasdt0(X0,sz00) = sz00 ) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f84,plain,
    ! [X0,X1] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | sz00 = X0
      | sdtlseqdt0(X1,sdtasdt0(X1,X0)) ),
    inference(ennf_transformation,[],[f27]) ).

fof(f85,plain,
    ! [X0,X1] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | sz00 = X0
      | sdtlseqdt0(X1,sdtasdt0(X1,X0)) ),
    inference(flattening,[],[f84]) ).

fof(f96,plain,
    ( ~ sdtlseqdt0(xm,xn)
    & ! [X0] :
        ( xn != sdtpldt0(xm,X0)
        | ~ aNaturalNumber0(X0) ) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f107,plain,
    ( xn != sz00
    & doDivides0(xm,xn)
    & xn = sdtasdt0(xm,sK2)
    & aNaturalNumber0(sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f36]) ).

fof(f122,plain,
    ! [X0] :
      ( ~ aNaturalNumber0(X0)
      | sz00 = sdtasdt0(X0,sz00) ),
    inference(cnf_transformation,[],[f56]) ).

fof(f153,plain,
    ! [X0,X1] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | sz00 = X0
      | sdtlseqdt0(X1,sdtasdt0(X1,X0)) ),
    inference(cnf_transformation,[],[f85]) ).

fof(f164,plain,
    aNaturalNumber0(xm),
    inference(cnf_transformation,[],[f35]) ).

fof(f165,plain,
    sz00 != xn,
    inference(cnf_transformation,[],[f107]) ).

fof(f167,plain,
    xn = sdtasdt0(xm,sK2),
    inference(cnf_transformation,[],[f107]) ).

fof(f168,plain,
    aNaturalNumber0(sK2),
    inference(cnf_transformation,[],[f107]) ).

fof(f169,plain,
    ~ sdtlseqdt0(xm,xn),
    inference(cnf_transformation,[],[f96]) ).

tcf(c_62,plain,
    ! [X0: $i] :
      ( ( sdtasdt0(X0,sz00) = sz00 )
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f122]) ).

tcf(c_93,plain,
    ! [X0: $i,X1: $i] :
      ( sdtlseqdt0(X1,sdtasdt0(X1,X0))
      | ( X0 = sz00 )
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f153]) ).

tcf(c_103,plain,
    aNaturalNumber0(xm),
    inference(cnf_transformation,[],[f164]) ).

tcf(c_105,plain,
    aNaturalNumber0(sK2),
    inference(cnf_transformation,[],[f168]) ).

tcf(c_106,plain,
    sdtasdt0(xm,sK2) = xn,
    inference(cnf_transformation,[],[f167]) ).

tcf(c_108,plain,
    sz00 != xn,
    inference(cnf_transformation,[],[f165]) ).

tcf(c_110,negated_conjecture,
    ~ sdtlseqdt0(xm,xn),
    inference(cnf_transformation,[],[f169]) ).

tcf(c_1765,negated_conjecture,
    ~ sdtlseqdt0(xm,xn),
    inference(demodulation,[status(thm)],[c_110]) ).

tcf(c_2788,plain,
    sdtasdt0(xm,sz00) = sz00,
    inference(superposition,[status(thm)],[c_103,c_62]) ).

tcf(c_3373,plain,
    ( sdtlseqdt0(xm,xn)
    | ( sz00 = sK2 )
    | ~ aNaturalNumber0(sK2)
    | ~ aNaturalNumber0(xm) ),
    inference(superposition,[status(thm)],[c_106,c_93]) ).

tcf(c_3397,plain,
    sz00 = sK2,
    inference(forward_subsumption_resolution,[status(thm)],[c_3373,c_1765,c_105,c_103]) ).

tcf(c_3409,plain,
    sdtasdt0(xm,sz00) = xn,
    inference(demodulation,[status(thm)],[c_106,c_3397]) ).

tcf(c_3411,plain,
    sz00 = xn,
    inference(light_normalisation,[status(thm)],[c_3409,c_2788]) ).

tcf(c_3412,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3411,c_108]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM477+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/16.22  % Computer : n010.cluster.edu
% 0.11/16.22  % Model    : x86_64 x86_64
% 0.11/16.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/16.22  % Memory   : 8046.5625MB
% 0.11/16.22  % OS       : Linux 6.8.0-71-generic
% 0.11/16.22  % CPULimit : 300
% 0.11/16.22  % WCLimit  : 300
% 0.11/16.22  % DateTime : Thu Sep 24 04:12:06 UTC 2026
% 0.11/16.23  % CPUTime  : 
% 0.11/16.23  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/16.26  Running first-order theorem proving
% 0.11/16.27  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/16.28  
% 0.11/16.28  % ======== iProver multi-core TPTP/SMT =========
% 0.11/16.28  
% 0.11/16.28  % Detected problem language: tptp
% 0.11/16.29  % Proving...
% 4.04/17.14  % SZS status Started for theBenchmark.p
% 4.04/17.14  % SZS status Theorem for theBenchmark.p
% 4.04/17.14  
% 4.04/17.14  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.04/17.14  
% 4.04/17.14  % ------  iProver source info
% 4.04/17.14  
% 4.04/17.14  % git: date: 2026-07-19 20:42:38 +0200
% 4.04/17.14  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.04/17.14  % git: non_committed_changes: false
% 4.04/17.14  
% 4.04/17.14  % ------ Parsing...
% 4.04/17.14  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 4.04/17.14  
% 4.04/17.14  % ------ 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.04/17.14  
% 4.04/17.14  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 4.04/17.14  
% 4.04/17.14  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 4.04/17.14  % ------ Proving...
% 4.04/17.14  % ------ Problem Properties 
% 4.04/17.14  
% 4.04/17.14  % 
% 4.04/17.14  % clauses                               57
% 4.04/17.14  % conjectures                           2
% 4.04/17.14  % EPR                                   15
% 4.04/17.14  % Horn                                  44
% 4.04/17.14  % unary                                 10
% 4.04/17.14  % binary                                8
% 4.04/17.14  % lits                                  203
% 4.04/17.14  % lits eq                               52
% 4.04/17.14  % fd_pure                               0
% 4.04/17.14  % fd_pseudo                             0
% 4.04/17.14  % fd_cond                               6
% 4.04/17.14  % fd_pseudo_cond                        9
% 4.04/17.14  % AC symbols                            0
% 4.04/17.14  
% 4.04/17.14  % ------ Schedule dynamic 5 is on 
% 4.04/17.14  
% 4.04/17.14  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.04/17.14  
% 4.04/17.14  
% 4.04/17.14  % ------ 
% 4.04/17.14  % Current options:
% 4.04/17.14  % ------ 
% 4.04/17.14  
% 4.04/17.14  
% 4.04/17.14  % 
% 4.04/17.14  
% 4.04/17.14  % ------ Proving...
% 4.04/17.14  % 
% 4.04/17.14  
% 4.04/17.14  % SZS status Theorem for theBenchmark.p
% 4.04/17.14  
% 4.04/17.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.04/17.14  
% 4.04/17.14  
%------------------------------------------------------------------------------