↑ Up

iProver---3.9.4.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0] :
        ( f(X0)
       => ( h(X0)
          | g(X0) ) )
   => ( ? [X2] :
          ( h(X2)
          & f(X2) )
      | ! [X1] :
          ( f(X1)
         => g(X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish241) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0] :
          ( f(X0)
         => ( h(X0)
            | g(X0) ) )
     => ( ? [X2] :
            ( h(X2)
            & f(X2) )
        | ! [X1] :
            ( f(X1)
           => g(X1) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ! [X0] :
        ( ~ f(X0)
        | h(X0)
        | g(X0) )
    & ! [X2] :
        ( ~ h(X2)
        | ~ f(X2) )
    & ? [X1] :
        ( f(X1)
        & ~ g(X1) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ( ! [X0] :
        ( ~ f(X0)
        | h(X0)
        | g(X0) )
    & ! [X2] :
        ( ~ h(X2)
        | ~ f(X2) )
    & ? [X1] :
        ( f(X1)
        & ~ g(X1) ) ),
    inference(flattening,[],[f3]) ).

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

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

fof(f7,plain,
    ! [X2] :
      ( ~ f(X2)
      | h(X2)
      | g(X2) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f8,plain,
    ! [X1] :
      ( ~ h(X1)
      | ~ f(X1) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f9,plain,
    f(sK0),
    inference(cnf_transformation,[],[f6]) ).

fof(f10,plain,
    ~ g(sK0),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_49,negated_conjecture,
    ~ g(sK0),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_50,negated_conjecture,
    f(sK0),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_51,negated_conjecture,
    ! [X0: $i] :
      ( ~ h(X0)
      | ~ f(X0) ),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_52,negated_conjecture,
    ! [X0: $i] :
      ( h(X0)
      | g(X0)
      | ~ f(X0) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_53,plain,
    ( ~ h(sK0)
    | ~ f(sK0) ),
    inference(instantiation,[status(thm)],[c_51]) ).

tcf(c_54,plain,
    ( h(sK0)
    | g(sK0)
    | ~ f(sK0) ),
    inference(instantiation,[status(thm)],[c_52]) ).

tcf(c_55,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_54,c_53,c_49,c_50]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN407+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.12/15.59  % Computer : n006.cluster.edu
% 0.12/15.59  % Model    : x86_64 x86_64
% 0.12/15.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/15.59  % Memory   : 8046.5625MB
% 0.12/15.59  % OS       : Linux 6.8.0-71-generic
% 0.12/15.59  % CPULimit : 300
% 0.12/15.59  % WCLimit  : 300
% 0.12/15.59  % DateTime : Fri Sep 25 01:05:43 UTC 2026
% 0.12/15.60  % CPUTime  : 
% 0.12/15.60  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/15.63  Running first-order theorem proving
% 0.15/15.63  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.15/15.64  
% 0.15/15.64  % ======== iProver multi-core TPTP/SMT =========
% 0.15/15.64  
% 0.15/15.64  % Detected problem language: tptp
% 0.15/15.66  % Proving...
% 1.19/16.50  % SZS status Started for theBenchmark.p
% 1.19/16.50  % SZS status Theorem for theBenchmark.p
% 1.19/16.50  
% 1.19/16.50  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.19/16.50  
% 1.19/16.50  % ------  iProver source info
% 1.19/16.50  
% 1.19/16.50  % git: date: 2026-07-19 20:42:38 +0200
% 1.19/16.50  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.19/16.50  % git: non_committed_changes: false
% 1.19/16.50  
% 1.19/16.50  % ------ Parsing...
% 1.19/16.50  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_non_horn_non_eq
% 1.19/16.50  % 
% 1.19/16.50  
% 1.19/16.50  % ------ Preprocessing...% 
% 1.19/16.50  
% 1.19/16.50  % SZS status Theorem for theBenchmark.p
% 1.19/16.50  
% 1.19/16.50  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.19/16.50  
% 1.19/16.50  
%------------------------------------------------------------------------------