↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM505+3 : 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 : n013.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:22 PM UTC 2026

% Result   : Theorem 4.05s 1.29s
% Output   : CNFRefutation 4.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (  11 unt;   0 def)
%            Number of atoms       :   95 (  30 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :  114 (  48   ~;  36   |;  26   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   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    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn  18   !;   6   ?;   3   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f23,axiom,
    ! [X0,X1] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => ( ( sdtlseqdt0(X1,X0)
          & X1 != X0 )
        | sdtlseqdt0(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLETotal) ).

fof(f39,axiom,
    ( aNaturalNumber0(xp)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1837) ).

fof(f45,axiom,
    ( xk = sdtsldt0(sdtasdt0(xn,xm),xp)
    & sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
    & aNaturalNumber0(xk) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2306) ).

fof(f50,conjecture,
    ( ~ ( sdtlseqdt0(xp,xk)
        | ? [X0] :
            ( sdtpldt0(xp,X0) = xk
            & aNaturalNumber0(X0) ) )
   => ( ( sdtlseqdt0(xk,xp)
        | ? [X0] :
            ( sdtpldt0(xk,X0) = xp
            & aNaturalNumber0(X0) ) )
      & xk != xp ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f51,negated_conjecture,
    ~ ( ~ ( sdtlseqdt0(xp,xk)
          | ? [X0] :
              ( sdtpldt0(xp,X0) = xk
              & aNaturalNumber0(X0) ) )
     => ( ( sdtlseqdt0(xk,xp)
          | ? [X0] :
              ( sdtpldt0(xk,X0) = xp
              & aNaturalNumber0(X0) ) )
        & xk != xp ) ),
    inference(negated_conjecture,[status(cth)],[f50]) ).

fof(f59,plain,
    ~ ( ~ ( sdtlseqdt0(xp,xk)
          | ? [X0] :
              ( sdtpldt0(xp,X0) = xk
              & aNaturalNumber0(X0) ) )
     => ( ( sdtlseqdt0(xk,xp)
          | ? [X1] :
              ( xp = sdtpldt0(xk,X1)
              & aNaturalNumber0(X1) ) )
        & xk != xp ) ),
    inference(rectify,[],[f51]) ).

fof(f94,plain,
    ! [X0,X1] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | ( sdtlseqdt0(X1,X0)
        & X1 != X0 )
      | sdtlseqdt0(X0,X1) ),
    inference(ennf_transformation,[],[f23]) ).

fof(f95,plain,
    ! [X0,X1] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | ( sdtlseqdt0(X1,X0)
        & X1 != X0 )
      | sdtlseqdt0(X0,X1) ),
    inference(flattening,[],[f94]) ).

fof(f133,plain,
    ( ~ sdtlseqdt0(xp,xk)
    & ! [X0] :
        ( sdtpldt0(xp,X0) != xk
        | ~ aNaturalNumber0(X0) )
    & ( ( ~ sdtlseqdt0(xk,xp)
        & ! [X1] :
            ( xp != sdtpldt0(xk,X1)
            | ~ aNaturalNumber0(X1) ) )
      | xp = xk ) ),
    inference(ennf_transformation,[],[f59]) ).

fof(f134,plain,
    ( ~ sdtlseqdt0(xp,xk)
    & ! [X0] :
        ( sdtpldt0(xp,X0) != xk
        | ~ aNaturalNumber0(X0) )
    & ( ( ~ sdtlseqdt0(xk,xp)
        & ! [X1] :
            ( xp != sdtpldt0(xk,X1)
            | ~ aNaturalNumber0(X1) ) )
      | xp = xk ) ),
    inference(flattening,[],[f133]) ).

fof(f165,plain,
    ( ~ sdtlseqdt0(xp,xk)
    & ! [X1] :
        ( xk != sdtpldt0(xp,X1)
        | ~ aNaturalNumber0(X1) )
    & ( ( ~ sdtlseqdt0(xk,xp)
        & ! [X0] :
            ( xp != sdtpldt0(xk,X0)
            | ~ aNaturalNumber0(X0) ) )
      | xp = xk ) ),
    inference(rectify,[],[f134]) ).

fof(f199,plain,
    ! [X0,X1] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | sdtlseqdt0(X1,X0)
      | sdtlseqdt0(X0,X1) ),
    inference(cnf_transformation,[],[f95]) ).

fof(f234,plain,
    aNaturalNumber0(xp),
    inference(cnf_transformation,[],[f39]) ).

fof(f275,plain,
    aNaturalNumber0(xk),
    inference(cnf_transformation,[],[f45]) ).

fof(f294,plain,
    ~ sdtlseqdt0(xp,xk),
    inference(cnf_transformation,[],[f165]) ).

fof(f296,plain,
    ( ~ sdtlseqdt0(xk,xp)
    | xp = xk ),
    inference(cnf_transformation,[],[f165]) ).

fof(f297,plain,
    ! [X0] :
      ( xp != sdtpldt0(xk,X0)
      | ~ aNaturalNumber0(X0)
      | xp = xk ),
    inference(cnf_transformation,[],[f165]) ).

tcf(c_83,plain,
    ! [X0: $i,X1: $i] :
      ( sdtlseqdt0(X1,X0)
      | sdtlseqdt0(X0,X1)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f199]) ).

tcf(c_118,plain,
    aNaturalNumber0(xp),
    inference(cnf_transformation,[],[f234]) ).

tcf(c_155,plain,
    aNaturalNumber0(xk),
    inference(cnf_transformation,[],[f275]) ).

tcf(c_176,negated_conjecture,
    ! [X0: $i] :
      ( ( xp = xk )
      | ~ aNaturalNumber0(X0)
      | ( sdtpldt0(xk,X0) != xp ) ),
    inference(cnf_transformation,[],[f297]) ).

tcf(c_177,negated_conjecture,
    ( ( xp = xk )
    | ~ sdtlseqdt0(xk,xp) ),
    inference(cnf_transformation,[],[f296]) ).

tcf(c_179,negated_conjecture,
    ~ sdtlseqdt0(xp,xk),
    inference(cnf_transformation,[],[f294]) ).

tcf(c_260,plain,
    ( sdtlseqdt0(xk,xp)
    | ~ aNaturalNumber0(xk)
    | ~ aNaturalNumber0(xp) ),
    inference(superposition,[status(thm)],[c_83,c_179]) ).

tcf(c_263,negated_conjecture,
    xp = xk,
    inference(global_subsumption_just,[status(thm)],[c_176,c_155,c_118,c_177,c_260]) ).

tcf(c_269,plain,
    ~ sdtlseqdt0(xp,xp),
    inference(superposition,[status(thm)],[c_263,c_179]) ).

tcf(c_709,plain,
    sdtlseqdt0(xk,xp),
    inference(global_subsumption_just,[status(thm)],[c_260,c_155,c_118,c_260]) ).

tcf(c_711,plain,
    sdtlseqdt0(xp,xp),
    inference(light_normalisation,[status(thm)],[c_709,c_263]) ).

tcf(c_725,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_269,c_711]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM505+3 : 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 : n013.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:19:42 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/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.10/0.42  
% 0.10/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42  
% 0.10/0.42  % Detected problem language: tptp
% 0.10/0.43  % Proving...
% 4.05/1.29  % SZS status Started for theBenchmark.p
% 4.05/1.29  % SZS status Theorem for theBenchmark.p
% 4.05/1.29  
% 4.05/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.05/1.29  
% 4.05/1.29  % ------  iProver source info
% 4.05/1.29  
% 4.05/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 4.05/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.05/1.29  % git: non_committed_changes: false
% 4.05/1.29  
% 4.05/1.29  % ------ Parsing...
% 4.05/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 4.05/1.29  % ------ Proving...
% 4.05/1.29  % ------ Problem Properties 
% 4.05/1.29  
% 4.05/1.29  % 
% 4.05/1.29  % clauses                               131
% 4.05/1.29  % conjectures                           4
% 4.05/1.29  % EPR                                   49
% 4.05/1.29  % Horn                                  89
% 4.05/1.29  % unary                                 42
% 4.05/1.29  % binary                                18
% 4.05/1.29  % lits                                  437
% 4.05/1.29  % lits eq                               136
% 4.05/1.29  % fd_pure                               0
% 4.05/1.29  % fd_pseudo                             0
% 4.05/1.29  % fd_cond                               24
% 4.05/1.29  % fd_pseudo_cond                        15
% 4.05/1.29  % AC symbols                            0
% 4.05/1.29  
% 4.05/1.29  % ------ Input Options Time Limit: Unbounded
% 4.05/1.29  
% 4.05/1.29  
% 4.05/1.29  % ------ 
% 4.05/1.29  % Current options:
% 4.05/1.29  % ------ 
% 4.05/1.29  
% 4.05/1.29  
% 4.05/1.29  % 
% 4.05/1.29  
% 4.05/1.29  % ------ Proving...
% 4.05/1.29  % 
% 4.05/1.29  
% 4.05/1.29  % SZS status Theorem for theBenchmark.p
% 4.05/1.29  
% 4.05/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.05/1.29  
% 4.05/1.29  
%------------------------------------------------------------------------------