↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN064+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 : n012.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:03 PM UTC 2026

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

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

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

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

fof(f4,plain,
    ! [X0,X1] :
      ( big_p(X0,X1)
      & ~ big_p(sK0,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0),skolemize(X3,sK1)],[f3]) ).

fof(f5,plain,
    ! [X0,X1] : big_p(X0,X1),
    inference(cnf_transformation,[],[f4]) ).

fof(f6,plain,
    ~ big_p(sK0,sK1),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_49,negated_conjecture,
    ~ big_p(sK0,sK1),
    inference(cnf_transformation,[],[f6]) ).

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

tcf(c_52,negated_conjecture,
    ! [X0_iProver_big_p_1: iProver_big_p_1,X0_iProver_big_p_2: iProver_big_p_2] : big_p(X0_iProver_big_p_1,X0_iProver_big_p_2),
    inference(subtyping,[status(esa)],[c_50]) ).

tcf(c_55,negated_conjecture,
    ! [X0_iProver_big_p_1: iProver_big_p_1,X0_iProver_big_p_2: iProver_big_p_2] : big_p(X0_iProver_big_p_1,X0_iProver_big_p_2),
    inference(demodulation,[status(thm)],[c_52]) ).

tcf(c_56,plain,
    big_p(sK0,sK1),
    inference(instantiation,[status(thm)],[c_55]) ).

tcf(c_57,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_56,c_49]) ).


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