↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM578+1 : 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 : n014.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:26:05 PM UTC 2026

% Result   : Theorem 4.12s 1.17s
% Output   : CNFRefutation 4.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   30 (   9 unt;   0 def)
%            Number of atoms       :   88 (  29 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  110 (  52   ~;  38   |;  11   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    4 (   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    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn  18   !;   0   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f84,axiom,
    ( aElementOf0(xj,szNzAzT0)
    & aElementOf0(xi,szNzAzT0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3856) ).

fof(f85,axiom,
    ( xi != xj
   => ( sdtlseqdt0(szszuzczcdt0(xi),xj)
      | sdtlseqdt0(szszuzczcdt0(xj),xi) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3856_02) ).

fof(f86,conjecture,
    ( ! [X0,X1] :
        ( ( aElementOf0(X1,szNzAzT0)
          & aElementOf0(X0,szNzAzT0) )
       => ( sdtlseqdt0(szszuzczcdt0(X0),X1)
         => ( szmzizndt0(sdtlpdtrp0(xN,X1)) != szmzizndt0(sdtlpdtrp0(xN,X0))
            & aSubsetOf0(sdtlpdtrp0(xN,X1),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) ) ) )
   => ( xi != xj
     => szmzizndt0(sdtlpdtrp0(xN,xi)) != szmzizndt0(sdtlpdtrp0(xN,xj)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f87,negated_conjecture,
    ~ ( ! [X0,X1] :
          ( ( aElementOf0(X1,szNzAzT0)
            & aElementOf0(X0,szNzAzT0) )
         => ( sdtlseqdt0(szszuzczcdt0(X0),X1)
           => ( szmzizndt0(sdtlpdtrp0(xN,X1)) != szmzizndt0(sdtlpdtrp0(xN,X0))
              & aSubsetOf0(sdtlpdtrp0(xN,X1),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) ) ) )
     => ( xi != xj
       => szmzizndt0(sdtlpdtrp0(xN,xi)) != szmzizndt0(sdtlpdtrp0(xN,xj)) ) ),
    inference(negated_conjecture,[status(cth)],[f86]) ).

fof(f102,plain,
    ( xi = xj
    | sdtlseqdt0(szszuzczcdt0(xi),xj)
    | sdtlseqdt0(szszuzczcdt0(xj),xi) ),
    inference(ennf_transformation,[],[f85]) ).

fof(f103,plain,
    ( xi = xj
    | sdtlseqdt0(szszuzczcdt0(xi),xj)
    | sdtlseqdt0(szszuzczcdt0(xj),xi) ),
    inference(flattening,[],[f102]) ).

fof(f104,plain,
    ( ! [X0,X1] :
        ( ~ aElementOf0(X1,szNzAzT0)
        | ~ aElementOf0(X0,szNzAzT0)
        | ~ sdtlseqdt0(szszuzczcdt0(X0),X1)
        | ( szmzizndt0(sdtlpdtrp0(xN,X1)) != szmzizndt0(sdtlpdtrp0(xN,X0))
          & aSubsetOf0(sdtlpdtrp0(xN,X1),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) ) )
    & xi != xj
    & szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)) ),
    inference(ennf_transformation,[],[f87]) ).

fof(f105,plain,
    ( ! [X0,X1] :
        ( ~ aElementOf0(X1,szNzAzT0)
        | ~ aElementOf0(X0,szNzAzT0)
        | ~ sdtlseqdt0(szszuzczcdt0(X0),X1)
        | ( szmzizndt0(sdtlpdtrp0(xN,X1)) != szmzizndt0(sdtlpdtrp0(xN,X0))
          & aSubsetOf0(sdtlpdtrp0(xN,X1),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) ) )
    & xi != xj
    & szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)) ),
    inference(flattening,[],[f104]) ).

fof(f274,plain,
    aElementOf0(xj,szNzAzT0),
    inference(cnf_transformation,[],[f84]) ).

fof(f275,plain,
    aElementOf0(xi,szNzAzT0),
    inference(cnf_transformation,[],[f84]) ).

fof(f276,plain,
    ( xi = xj
    | sdtlseqdt0(szszuzczcdt0(xi),xj)
    | sdtlseqdt0(szszuzczcdt0(xj),xi) ),
    inference(cnf_transformation,[],[f103]) ).

fof(f277,plain,
    ! [X0,X1] :
      ( ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ sdtlseqdt0(szszuzczcdt0(X0),X1)
      | szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,X1)) ),
    inference(cnf_transformation,[],[f105]) ).

fof(f279,plain,
    xi != xj,
    inference(cnf_transformation,[],[f105]) ).

fof(f280,plain,
    szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)),
    inference(cnf_transformation,[],[f105]) ).

tcf(c_73,plain,
    aElementOf0(xi,szNzAzT0),
    inference(cnf_transformation,[],[f275]) ).

tcf(c_74,plain,
    aElementOf0(xj,szNzAzT0),
    inference(cnf_transformation,[],[f274]) ).

tcf(c_75,plain,
    ( sdtlseqdt0(szszuzczcdt0(xj),xi)
    | sdtlseqdt0(szszuzczcdt0(xi),xj)
    | ( xi = xj ) ),
    inference(cnf_transformation,[],[f276]) ).

tcf(c_76,negated_conjecture,
    szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)),
    inference(cnf_transformation,[],[f280]) ).

tcf(c_77,negated_conjecture,
    xi != xj,
    inference(cnf_transformation,[],[f279]) ).

tcf(c_79,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ sdtlseqdt0(szszuzczcdt0(X0),X1)
      | ( szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,X1)) ) ),
    inference(cnf_transformation,[],[f277]) ).

tcf(c_311,plain,
    ( sdtlseqdt0(szszuzczcdt0(xj),xi)
    | sdtlseqdt0(szszuzczcdt0(xi),xj) ),
    inference(global_subsumption_just,[status(thm)],[c_75,c_77,c_75]) ).

tcf(c_9092,plain,
    ! [X0: $i] :
      ( ~ aElementOf0(xj,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ sdtlseqdt0(szszuzczcdt0(xj),X0)
      | ( szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,xi)) ) ),
    inference(superposition,[status(thm)],[c_76,c_79]) ).

tcf(c_9093,plain,
    ! [X0: $i] :
      ( ~ aElementOf0(xj,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ sdtlseqdt0(szszuzczcdt0(X0),xj)
      | ( szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,xi)) ) ),
    inference(superposition,[status(thm)],[c_76,c_79]) ).

tcf(c_9126,plain,
    ! [X0: $i] :
      ( ( szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,xi)) )
      | ~ sdtlseqdt0(szszuzczcdt0(xj),X0)
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(global_subsumption_just,[status(thm)],[c_9092,c_74,c_9092]) ).

tcf(c_9127,plain,
    ! [X0: $i] :
      ( ~ aElementOf0(X0,szNzAzT0)
      | ~ sdtlseqdt0(szszuzczcdt0(xj),X0)
      | ( szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,xi)) ) ),
    inference(renaming,[status(thm)],[c_9126]) ).

tcf(c_9136,plain,
    ( ~ aElementOf0(xi,szNzAzT0)
    | ~ sdtlseqdt0(szszuzczcdt0(xj),xi) ),
    inference(equality_resolution,[status(thm)],[c_9127]) ).

tcf(c_9143,plain,
    ! [X0: $i] :
      ( ( szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,xi)) )
      | ~ sdtlseqdt0(szszuzczcdt0(X0),xj)
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(global_subsumption_just,[status(thm)],[c_9093,c_74,c_9093]) ).

tcf(c_9144,plain,
    ! [X0: $i] :
      ( ~ aElementOf0(X0,szNzAzT0)
      | ~ sdtlseqdt0(szszuzczcdt0(X0),xj)
      | ( szmzizndt0(sdtlpdtrp0(xN,X0)) != szmzizndt0(sdtlpdtrp0(xN,xi)) ) ),
    inference(renaming,[status(thm)],[c_9143]) ).

tcf(c_9153,plain,
    ( ~ aElementOf0(xi,szNzAzT0)
    | ~ sdtlseqdt0(szszuzczcdt0(xi),xj) ),
    inference(equality_resolution,[status(thm)],[c_9144]) ).

tcf(c_9156,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_9153,c_9136,c_311,c_73]) ).


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