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

View Problem - Process Solution

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

% Computer : n012.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 03:09:34 EDT 2023

% Result   : Theorem 0.83s 1.16s
% Output   : CNFRefutation 0.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   20 (   8 unt;   0 def)
%            Number of atoms       :   62 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   65 (  23   ~;  15   |;  18   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   52 (   6 sgn;  36   !;   6   ?)

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

fof(f2,negated_conjecture,
    ~ ( ( ! [X2,X3] :
            ( q(X2,X3)
           => ! [X4] : r(X4,X3) )
        & ! [X0] :
            ( ? [X1] : r(X0,X1)
           => q(X0,X0) )
        & r(a,b) )
     => ? [X5] :
          ( q(X5,a)
          & r(b,X5) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f3,plain,
    ~ ( ( ! [X0,X1] :
            ( q(X0,X1)
           => ! [X2] : r(X2,X1) )
        & ! [X3] :
            ( ? [X4] : r(X3,X4)
           => q(X3,X3) )
        & r(a,b) )
     => ? [X5] :
          ( q(X5,a)
          & r(b,X5) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ! [X5] :
        ( ~ q(X5,a)
        | ~ r(b,X5) )
    & ! [X0,X1] :
        ( ! [X2] : r(X2,X1)
        | ~ q(X0,X1) )
    & ! [X3] :
        ( q(X3,X3)
        | ! [X4] : ~ r(X3,X4) )
    & r(a,b) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ! [X5] :
        ( ~ q(X5,a)
        | ~ r(b,X5) )
    & ! [X0,X1] :
        ( ! [X2] : r(X2,X1)
        | ~ q(X0,X1) )
    & ! [X3] :
        ( q(X3,X3)
        | ! [X4] : ~ r(X3,X4) )
    & r(a,b) ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ( ! [X0] :
        ( ~ q(X0,a)
        | ~ r(b,X0) )
    & ! [X1,X2] :
        ( ! [X3] : r(X3,X2)
        | ~ q(X1,X2) )
    & ! [X4] :
        ( q(X4,X4)
        | ! [X5] : ~ r(X4,X5) )
    & r(a,b) ),
    inference(rectify,[],[f5]) ).

fof(f7,plain,
    r(a,b),
    inference(cnf_transformation,[],[f6]) ).

fof(f8,plain,
    ! [X4,X5] :
      ( q(X4,X4)
      | ~ r(X4,X5) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f9,plain,
    ! [X2,X3,X1] :
      ( r(X3,X2)
      | ~ q(X1,X2) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f10,plain,
    ! [X0] :
      ( ~ q(X0,a)
      | ~ r(b,X0) ),
    inference(cnf_transformation,[],[f6]) ).

cnf(c_49,negated_conjecture,
    ( ~ q(X0,a)
    | ~ r(b,X0) ),
    inference(cnf_transformation,[],[f10]) ).

cnf(c_50,negated_conjecture,
    ( ~ q(X0,X1)
    | r(X2,X1) ),
    inference(cnf_transformation,[],[f9]) ).

cnf(c_51,negated_conjecture,
    ( ~ r(X0,X1)
    | q(X0,X0) ),
    inference(cnf_transformation,[],[f8]) ).

cnf(c_52,negated_conjecture,
    r(a,b),
    inference(cnf_transformation,[],[f7]) ).

cnf(c_56,plain,
    q(a,a),
    inference(resolution,[status(thm)],[c_51,c_52]) ).

cnf(c_57,plain,
    ~ r(b,a),
    inference(resolution,[status(thm)],[c_56,c_49]) ).

cnf(c_58,plain,
    r(X0,a),
    inference(resolution,[status(thm)],[c_56,c_50]) ).

cnf(c_60,plain,
    q(X0,X0),
    inference(resolution,[status(thm)],[c_58,c_51]) ).

cnf(c_62,plain,
    r(X0,X1),
    inference(resolution,[status(thm)],[c_60,c_50]) ).

cnf(c_64,plain,
    $false,
    inference(resolution,[status(thm)],[c_57,c_62]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN721+1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n012.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Sat Aug 26 18:56:25 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.83/1.16  % SZS status Started for theBenchmark.p
% 0.83/1.16  % SZS status Theorem for theBenchmark.p
% 0.83/1.16  
% 0.83/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.83/1.16  
% 0.83/1.16  ------  iProver source info
% 0.83/1.16  
% 0.83/1.16  git: date: 2023-05-31 18:12:56 +0000
% 0.83/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.83/1.16  git: non_committed_changes: false
% 0.83/1.16  git: last_make_outside_of_git: false
% 0.83/1.16  
% 0.83/1.16  ------ Parsing...
% 0.83/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Option_epr_horn
% 0.83/1.16  
% 0.83/1.16  
% 0.83/1.16  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 0.83/1.16  
% 0.83/1.16  ------ Preprocessing...------  preprocesses with Option_epr_horn
% 0.83/1.16   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.83/1.16  ------ Proving...
% 0.83/1.16  ------ Problem Properties 
% 0.83/1.16  
% 0.83/1.16  
% 0.83/1.16  clauses                                 4
% 0.83/1.16  conjectures                             4
% 0.83/1.16  EPR                                     4
% 0.83/1.16  Horn                                    4
% 0.83/1.16  unary                                   1
% 0.83/1.16  binary                                  3
% 0.83/1.16  lits                                    7
% 0.83/1.16  lits eq                                 0
% 0.83/1.16  fd_pure                                 0
% 0.83/1.16  fd_pseudo                               0
% 0.83/1.16  fd_cond                                 0
% 0.83/1.16  fd_pseudo_cond                          0
% 0.83/1.16  AC symbols                              0
% 0.83/1.16  
% 0.83/1.16  ------ Schedule EPR Horn non eq is on
% 0.83/1.16  
% 0.83/1.16  ------ no equalities: superposition off 
% 0.83/1.16  
% 0.83/1.16  ------ Option_epr_horn Time Limit: Unbounded
% 0.83/1.16  
% 0.83/1.16  
% 0.83/1.16  ------ 
% 0.83/1.16  Current options:
% 0.83/1.16  ------ 
% 0.83/1.16  
% 0.83/1.16  
% 0.83/1.16  
% 0.83/1.16  
% 0.83/1.16  ------ Proving...
% 0.83/1.16  
% 0.83/1.16  
% 0.83/1.16  % SZS status Theorem for theBenchmark.p
% 0.83/1.16  
% 0.83/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.83/1.16  
% 0.83/1.16  
%------------------------------------------------------------------------------