TSTP Solution File: SWW302+1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SWW302+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep  1 00:38:46 EDT 2023

% Result   : Theorem 47.83s 7.75s
% Output   : CNFRefutation 47.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   25 (   7 unt;   0 def)
%            Number of atoms       :   65 (   4 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   71 (  31   ~;  17   |;  10   &)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   44 (   0 sgn;  27   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5241,axiom,
    ! [X281,X282] :
      ( v_Q_H(X281,X282)
     => v_Q(X281,X282) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

fof(f5242,conjecture,
    ! [X281,X282] :
      ( v_P(X281,X282)
     => ! [X283] :
          ( ! [X284] :
              ( v_P(X284,X282)
             => v_Q_H(X284,X283) )
         => v_Q(X281,X283) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

fof(f5243,negated_conjecture,
    ~ ! [X281,X282] :
        ( v_P(X281,X282)
       => ! [X283] :
            ( ! [X284] :
                ( v_P(X284,X282)
               => v_Q_H(X284,X283) )
           => v_Q(X281,X283) ) ),
    inference(negated_conjecture,[],[f5242]) ).

fof(f10150,plain,
    ! [X0,X1] :
      ( v_Q_H(X0,X1)
     => v_Q(X0,X1) ),
    inference(rectify,[],[f5241]) ).

fof(f10151,plain,
    ~ ! [X0,X1] :
        ( v_P(X0,X1)
       => ! [X2] :
            ( ! [X3] :
                ( v_P(X3,X1)
               => v_Q_H(X3,X2) )
           => v_Q(X0,X2) ) ),
    inference(rectify,[],[f5243]) ).

fof(f14462,plain,
    ! [X0,X1] :
      ( v_Q(X0,X1)
      | ~ v_Q_H(X0,X1) ),
    inference(ennf_transformation,[],[f10150]) ).

fof(f14463,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( ~ v_Q(X0,X2)
          & ! [X3] :
              ( v_Q_H(X3,X2)
              | ~ v_P(X3,X1) ) )
      & v_P(X0,X1) ),
    inference(ennf_transformation,[],[f10151]) ).

fof(f16704,plain,
    ( ? [X0,X1] :
        ( ? [X2] :
            ( ~ v_Q(X0,X2)
            & ! [X3] :
                ( v_Q_H(X3,X2)
                | ~ v_P(X3,X1) ) )
        & v_P(X0,X1) )
   => ( ? [X2] :
          ( ~ v_Q(sK592,X2)
          & ! [X3] :
              ( v_Q_H(X3,X2)
              | ~ v_P(X3,sK593) ) )
      & v_P(sK592,sK593) ) ),
    introduced(choice_axiom,[]) ).

fof(f16705,plain,
    ( ? [X2] :
        ( ~ v_Q(sK592,X2)
        & ! [X3] :
            ( v_Q_H(X3,X2)
            | ~ v_P(X3,sK593) ) )
   => ( ~ v_Q(sK592,sK594)
      & ! [X3] :
          ( v_Q_H(X3,sK594)
          | ~ v_P(X3,sK593) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f16706,plain,
    ( ~ v_Q(sK592,sK594)
    & ! [X3] :
        ( v_Q_H(X3,sK594)
        | ~ v_P(X3,sK593) )
    & v_P(sK592,sK593) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK592,sK593,sK594])],[f14463,f16705,f16704]) ).

fof(f23822,plain,
    ! [X0,X1] :
      ( v_Q(X0,X1)
      | ~ v_Q_H(X0,X1) ),
    inference(cnf_transformation,[],[f14462]) ).

fof(f23823,plain,
    v_P(sK592,sK593),
    inference(cnf_transformation,[],[f16706]) ).

fof(f23824,plain,
    ! [X3] :
      ( v_Q_H(X3,sK594)
      | ~ v_P(X3,sK593) ),
    inference(cnf_transformation,[],[f16706]) ).

fof(f23825,plain,
    ~ v_Q(sK592,sK594),
    inference(cnf_transformation,[],[f16706]) ).

cnf(c_6965,plain,
    ( ~ v_Q_H(X0,X1)
    | v_Q(X0,X1) ),
    inference(cnf_transformation,[],[f23822]) ).

cnf(c_6966,negated_conjecture,
    ~ v_Q(sK592,sK594),
    inference(cnf_transformation,[],[f23825]) ).

cnf(c_6967,negated_conjecture,
    ( ~ v_P(X0,sK593)
    | v_Q_H(X0,sK594) ),
    inference(cnf_transformation,[],[f23824]) ).

cnf(c_6968,negated_conjecture,
    v_P(sK592,sK593),
    inference(cnf_transformation,[],[f23823]) ).

cnf(c_16629,plain,
    ( ~ v_Q_H(X0,X1)
    | v_Q(X0,X1) ),
    inference(prop_impl_just,[status(thm)],[c_6965]) ).

cnf(c_16631,plain,
    ( ~ v_P(X0,sK593)
    | v_Q_H(X0,sK594) ),
    inference(prop_impl_just,[status(thm)],[c_6967]) ).

cnf(c_28873,plain,
    ( X0 != sK592
    | X1 != sK594
    | ~ v_Q_H(X0,X1) ),
    inference(resolution_lifted,[status(thm)],[c_16629,c_6966]) ).

cnf(c_28874,plain,
    ~ v_Q_H(sK592,sK594),
    inference(unflattening,[status(thm)],[c_28873]) ).

cnf(c_28879,plain,
    ( X0 != sK592
    | sK594 != sK594
    | ~ v_P(X0,sK593) ),
    inference(resolution_lifted,[status(thm)],[c_16631,c_28874]) ).

cnf(c_28880,plain,
    ~ v_P(sK592,sK593),
    inference(unflattening,[status(thm)],[c_28879]) ).

cnf(c_28881,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_28880,c_6968]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWW302+1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.19/0.35  % Computer : n026.cluster.edu
% 0.19/0.35  % Model    : x86_64 x86_64
% 0.19/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.35  % Memory   : 8042.1875MB
% 0.19/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.19/0.35  % CPULimit : 300
% 0.19/0.35  % WCLimit  : 300
% 0.19/0.35  % DateTime : Sun Aug 27 18:27:49 EDT 2023
% 0.19/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 47.83/7.75  % SZS status Started for theBenchmark.p
% 47.83/7.75  % SZS status Theorem for theBenchmark.p
% 47.83/7.75  
% 47.83/7.75  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 47.83/7.75  
% 47.83/7.75  ------  iProver source info
% 47.83/7.75  
% 47.83/7.75  git: date: 2023-05-31 18:12:56 +0000
% 47.83/7.75  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 47.83/7.75  git: non_committed_changes: false
% 47.83/7.75  git: last_make_outside_of_git: false
% 47.83/7.75  
% 47.83/7.75  ------ Parsing...
% 47.83/7.75  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 47.83/7.75  
% 47.83/7.75  ------ Preprocessing... sf_s  rm: 30 0s  sf_e  pe_s  pe:1:0s pe:2:0s
% 47.83/7.75  
% 47.83/7.75  % SZS status Theorem for theBenchmark.p
% 47.83/7.75  
% 47.83/7.75  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 47.83/7.75  
% 47.83/7.75  
%------------------------------------------------------------------------------