↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM576+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 : n009.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 10.58s 2.31s
% Output   : CNFRefutation 10.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (  11 unt;   0 def)
%            Number of atoms       :   81 (  12 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   99 (  47   ~;  39   |;   8   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 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    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   20 (   0 sgn  20   !;   0   ?;   4   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f35,axiom,
    ! [X0,X1] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X0,szNzAzT0) )
     => ( ( sdtlseqdt0(X1,X0)
          & sdtlseqdt0(X0,X1) )
       => X0 = X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessASymm) ).

fof(f37,axiom,
    ! [X0,X1] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X0,szNzAzT0) )
     => ( sdtlseqdt0(szszuzczcdt0(X1),X0)
        | sdtlseqdt0(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessTotal) ).

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

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

fof(f86,negated_conjecture,
    ~ ( xi != xj
     => ( sdtlseqdt0(szszuzczcdt0(xi),xj)
        | sdtlseqdt0(szszuzczcdt0(xj),xi) ) ),
    inference(negated_conjecture,[status(cth)],[f85]) ).

fof(f138,plain,
    ! [X0,X1] :
      ( ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ sdtlseqdt0(X1,X0)
      | ~ sdtlseqdt0(X0,X1)
      | X0 = X1 ),
    inference(ennf_transformation,[],[f35]) ).

fof(f139,plain,
    ! [X0,X1] :
      ( ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ sdtlseqdt0(X1,X0)
      | ~ sdtlseqdt0(X0,X1)
      | X0 = X1 ),
    inference(flattening,[],[f138]) ).

fof(f142,plain,
    ! [X0,X1] :
      ( ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0)
      | sdtlseqdt0(szszuzczcdt0(X1),X0)
      | sdtlseqdt0(X0,X1) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f143,plain,
    ! [X0,X1] :
      ( ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0)
      | sdtlseqdt0(szszuzczcdt0(X1),X0)
      | sdtlseqdt0(X0,X1) ),
    inference(flattening,[],[f142]) ).

fof(f206,plain,
    ( xi != xj
    & ~ sdtlseqdt0(szszuzczcdt0(xi),xj)
    & ~ sdtlseqdt0(szszuzczcdt0(xj),xi) ),
    inference(ennf_transformation,[],[f86]) ).

fof(f207,plain,
    ( xi != xj
    & ~ sdtlseqdt0(szszuzczcdt0(xi),xj)
    & ~ sdtlseqdt0(szszuzczcdt0(xj),xi) ),
    inference(flattening,[],[f206]) ).

fof(f363,plain,
    ! [X0,X1] :
      ( ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ sdtlseqdt0(X1,X0)
      | ~ sdtlseqdt0(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f139]) ).

fof(f365,plain,
    ! [X0,X1] :
      ( ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0)
      | sdtlseqdt0(szszuzczcdt0(X1),X0)
      | sdtlseqdt0(X0,X1) ),
    inference(cnf_transformation,[],[f143]) ).

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

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

fof(f529,plain,
    xi != xj,
    inference(cnf_transformation,[],[f207]) ).

fof(f530,plain,
    ~ sdtlseqdt0(szszuzczcdt0(xi),xj),
    inference(cnf_transformation,[],[f207]) ).

fof(f531,plain,
    ~ sdtlseqdt0(szszuzczcdt0(xj),xi),
    inference(cnf_transformation,[],[f207]) ).

tcf(c_109,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ sdtlseqdt0(X1,X0)
      | ~ sdtlseqdt0(X0,X1) ),
    inference(cnf_transformation,[],[f363]) ).

tcf(c_111,plain,
    ! [X0: $i,X1: $i] :
      ( sdtlseqdt0(X1,X0)
      | sdtlseqdt0(szszuzczcdt0(X0),X1)
      | ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(cnf_transformation,[],[f365]) ).

tcf(c_273,plain,
    aElementOf0(xi,szNzAzT0),
    inference(cnf_transformation,[],[f528]) ).

tcf(c_274,plain,
    aElementOf0(xj,szNzAzT0),
    inference(cnf_transformation,[],[f527]) ).

tcf(c_275,negated_conjecture,
    ~ sdtlseqdt0(szszuzczcdt0(xj),xi),
    inference(cnf_transformation,[],[f531]) ).

tcf(c_276,negated_conjecture,
    ~ sdtlseqdt0(szszuzczcdt0(xi),xj),
    inference(cnf_transformation,[],[f530]) ).

tcf(c_277,negated_conjecture,
    xi != xj,
    inference(cnf_transformation,[],[f529]) ).

tcf(c_8061,plain,
    ( ( xi = xj )
    | ~ sdtlseqdt0(xj,xi)
    | ~ sdtlseqdt0(xi,xj)
    | ~ aElementOf0(xj,szNzAzT0)
    | ~ aElementOf0(xi,szNzAzT0) ),
    inference(instantiation,[status(thm)],[c_109]) ).

tcf(c_12083,plain,
    ( sdtlseqdt0(xi,xj)
    | ~ aElementOf0(xj,szNzAzT0)
    | ~ aElementOf0(xi,szNzAzT0) ),
    inference(superposition,[status(thm)],[c_111,c_275]) ).

tcf(c_12084,plain,
    ( sdtlseqdt0(xj,xi)
    | ~ aElementOf0(xj,szNzAzT0)
    | ~ aElementOf0(xi,szNzAzT0) ),
    inference(superposition,[status(thm)],[c_111,c_276]) ).

tcf(c_12129,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_12083,c_12084,c_8061,c_277,c_273,c_274]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM576+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 : n009.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:42:58 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.38  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.43  
% 0.10/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43  
% 0.10/0.43  % Detected problem language: tptp
% 0.10/0.44  % Proving...
% 10.58/2.31  % SZS status Started for theBenchmark.p
% 10.58/2.31  % SZS status Theorem for theBenchmark.p
% 10.58/2.31  
% 10.58/2.31  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.58/2.31  
% 10.58/2.31  % ------  iProver source info
% 10.58/2.31  
% 10.58/2.31  % git: date: 2026-07-19 20:42:38 +0200
% 10.58/2.31  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.58/2.31  % git: non_committed_changes: false
% 10.58/2.31  
% 10.58/2.31  % ------ Parsing...
% 10.58/2.31  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 10.58/2.31  
% 10.58/2.31  % ------ Preprocessing... sup_sim: 0  pe_s  pe:1:0s pe:2:0s pe_e % 
% 10.58/2.31  
% 10.58/2.31  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  scvd_s sp: 5 0s scvd_e  snvd_s sp: 0 0s snvd_e % 
% 10.58/2.31  
% 10.58/2.31  % ------ Preprocessing...
% 10.58/2.31  % ------ Proving...
% 10.58/2.31  % ------ Problem Properties 
% 10.58/2.31  
% 10.58/2.31  % 
% 10.58/2.31  % clauses                               259
% 10.58/2.31  % conjectures                           3
% 10.58/2.31  % EPR                                   57
% 10.58/2.31  % Horn                                  204
% 10.58/2.31  % unary                                 30
% 10.58/2.31  % binary                                82
% 10.58/2.31  % lits                                  829
% 10.58/2.31  % lits eq                               101
% 10.58/2.31  % fd_pure                               0
% 10.58/2.31  % fd_pseudo                             0
% 10.58/2.31  % fd_cond                               10
% 10.58/2.31  % fd_pseudo_cond                        30
% 10.58/2.31  % AC symbols                            0
% 10.58/2.31  
% 10.58/2.31  % ------ Input Options Time Limit: Unbounded
% 10.58/2.31  
% 10.58/2.31  
% 10.58/2.31  % ------ 
% 10.58/2.31  % Current options:
% 10.58/2.31  % ------ 
% 10.58/2.31  
% 10.58/2.31  
% 10.58/2.31  % 
% 10.58/2.31  
% 10.58/2.31  % ------ Proving...
% 10.58/2.31  % 
% 10.58/2.31  
% 10.58/2.31  % SZS status Theorem for theBenchmark.p
% 10.58/2.31  
% 10.58/2.31  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.58/2.31  
% 10.58/2.31  
%------------------------------------------------------------------------------