↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : COM016+4 : 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 : n001.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 01:04:19 PM UTC 2026

% Result   : Theorem 4.07s 1.23s
% Output   : CNFRefutation 4.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   26 (   6 unt;   0 def)
%            Number of atoms       :   96 (   4 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   98 (  28   ~;  35   |;  35   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   14 (   0 sgn   6   !;   8   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f17,axiom,
    ( aElement0(xc)
    & aElement0(xb)
    & aElement0(xa) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__731) ).

fof(f19,axiom,
    ( sdtmndtplgtdt0(xa,xR,xc)
    & ( ? [X0] :
          ( sdtmndtplgtdt0(X0,xR,xc)
          & aReductOfIn0(X0,xa,xR)
          & aElement0(X0) )
      | aReductOfIn0(xc,xa,xR) )
    & sdtmndtplgtdt0(xa,xR,xb)
    & ( ? [X0] :
          ( sdtmndtplgtdt0(X0,xR,xb)
          & aReductOfIn0(X0,xa,xR)
          & aElement0(X0) )
      | aReductOfIn0(xb,xa,xR) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__731_02) ).

fof(f20,conjecture,
    ? [X0] :
      ( ( sdtmndtasgtdt0(X0,xR,xb)
        | sdtmndtplgtdt0(X0,xR,xb)
        | ? [X1] :
            ( sdtmndtplgtdt0(X1,xR,xb)
            & aReductOfIn0(X1,X0,xR)
            & aElement0(X1) )
        | aReductOfIn0(xb,X0,xR)
        | X0 = xb )
      & aReductOfIn0(X0,xa,xR)
      & aElement0(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f21,negated_conjecture,
    ~ ? [X0] :
        ( ( sdtmndtasgtdt0(X0,xR,xb)
          | sdtmndtplgtdt0(X0,xR,xb)
          | ? [X1] :
              ( sdtmndtplgtdt0(X1,xR,xb)
              & aReductOfIn0(X1,X0,xR)
              & aElement0(X1) )
          | aReductOfIn0(xb,X0,xR)
          | X0 = xb )
        & aReductOfIn0(X0,xa,xR)
        & aElement0(X0) ),
    inference(negated_conjecture,[status(cth)],[f20]) ).

fof(f28,plain,
    ( sdtmndtplgtdt0(xa,xR,xc)
    & ( ? [X1] :
          ( sdtmndtplgtdt0(X1,xR,xc)
          & aReductOfIn0(X1,xa,xR)
          & aElement0(X1) )
      | aReductOfIn0(xc,xa,xR) )
    & sdtmndtplgtdt0(xa,xR,xb)
    & ( ? [X0] :
          ( sdtmndtplgtdt0(X0,xR,xb)
          & aReductOfIn0(X0,xa,xR)
          & aElement0(X0) )
      | aReductOfIn0(xb,xa,xR) ) ),
    inference(rectify,[],[f19]) ).

fof(f53,plain,
    ! [X0] :
      ( ( ~ sdtmndtasgtdt0(X0,xR,xb)
        & ~ sdtmndtplgtdt0(X0,xR,xb)
        & ! [X1] :
            ( ~ sdtmndtplgtdt0(X1,xR,xb)
            | ~ aReductOfIn0(X1,X0,xR)
            | ~ aElement0(X1) )
        & ~ aReductOfIn0(xb,X0,xR)
        & xb != X0 )
      | ~ aReductOfIn0(X0,xa,xR)
      | ~ aElement0(X0) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f101,plain,
    ( sdtmndtplgtdt0(xa,xR,xc)
    & ( ( sdtmndtplgtdt0(sK28,xR,xc)
        & aReductOfIn0(sK28,xa,xR)
        & aElement0(sK28) )
      | aReductOfIn0(xc,xa,xR) )
    & sdtmndtplgtdt0(xa,xR,xb)
    & ( ( sdtmndtplgtdt0(sK27,xR,xb)
        & aReductOfIn0(sK27,xa,xR)
        & aElement0(sK27) )
      | aReductOfIn0(xb,xa,xR) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK27,sK28]),skolemize(X0,sK27),skolemize(X1,sK28)],[f28]) ).

fof(f166,plain,
    aElement0(xb),
    inference(cnf_transformation,[],[f17]) ).

fof(f195,plain,
    ( sdtmndtplgtdt0(sK27,xR,xb)
    | aReductOfIn0(xb,xa,xR) ),
    inference(cnf_transformation,[],[f101]) ).

fof(f196,plain,
    ( aReductOfIn0(sK27,xa,xR)
    | aReductOfIn0(xb,xa,xR) ),
    inference(cnf_transformation,[],[f101]) ).

fof(f197,plain,
    ( aElement0(sK27)
    | aReductOfIn0(xb,xa,xR) ),
    inference(cnf_transformation,[],[f101]) ).

fof(f199,plain,
    ! [X0] :
      ( ~ sdtmndtplgtdt0(X0,xR,xb)
      | ~ aReductOfIn0(X0,xa,xR)
      | ~ aElement0(X0) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f202,plain,
    ! [X0] :
      ( xb != X0
      | ~ aReductOfIn0(X0,xa,xR)
      | ~ aElement0(X0) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f206,plain,
    ( ~ aReductOfIn0(xb,xa,xR)
    | ~ aElement0(xb) ),
    inference(equality_resolution,[],[f202]) ).

tcf(c_113,plain,
    aElement0(xb),
    inference(cnf_transformation,[],[f166]) ).

tcf(c_137,plain,
    ( aElement0(sK27)
    | aReductOfIn0(xb,xa,xR) ),
    inference(cnf_transformation,[],[f197]) ).

tcf(c_138,plain,
    ( aReductOfIn0(sK27,xa,xR)
    | aReductOfIn0(xb,xa,xR) ),
    inference(cnf_transformation,[],[f196]) ).

tcf(c_139,plain,
    ( sdtmndtplgtdt0(sK27,xR,xb)
    | aReductOfIn0(xb,xa,xR) ),
    inference(cnf_transformation,[],[f195]) ).

tcf(c_145,negated_conjecture,
    ( ~ aElement0(xb)
    | ~ aReductOfIn0(xb,xa,xR) ),
    inference(cnf_transformation,[],[f206]) ).

tcf(c_148,negated_conjecture,
    ! [X0: $i] :
      ( ~ aElement0(X0)
      | ~ sdtmndtplgtdt0(X0,xR,xb)
      | ~ aReductOfIn0(X0,xa,xR) ),
    inference(cnf_transformation,[],[f199]) ).

tcf(c_214,plain,
    aElement0(sK27),
    inference(global_subsumption_just,[status(thm)],[c_137,c_113,c_137,c_145]) ).

tcf(c_218,plain,
    sdtmndtplgtdt0(sK27,xR,xb),
    inference(global_subsumption_just,[status(thm)],[c_139,c_113,c_145,c_139]) ).

tcf(c_220,plain,
    aReductOfIn0(sK27,xa,xR),
    inference(global_subsumption_just,[status(thm)],[c_138,c_113,c_145,c_138]) ).

tcf(c_11243,negated_conjecture,
    ! [X0: $i] :
      ( ~ aElement0(X0)
      | ~ sdtmndtplgtdt0(X0,xR,xb)
      | ~ aReductOfIn0(X0,xa,xR) ),
    inference(demodulation,[status(thm)],[c_148]) ).

tcf(c_12679,plain,
    ( ~ aElement0(sK27)
    | ~ sdtmndtplgtdt0(sK27,xR,xb) ),
    inference(superposition,[status(thm)],[c_220,c_11243]) ).

tcf(c_12682,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_12679,c_214,c_218]) ).


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