↑ Up

iProver---3.9.4.THM-CRf.s

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

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

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

fof(f2,axiom,
    ? [X0] :
      ( big_f(X0)
      & big_i(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31_2) ).

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

fof(f4,conjecture,
    ? [X0] :
      ( big_j(X0)
      & big_i(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31) ).

fof(f5,negated_conjecture,
    ~ ? [X0] :
        ( big_j(X0)
        & big_i(X0) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f6,plain,
    ~ ? [X0] :
        ( big_h(X0)
        & big_f(X0) ),
    inference(pure_predicate_removal,[],[f1]) ).

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

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

fof(f9,plain,
    ! [X0] :
      ( ~ big_j(X0)
      | ~ big_i(X0) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f10,plain,
    ( big_f(sK0)
    & big_i(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f2]) ).

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

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

fof(f13,plain,
    big_i(sK0),
    inference(cnf_transformation,[],[f10]) ).

fof(f14,plain,
    ! [X0] :
      ( big_h(X0)
      | big_j(X0) ),
    inference(cnf_transformation,[],[f8]) ).

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

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

tcf(c_50,plain,
    big_i(sK0),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_51,plain,
    big_f(sK0),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_52,plain,
    ! [X0: $i] :
      ( big_j(X0)
      | big_h(X0) ),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_53,negated_conjecture,
    ! [X0: $i] :
      ( ~ big_j(X0)
      | ~ big_i(X0) ),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_54,plain,
    ( big_j(sK0)
    | big_h(sK0) ),
    inference(instantiation,[status(thm)],[c_52]) ).

tcf(c_55,plain,
    ( ~ big_j(sK0)
    | ~ big_i(sK0) ),
    inference(instantiation,[status(thm)],[c_53]) ).

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

tcf(c_57,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_56,c_55,c_54,c_50,c_51]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SYN061+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.31  % Computer : n012.cluster.edu
% 0.04/0.31  % Model    : x86_64 x86_64
% 0.04/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31  % Memory   : 8046.5625MB
% 0.04/0.31  % OS       : Linux 6.8.0-71-generic
% 0.04/0.31  % CPULimit : 300
% 0.04/0.31  % WCLimit  : 300
% 0.04/0.31  % DateTime : Fri Sep 25 00:00:20 UTC 2026
% 0.04/0.31  % CPUTime  : 
% 0.04/0.31  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.04/0.33  Running first-order theorem proving
% 0.04/0.33  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.07/0.33  
% 0.07/0.33  % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.33  
% 0.07/0.33  % Detected problem language: tptp
% 0.07/0.34  % 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_non_horn_non_eq
% 0.64/1.06  % 
% 0.64/1.06  
% 0.64/1.06  % ------ Preprocessing...% 
% 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.07  
% 0.64/1.07  
%------------------------------------------------------------------------------