↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN372+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n008.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:39:53 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [X0] :
      ( ? [X1] :
          ( big_p(X1)
         => big_q(X0) )
     => ? [X1] :
          ( big_p(X1)
         => big_q(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2123) ).

fof(f2,negated_conjecture,
    ~ ! [X0] :
        ( ? [X1] :
            ( big_p(X1)
           => big_q(X0) )
       => ? [X1] :
            ( big_p(X1)
           => big_q(X1) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ~ ! [X0] :
        ( ? [X1] :
            ( big_p(X1)
           => big_q(X0) )
       => ? [X2] :
            ( big_p(X2)
           => big_q(X2) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ? [X0] :
      ( ? [X1] :
          ( ~ big_p(X1)
          | big_q(X0) )
      & ! [X2] :
          ( big_p(X2)
          & ~ big_q(X2) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ? [X0] :
      ( ? [X2] :
          ( ~ big_p(X2)
          | big_q(X0) )
      & ! [X1] :
          ( big_p(X1)
          & ~ big_q(X1) ) ),
    inference(rectify,[],[f4]) ).

fof(f6,plain,
    ( ( ~ big_p(sK1)
      | big_q(sK0) )
    & ! [X1] :
        ( big_p(X1)
        & ~ big_q(X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X2,sK1)],[f5]) ).

fof(f7,plain,
    ( ~ big_p(sK1)
    | big_q(sK0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f8,plain,
    ! [X1] : big_p(X1),
    inference(cnf_transformation,[],[f6]) ).

fof(f9,plain,
    ! [X1] : ~ big_q(X1),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_49,negated_conjecture,
    ! [X0: $i] : ~ big_q(X0),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_50,negated_conjecture,
    ! [X0: $i] : big_p(X0),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_51,negated_conjecture,
    ( big_q(sK0)
    | ~ big_p(sK1) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_53,plain,
    ~ big_q(sK0),
    inference(instantiation,[status(thm)],[c_49]) ).

tcf(c_54,negated_conjecture,
    ~ big_p(sK1),
    inference(global_subsumption_just,[status(thm)],[c_51,c_53,c_51]) ).

tcf(c_56,negated_conjecture,
    ~ big_p(sK1),
    inference(demodulation,[status(thm)],[c_54]) ).

tcf(c_57,negated_conjecture,
    ! [X0: $i] : big_p(X0),
    inference(demodulation,[status(thm)],[c_50]) ).

tcf(c_58,plain,
    $false,
    inference(resolution,[status(thm)],[c_56,c_57]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN372+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/15.60  % Computer : n008.cluster.edu
% 0.11/15.60  % Model    : x86_64 x86_64
% 0.11/15.60  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/15.60  % Memory   : 8046.5625MB
% 0.11/15.60  % OS       : Linux 6.8.0-71-generic
% 0.11/15.60  % CPULimit : 300
% 0.11/15.60  % WCLimit  : 300
% 0.11/15.60  % DateTime : Fri Sep 25 01:01:56 UTC 2026
% 0.11/15.61  % CPUTime  : 
% 0.11/15.61  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/15.65  Running first-order theorem proving
% 0.11/15.65  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/15.66  
% 0.11/15.66  % ======== iProver multi-core TPTP/SMT =========
% 0.11/15.66  
% 0.11/15.66  % Detected problem language: tptp
% 0.11/15.67  % Proving...
% 1.15/16.52  % SZS status Started for theBenchmark.p
% 1.15/16.52  % SZS status Theorem for theBenchmark.p
% 1.15/16.52  
% 1.15/16.52  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.15/16.52  
% 1.15/16.52  % ------  iProver source info
% 1.15/16.52  
% 1.15/16.52  % git: date: 2026-07-19 20:42:38 +0200
% 1.15/16.52  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.15/16.52  % git: non_committed_changes: false
% 1.15/16.52  
% 1.15/16.52  % ------ Parsing...
% 1.15/16.52  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_horn
% 1.15/16.52  % 
% 1.15/16.52  
% 1.15/16.52  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e % 
% 1.15/16.52  
% 1.15/16.52  % ------ Preprocessing...% ------  preprocesses with Option_epr_horn
% 1.15/16.52   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.15/16.52  % ------ Proving...
% 1.15/16.52  % ------ Problem Properties 
% 1.15/16.52  
% 1.15/16.52  % 
% 1.15/16.52  % clauses                               2
% 1.15/16.52  % conjectures                           2
% 1.15/16.52  % EPR                                   2
% 1.15/16.52  % Horn                                  2
% 1.15/16.52  % unary                                 2
% 1.15/16.52  % binary                                0
% 1.15/16.52  % lits                                  2
% 1.15/16.52  % lits eq                               0
% 1.15/16.52  % fd_pure                               0
% 1.15/16.52  % fd_pseudo                             0
% 1.15/16.52  % fd_cond                               0
% 1.15/16.52  % fd_pseudo_cond                        0
% 1.15/16.52  % AC symbols                            0
% 1.15/16.52  
% 1.15/16.52  % ------ Schedule EPR Horn non eq is on
% 1.15/16.52  
% 1.15/16.52  % ------ no equalities: superposition off 
% 1.15/16.52  
% 1.15/16.52  % ------ Option_epr_horn Time Limit: Unbounded
% 1.15/16.52  
% 1.15/16.52  
% 1.15/16.52  % ------ 
% 1.15/16.52  % Current options:
% 1.15/16.52  % ------ 
% 1.15/16.52  
% 1.15/16.52  
% 1.15/16.52  % 
% 1.15/16.52  
% 1.15/16.52  % ------ Proving...
% 1.15/16.52  % 
% 1.15/16.52  
% 1.15/16.52  % SZS status Theorem for theBenchmark.p
% 1.15/16.52  
% 1.15/16.52  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.15/16.52  
% 1.15/16.52  
%------------------------------------------------------------------------------