↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWB002+2 : TPTP v9.3.1. Released v5.2.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 03:04:19 PM UTC 2026

% Result   : Theorem 1.53s 1.27s
% Output   : CNFRefutation 1.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   7 unt;   0 def)
%            Number of atoms       :   25 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   21 (  12   ~;   5   |;   4   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 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  :    3 (   2 usr;   2 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   15 (   0 sgn  10   !;   5   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ? [X0,X1] :
      ( iext(uri_ex_q,X1,X0)
      & iext(uri_ex_p,X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).

fof(f2,negated_conjecture,
    ~ ? [X0,X1] :
        ( iext(uri_ex_q,X1,X0)
        & iext(uri_ex_p,X0,X1) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,axiom,
    ? [X0] :
      ( iext(uri_ex_q,X0,uri_ex_s)
      & iext(uri_ex_p,uri_ex_s,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).

fof(f4,plain,
    ! [X0,X1] :
      ( ~ iext(uri_ex_q,X1,X0)
      | ~ iext(uri_ex_p,X0,X1) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f5,plain,
    ( iext(uri_ex_q,sK0,uri_ex_s)
    & iext(uri_ex_p,uri_ex_s,sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f3]) ).

fof(f6,plain,
    ! [X0,X1] :
      ( ~ iext(uri_ex_q,X1,X0)
      | ~ iext(uri_ex_p,X0,X1) ),
    inference(cnf_transformation,[],[f4]) ).

fof(f7,plain,
    iext(uri_ex_q,sK0,uri_ex_s),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    iext(uri_ex_p,uri_ex_s,sK0),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_49,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ iext(uri_ex_q,X1,X0)
      | ~ iext(uri_ex_p,X0,X1) ),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_50,plain,
    iext(uri_ex_p,uri_ex_s,sK0),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_51,plain,
    iext(uri_ex_q,sK0,uri_ex_s),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_54,plain,
    iext(uri_ex_p,uri_ex_s,sK0),
    inference(subtyping,[status(esa)],[c_50]) ).

tcf(c_55,negated_conjecture,
    ! [X0_iProver_iext_3: iProver_iext_3,X1_iProver_iext_3: iProver_iext_3] :
      ( ~ iext(uri_ex_q,X1_iProver_iext_3,X0_iProver_iext_3)
      | ~ iext(uri_ex_p,X0_iProver_iext_3,X1_iProver_iext_3) ),
    inference(subtyping,[status(esa)],[c_49]) ).

tcf(c_56,negated_conjecture,
    ! [X0_iProver_iext_3: iProver_iext_3,X1_iProver_iext_3: iProver_iext_3] :
      ( ~ iext(uri_ex_q,X1_iProver_iext_3,X0_iProver_iext_3)
      | ~ iext(uri_ex_p,X0_iProver_iext_3,X1_iProver_iext_3) ),
    inference(demodulation,[status(thm)],[c_55]) ).

tcf(c_57,plain,
    ~ iext(uri_ex_q,sK0,uri_ex_s),
    inference(resolution,[status(thm)],[c_54,c_56]) ).

tcf(c_58,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_57,c_51]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWB002+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36  % Computer : n026.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Thu Sep 24 15:20:55 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.40  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...
% 1.53/1.27  % SZS status Started for theBenchmark.p
% 1.53/1.27  % SZS status Theorem for theBenchmark.p
% 1.53/1.27  
% 1.53/1.27  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.53/1.27  
% 1.53/1.27  % ------  iProver source info
% 1.53/1.27  
% 1.53/1.27  % git: date: 2026-07-19 20:42:38 +0200
% 1.53/1.27  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.53/1.27  % git: non_committed_changes: false
% 1.53/1.27  
% 1.53/1.27  % ------ Parsing...
% 1.53/1.27  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_horn
% 1.53/1.27  % 
% 1.53/1.27  
% 1.53/1.27  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e % 
% 1.53/1.27  
% 1.53/1.27  % ------ Preprocessing...% ------  preprocesses with Option_epr_horn
% 1.53/1.27   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.53/1.27  % ------ Proving...
% 1.53/1.27  % ------ Problem Properties 
% 1.53/1.27  
% 1.53/1.27  % 
% 1.53/1.27  % clauses                               3
% 1.53/1.27  % conjectures                           1
% 1.53/1.27  % EPR                                   3
% 1.53/1.27  % Horn                                  3
% 1.53/1.27  % unary                                 2
% 1.53/1.27  % binary                                1
% 1.53/1.27  % lits                                  4
% 1.53/1.27  % lits eq                               0
% 1.53/1.27  % fd_pure                               0
% 1.53/1.27  % fd_pseudo                             0
% 1.53/1.27  % fd_cond                               0
% 1.53/1.27  % fd_pseudo_cond                        0
% 1.53/1.27  % AC symbols                            0
% 1.53/1.27  
% 1.53/1.27  % ------ Schedule EPR Horn non eq is on
% 1.53/1.27  
% 1.53/1.27  % ------ no equalities: superposition off 
% 1.53/1.27  
% 1.53/1.27  % ------ Option_epr_horn Time Limit: Unbounded
% 1.53/1.27  
% 1.53/1.27  
% 1.53/1.27  % ------ 
% 1.53/1.27  % Current options:
% 1.53/1.27  % ------ 
% 1.53/1.27  
% 1.53/1.27  
% 1.53/1.27  % 
% 1.53/1.27  
% 1.53/1.27  % ------ Proving...
% 1.53/1.27  % 
% 1.53/1.27  
% 1.53/1.27  % SZS status Theorem for theBenchmark.p
% 1.53/1.27  
% 1.53/1.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.53/1.27  
% 1.53/1.27  
%------------------------------------------------------------------------------