↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n011.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:01 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ? [X0] :
      ( ~ big_g(X0)
      & big_f(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_1) ).

fof(f2,axiom,
    ! [X0] :
      ( big_f(X0)
     => big_h(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_2) ).

fof(f3,axiom,
    ! [X0] :
      ( ( big_i(X0)
        & big_j(X0) )
     => big_f(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_3) ).

fof(f4,axiom,
    ( ? [X0] :
        ( ~ big_g(X0)
        & big_h(X0) )
   => ! [X1] :
        ( big_i(X1)
       => ~ big_h(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_4) ).

fof(f5,conjecture,
    ! [X0] :
      ( big_j(X0)
     => ~ big_i(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27) ).

fof(f6,negated_conjecture,
    ~ ! [X0] :
        ( big_j(X0)
       => ~ big_i(X0) ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

fof(f7,plain,
    ! [X0] :
      ( ~ big_f(X0)
      | big_h(X0) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f8,plain,
    ! [X0] :
      ( ~ big_i(X0)
      | ~ big_j(X0)
      | big_f(X0) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f9,plain,
    ! [X0] :
      ( ~ big_i(X0)
      | ~ big_j(X0)
      | big_f(X0) ),
    inference(flattening,[],[f8]) ).

fof(f10,plain,
    ( ! [X0] :
        ( big_g(X0)
        | ~ big_h(X0) )
    | ! [X1] :
        ( ~ big_i(X1)
        | ~ big_h(X1) ) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f11,plain,
    ? [X0] :
      ( big_j(X0)
      & big_i(X0) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f12,plain,
    ( ~ big_g(sK0)
    & big_f(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f1]) ).

fof(f13,plain,
    ( ! [X1] :
        ( big_g(X1)
        | ~ big_h(X1) )
    | ! [X0] :
        ( ~ big_i(X0)
        | ~ big_h(X0) ) ),
    inference(rectify,[],[f10]) ).

fof(f14,plain,
    ( big_j(sK1)
    & big_i(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f11]) ).

fof(f15,plain,
    ~ big_g(sK0),
    inference(cnf_transformation,[],[f12]) ).

fof(f16,plain,
    big_f(sK0),
    inference(cnf_transformation,[],[f12]) ).

fof(f17,plain,
    ! [X0] :
      ( ~ big_f(X0)
      | big_h(X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f18,plain,
    ! [X0] :
      ( ~ big_i(X0)
      | ~ big_j(X0)
      | big_f(X0) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( big_g(X1)
      | ~ big_h(X1)
      | ~ big_i(X0)
      | ~ big_h(X0) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f20,plain,
    big_j(sK1),
    inference(cnf_transformation,[],[f14]) ).

fof(f21,plain,
    big_i(sK1),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_49,plain,
    big_f(sK0),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_50,plain,
    ~ big_g(sK0),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_51,plain,
    ! [X0: $i] :
      ( big_h(X0)
      | ~ big_f(X0) ),
    inference(cnf_transformation,[],[f17]) ).

tcf(c_52,plain,
    ! [X0: $i] :
      ( big_f(X0)
      | ~ big_i(X0)
      | ~ big_j(X0) ),
    inference(cnf_transformation,[],[f18]) ).

tcf(c_53,plain,
    ! [X0: $i,X1: $i] :
      ( big_g(X1)
      | ~ big_i(X0)
      | ~ big_h(X1)
      | ~ big_h(X0) ),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_54,negated_conjecture,
    big_i(sK1),
    inference(cnf_transformation,[],[f21]) ).

tcf(c_55,negated_conjecture,
    big_j(sK1),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_56,plain,
    ( big_h(sK0)
    | ~ big_f(sK0) ),
    inference(instantiation,[status(thm)],[c_51]) ).

tcf(c_58,plain,
    ! [X0: $i] :
      ( ~ iPr_def_10
      | big_g(X0)
      | ~ big_h(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_53]) ).

tcf(c_59,plain,
    ! [X0: $i] :
      ( ~ iPr_def_11
      | ~ big_h(X0)
      | ~ big_i(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_53]) ).

tcf(c_60,plain,
    ( iPr_def_11
    | iPr_def_10 ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_53]) ).

tcf(c_63,plain,
    ( big_g(sK0)
    | ~ iPr_def_10
    | ~ big_h(sK0) ),
    inference(instantiation,[status(thm)],[c_58]) ).

tcf(c_65,plain,
    ( ~ iPr_def_11
    | ~ big_i(sK1)
    | ~ big_h(sK1) ),
    inference(instantiation,[status(thm)],[c_59]) ).

tcf(c_66,plain,
    ( big_h(sK1)
    | ~ big_f(sK1) ),
    inference(instantiation,[status(thm)],[c_51]) ).

tcf(c_67,plain,
    ( big_f(sK1)
    | ~ big_i(sK1)
    | ~ big_j(sK1) ),
    inference(instantiation,[status(thm)],[c_52]) ).

tcf(c_68,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_67,c_66,c_65,c_63,c_60,c_56,c_50,c_49,c_54,c_55]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN057+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35  % Computer : n011.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Thu Sep 24 23:58:28 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39  Running first-order theorem proving
% 0.13/0.39  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.40  
% 0.13/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40  
% 0.13/0.40  % Detected problem language: tptp
% 0.13/0.42  % Proving...
% 1.17/1.26  % SZS status Started for theBenchmark.p
% 1.17/1.26  % SZS status Theorem for theBenchmark.p
% 1.17/1.26  
% 1.17/1.26  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.17/1.26  
% 1.17/1.26  % ------  iProver source info
% 1.17/1.26  
% 1.17/1.26  % git: date: 2026-07-19 20:42:38 +0200
% 1.17/1.26  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.17/1.26  % git: non_committed_changes: false
% 1.17/1.26  
% 1.17/1.26  % ------ Parsing...
% 1.17/1.26  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_horn
% 1.17/1.26  % 
% 1.17/1.26  
% 1.17/1.26  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e % 
% 1.17/1.26  
% 1.17/1.26  % ------ Preprocessing...% ------  preprocesses with Option_epr_horn
% 1.17/1.26   gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.17/1.26  % ------ Proving...
% 1.17/1.26  % ------ Problem Properties 
% 1.17/1.26  
% 1.17/1.26  % 
% 1.17/1.26  % clauses                               9
% 1.17/1.26  % conjectures                           2
% 1.17/1.26  % EPR                                   9
% 1.17/1.26  % Horn                                  8
% 1.17/1.26  % unary                                 4
% 1.17/1.26  % binary                                2
% 1.17/1.26  % lits                                  17
% 1.17/1.26  % lits eq                               0
% 1.17/1.26  % fd_pure                               0
% 1.17/1.26  % fd_pseudo                             0
% 1.17/1.26  % fd_cond                               0
% 1.17/1.26  % fd_pseudo_cond                        0
% 1.17/1.26  % AC symbols                            0
% 1.17/1.26  
% 1.17/1.26  % ------ Schedule EPR non Horn non eq is on
% 1.17/1.26  
% 1.17/1.26  % ------ no equalities: superposition off 
% 1.17/1.26  
% 1.17/1.26  % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.17/1.26  
% 1.17/1.26  
% 1.17/1.26  % ------ 
% 1.17/1.26  % Current options:
% 1.17/1.26  % ------ 
% 1.17/1.26  
% 1.17/1.26  
% 1.17/1.26  % 
% 1.17/1.26  
% 1.17/1.26  % ------ Proving...
% 1.17/1.26  % 
% 1.17/1.26  
% 1.17/1.26  % SZS status Theorem for theBenchmark.p
% 1.17/1.26  
% 1.17/1.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.17/1.26  
% 1.17/1.26  
%------------------------------------------------------------------------------