↑ Up

iProver---3.9.4.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ( ( ( big_h(X1,X0)
            & big_f(X1) )
         => big_g(X1) )
        & big_f(X0) )
     => big_g(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_1) ).

fof(f2,axiom,
    ( ? [X0] :
        ( ~ big_g(X0)
        & big_f(X0) )
   => ? [X1] :
        ( ! [X2] :
            ( ( ~ big_g(X2)
              & big_f(X2) )
           => big_j(X1,X2) )
        & ~ big_g(X1)
        & big_f(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_2) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( ( big_h(X0,X1)
        & big_f(X1)
        & big_f(X0) )
     => ~ big_j(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_3) ).

fof(f4,conjecture,
    ! [X0] :
      ( big_f(X0)
     => big_g(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46) ).

fof(f5,negated_conjecture,
    ~ ! [X0] :
        ( big_f(X0)
       => big_g(X0) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f6,plain,
    ! [X0,X1] :
      ( ( big_h(X1,X0)
        & big_f(X1)
        & ~ big_g(X1) )
      | ~ big_f(X0)
      | big_g(X0) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f7,plain,
    ! [X0,X1] :
      ( ( big_h(X1,X0)
        & big_f(X1)
        & ~ big_g(X1) )
      | ~ big_f(X0)
      | big_g(X0) ),
    inference(flattening,[],[f6]) ).

fof(f8,plain,
    ( ! [X0] :
        ( big_g(X0)
        | ~ big_f(X0) )
    | ? [X1] :
        ( ! [X2] :
            ( big_g(X2)
            | ~ big_f(X2)
            | big_j(X1,X2) )
        & ~ big_g(X1)
        & big_f(X1) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f9,plain,
    ( ! [X0] :
        ( big_g(X0)
        | ~ big_f(X0) )
    | ? [X1] :
        ( ! [X2] :
            ( big_g(X2)
            | ~ big_f(X2)
            | big_j(X1,X2) )
        & ~ big_g(X1)
        & big_f(X1) ) ),
    inference(flattening,[],[f8]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( ~ big_h(X0,X1)
      | ~ big_f(X1)
      | ~ big_f(X0)
      | ~ big_j(X1,X0) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ big_h(X0,X1)
      | ~ big_f(X1)
      | ~ big_f(X0)
      | ~ big_j(X1,X0) ),
    inference(flattening,[],[f10]) ).

fof(f12,plain,
    ? [X0] :
      ( big_f(X0)
      & ~ big_g(X0) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f13,plain,
    ( ! [X2] :
        ( big_g(X2)
        | ~ big_f(X2) )
    | ? [X0] :
        ( ! [X1] :
            ( big_g(X1)
            | ~ big_f(X1)
            | big_j(X0,X1) )
        & ~ big_g(X0)
        & big_f(X0) ) ),
    inference(rectify,[],[f9]) ).

fof(f14,plain,
    ( ! [X2] :
        ( big_g(X2)
        | ~ big_f(X2) )
    | ( ! [X1] :
          ( big_g(X1)
          | ~ big_f(X1)
          | big_j(sK0,X1) )
      & ~ big_g(sK0)
      & big_f(sK0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f13]) ).

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

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

fof(f19,plain,
    ! [X2,X1] :
      ( big_g(X2)
      | ~ big_f(X2)
      | big_g(X1)
      | ~ big_f(X1)
      | big_j(sK0,X1) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f20,plain,
    ! [X2] :
      ( big_g(X2)
      | ~ big_f(X2)
      | ~ big_g(sK0) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f21,plain,
    ! [X2] :
      ( big_g(X2)
      | ~ big_f(X2)
      | big_f(sK0) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ~ big_h(X0,X1)
      | ~ big_f(X1)
      | ~ big_f(X0)
      | ~ big_j(X1,X0) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f23,plain,
    big_f(sK1),
    inference(cnf_transformation,[],[f15]) ).

fof(f24,plain,
    ~ big_g(sK1),
    inference(cnf_transformation,[],[f15]) ).

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

tcf(c_52,plain,
    ! [X0: $i] :
      ( big_f(sK0)
      | big_g(X0)
      | ~ big_f(X0) ),
    inference(cnf_transformation,[],[f21]) ).

tcf(c_53,plain,
    ! [X0: $i] :
      ( big_g(X0)
      | ~ big_g(sK0)
      | ~ big_f(X0) ),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_54,plain,
    ! [X0: $i,X1: $i] :
      ( big_g(X1)
      | big_g(X0)
      | big_j(sK0,X0)
      | ~ big_f(X1)
      | ~ big_f(X0) ),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_55,plain,
    ! [X0: $i,X1: $i] :
      ( ~ big_f(X1)
      | ~ big_f(X0)
      | ~ big_j(X1,X0)
      | ~ big_h(X0,X1) ),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_56,negated_conjecture,
    ~ big_g(sK1),
    inference(cnf_transformation,[],[f24]) ).

tcf(c_57,negated_conjecture,
    big_f(sK1),
    inference(cnf_transformation,[],[f23]) ).

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

tcf(c_59,plain,
    ( big_g(sK0)
    | big_j(sK0,sK0)
    | ~ big_f(sK0) ),
    inference(instantiation,[status(thm)],[c_54]) ).

tcf(c_60,plain,
    ( ~ big_f(sK0)
    | ~ big_j(sK0,sK0)
    | ~ big_h(sK0,sK0) ),
    inference(instantiation,[status(thm)],[c_55]) ).

tcf(c_61,plain,
    ! [X0: $i] :
      ( ~ big_f(X0)
      | big_g(X0) ),
    inference(global_subsumption_just,[status(thm)],[c_52,c_52,c_53,c_58,c_59,c_60]) ).

tcf(c_62,plain,
    ! [X0: $i] :
      ( big_g(X0)
      | ~ big_f(X0) ),
    inference(renaming,[status(thm)],[c_61]) ).

tcf(c_70,plain,
    ! [X0: $i] :
      ( ~ big_f(X0)
      | big_g(X0) ),
    inference(global_subsumption_just,[status(thm)],[c_54,c_62]) ).

tcf(c_71,plain,
    ! [X0: $i] :
      ( big_g(X0)
      | ~ big_f(X0) ),
    inference(renaming,[status(thm)],[c_70]) ).

tcf(c_88,plain,
    ~ big_f(sK1),
    inference(resolution,[status(thm)],[c_71,c_56]) ).

tcf(c_89,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_88,c_57]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN070+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37  % Computer : n007.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 00:01:37 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  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.43  
% 0.11/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43  
% 0.11/0.43  % Detected problem language: tptp
% 0.11/0.44  % Proving...
% 0.45/1.30  % SZS status Started for theBenchmark.p
% 0.45/1.30  % SZS status Theorem for theBenchmark.p
% 0.45/1.30  
% 0.45/1.30  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.45/1.30  
% 0.45/1.30  % ------  iProver source info
% 0.45/1.30  
% 0.45/1.30  % git: date: 2026-07-19 20:42:38 +0200
% 0.45/1.30  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.45/1.30  % git: non_committed_changes: false
% 0.45/1.30  
% 0.45/1.30  % ------ Parsing...
% 0.45/1.30  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_non_horn_non_eq
% 0.45/1.30  % 
% 0.45/1.30  
% 0.45/1.30  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  pe_s % 
% 0.45/1.30  
% 0.45/1.30  % SZS status Theorem for theBenchmark.p
% 0.45/1.30  
% 0.45/1.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.30  
% 0.45/1.30  
%------------------------------------------------------------------------------