↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n005.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:45:28 PM UTC 2026

% Result   : Theorem 1.11s 1.28s
% Output   : CNFRefutation 1.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (   5 unt;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   82 (  36   ~;  25   |;  15   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    2 (   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    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   41 (   0 sgn  33   !;   8   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [X0,X1] :
      ( ! [X2] : q(f(X2))
     => ? [X3,X4] :
          ( q(X3)
          & ( p(f(X4))
           => ( ( r(X4)
               => ( r(X1)
                  & r(X0) ) )
              & p(X3) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ! [X0,X1] :
        ( ! [X2] : q(f(X2))
       => ? [X3,X4] :
            ( q(X3)
            & ( p(f(X4))
             => ( ( r(X4)
                 => ( r(X1)
                    & r(X0) ) )
                & p(X3) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ? [X0,X1] :
      ( ! [X2] : q(f(X2))
      & ! [X3,X4] :
          ( ~ q(X3)
          | ( p(f(X4))
            & ( ( r(X4)
                & ( ~ r(X1)
                  | ~ r(X0) ) )
              | ~ p(X3) ) ) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ? [X0,X1] :
      ( ! [X4] : q(f(X4))
      & ! [X2,X3] :
          ( ~ q(X2)
          | ( p(f(X3))
            & ( ( r(X3)
                & ( ~ r(X1)
                  | ~ r(X0) ) )
              | ~ p(X2) ) ) ) ),
    inference(rectify,[],[f3]) ).

fof(f5,plain,
    ( ! [X4] : q(f(X4))
    & ! [X2,X3] :
        ( ~ q(X2)
        | ( p(f(X3))
          & ( ( r(X3)
              & ( ~ r(sK1)
                | ~ r(sK0) ) )
            | ~ p(X2) ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f4]) ).

fof(f6,plain,
    ! [X4] : q(f(X4)),
    inference(cnf_transformation,[],[f5]) ).

fof(f7,plain,
    ! [X2,X3] :
      ( ~ q(X2)
      | p(f(X3)) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ! [X2,X3] :
      ( ~ q(X2)
      | r(X3)
      | ~ p(X2) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f9,plain,
    ! [X2] :
      ( ~ q(X2)
      | ~ r(sK1)
      | ~ r(sK0)
      | ~ p(X2) ),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_49,negated_conjecture,
    ! [X0: $i] :
      ( ~ r(sK1)
      | ~ r(sK0)
      | ~ q(X0)
      | ~ p(X0) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_50,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( r(X1)
      | ~ q(X0)
      | ~ p(X0) ),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_51,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( p(f(X1))
      | ~ q(X0) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_52,negated_conjecture,
    ! [X0: $i] : q(f(X0)),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_69,plain,
    ! [X0: $i] :
      ( ~ r(sK1)
      | ~ q(X0)
      | ~ p(X0) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_49,c_50]) ).

tcf(c_74,plain,
    ! [X0: $i] :
      ( ~ q(X0)
      | ~ p(X0) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_69,c_50]) ).

tcf(c_82,plain,
    ! [X0: $i,X1: $i] :
      ( ~ q(X1)
      | ~ q(f(X0)) ),
    inference(resolution,[status(thm)],[c_74,c_51]) ).

tcf(c_84,plain,
    ! [X1: $i] : ~ q(X1),
    inference(global_subsumption_just,[status(thm)],[c_82,c_52,c_82]) ).

tcf(c_85,plain,
    ! [X0: $i] : ~ q(X0),
    inference(renaming,[status(thm)],[c_84]) ).

tcf(c_91,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_52,c_85]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN940+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.37  % Computer : n005.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Fri Sep 25 02:35:48 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.40  Running first-order theorem proving
% 0.12/0.41  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.12/0.42  
% 0.12/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42  
% 0.12/0.42  % Detected problem language: tptp
% 0.12/0.43  % Proving...
% 1.11/1.28  % SZS status Started for theBenchmark.p
% 1.11/1.28  % SZS status Theorem for theBenchmark.p
% 1.11/1.28  
% 1.11/1.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.11/1.28  
% 1.11/1.28  % ------  iProver source info
% 1.11/1.28  
% 1.11/1.28  % git: date: 2026-07-19 20:42:38 +0200
% 1.11/1.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.11/1.28  % git: non_committed_changes: false
% 1.11/1.28  
% 1.11/1.28  % ------ Parsing...
% 1.11/1.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.11/1.28  
% 1.11/1.28  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s% 
% 1.11/1.28  
% 1.11/1.28  % SZS status Theorem for theBenchmark.p
% 1.11/1.28  
% 1.11/1.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.11/1.28  
% 1.11/1.28  
%------------------------------------------------------------------------------