↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM458+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 : n026.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:24:32 PM UTC 2026

% Result   : Theorem 2.68s 1.29s
% Output   : CNFRefutation 2.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   8 unt;   0 def)
%            Number of atoms       :   33 (  13 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   28 (  13   ~;   9   |;   5   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   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  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn   7   !;   2   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    aNaturalNumber0(sz00),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).

fof(f8,axiom,
    ! [X0] :
      ( aNaturalNumber0(X0)
     => ( X0 = sdtpldt0(sz00,X0)
        & sdtpldt0(X0,sz00) = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_AddZero) ).

fof(f20,axiom,
    aNaturalNumber0(xm),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__718) ).

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

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

fof(f32,plain,
    ! [X0] :
      ( ~ aNaturalNumber0(X0)
      | ( X0 = sdtpldt0(sz00,X0)
        & sdtpldt0(X0,sz00) = X0 ) ),
    inference(ennf_transformation,[],[f8]) ).

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

fof(f59,plain,
    aNaturalNumber0(sz00),
    inference(cnf_transformation,[],[f2]) ).

fof(f67,plain,
    ! [X0] :
      ( ~ aNaturalNumber0(X0)
      | sdtpldt0(X0,sz00) = X0 ),
    inference(cnf_transformation,[],[f32]) ).

fof(f89,plain,
    aNaturalNumber0(xm),
    inference(cnf_transformation,[],[f20]) ).

fof(f91,plain,
    ! [X0] :
      ( xm != sdtpldt0(xm,X0)
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f53]) ).

tcf(c_49,plain,
    aNaturalNumber0(sz00),
    inference(cnf_transformation,[],[f59]) ).

tcf(c_56,plain,
    ! [X0: $i] :
      ( ( sdtpldt0(X0,sz00) = X0 )
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f67]) ).

tcf(c_79,plain,
    aNaturalNumber0(xm),
    inference(cnf_transformation,[],[f89]) ).

tcf(c_80,negated_conjecture,
    ! [X0: $i] :
      ( ~ aNaturalNumber0(X0)
      | ( sdtpldt0(xm,X0) != xm ) ),
    inference(cnf_transformation,[],[f91]) ).

tcf(c_86,plain,
    ( ~ aNaturalNumber0(sz00)
    | ( sdtpldt0(xm,sz00) != xm ) ),
    inference(instantiation,[status(thm)],[c_80]) ).

tcf(c_1456,plain,
    sdtpldt0(xm,sz00) = xm,
    inference(superposition,[status(thm)],[c_79,c_56]) ).

tcf(c_1457,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1456,c_86,c_49]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM458+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.10/0.37  % Computer : n026.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Thu Sep 24 04:07:24 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  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.15/0.42  
% 0.15/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.42  
% 0.15/0.42  % Detected problem language: tptp
% 0.15/0.43  % Proving...
% 2.68/1.29  % SZS status Started for theBenchmark.p
% 2.68/1.29  % SZS status Theorem for theBenchmark.p
% 2.68/1.29  
% 2.68/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.68/1.29  
% 2.68/1.29  % ------  iProver source info
% 2.68/1.29  
% 2.68/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 2.68/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.68/1.29  % git: non_committed_changes: false
% 2.68/1.29  
% 2.68/1.29  % ------ Parsing...
% 2.68/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.68/1.29  
% 2.68/1.29  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e % 
% 2.68/1.29  
% 2.68/1.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.68/1.29  
% 2.68/1.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.68/1.29  % ------ Proving...
% 2.68/1.29  % ------ Problem Properties 
% 2.68/1.29  
% 2.68/1.29  % 
% 2.68/1.29  % clauses                               31
% 2.68/1.29  % conjectures                           1
% 2.68/1.29  % EPR                                   4
% 2.68/1.29  % Horn                                  28
% 2.68/1.29  % unary                                 4
% 2.68/1.29  % binary                                7
% 2.68/1.29  % lits                                  96
% 2.68/1.29  % lits eq                               34
% 2.68/1.29  % fd_pure                               0
% 2.68/1.29  % fd_pseudo                             0
% 2.68/1.29  % fd_cond                               3
% 2.68/1.29  % fd_pseudo_cond                        4
% 2.68/1.29  % AC symbols                            0
% 2.68/1.29  
% 2.68/1.29  % ------ Schedule dynamic 5 is on 
% 2.68/1.29  
% 2.68/1.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.68/1.29  
% 2.68/1.29  
% 2.68/1.29  % ------ 
% 2.68/1.29  % Current options:
% 2.68/1.29  % ------ 
% 2.68/1.29  
% 2.68/1.29  
% 2.68/1.29  % 
% 2.68/1.29  
% 2.68/1.29  % ------ Proving...
% 2.68/1.29  % 
% 2.68/1.29  
% 2.68/1.29  % SZS status Theorem for theBenchmark.p
% 2.68/1.29  
% 2.68/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.68/1.29  
% 2.68/1.29  
%------------------------------------------------------------------------------