TSTP Solution File: SYN367+1 by iProver---3.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.6
% Problem  : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python3 prover_driver.py --schedule_mode external --schedule fof_schedule --no_cores 8 --problem_version fof /export/starexec/sandbox2/benchmark/theBenchmark.p 300 --prover /export/starexec/sandbox2/solver/bin/res/iproveropt_no_z3

% Computer : n009.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 : Thu Sep 29 22:27:10 EDT 2022

% Result   : Theorem 1.06s 1.50s
% Output   : CNFRefutation 1.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   22 (   6 unt;   0 def)
%            Number of atoms       :   66 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   71 (  27   ~;  17   |;  22   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   2 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   28 (   3 sgn  16   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0] :
        ( ( big_r(X0)
          & ~ p )
        | ( big_q(X0)
          & p ) )
   => ( ! [X0] : big_r(X0)
      | ! [X0] : big_q(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2118) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0] :
          ( ( big_r(X0)
            & ~ p )
          | ( big_q(X0)
            & p ) )
     => ( ! [X0] : big_r(X0)
        | ! [X0] : big_q(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f3,plain,
    ~ ( ! [X0] :
          ( ( big_r(X0)
            & ~ p )
          | ( big_q(X0)
            & p ) )
     => ( ! [X1] : big_r(X1)
        | ! [X2] : big_q(X2) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ? [X1] : ~ big_r(X1)
    & ? [X2] : ~ big_q(X2)
    & ! [X0] :
        ( ( big_r(X0)
          & ~ p )
        | ( big_q(X0)
          & p ) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ? [X1] : ~ big_r(X1)
    & ? [X2] : ~ big_q(X2)
    & ! [X0] :
        ( ( big_r(X0)
          & ~ p )
        | ( big_q(X0)
          & p ) ) ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ( ? [X0] : ~ big_r(X0)
    & ? [X1] : ~ big_q(X1)
    & ! [X2] :
        ( ( big_r(X2)
          & ~ p )
        | ( big_q(X2)
          & p ) ) ),
    inference(rectify,[],[f5]) ).

fof(f8,plain,
    ( ? [X1] : ~ big_q(X1)
   => ~ big_q(sK1) ),
    introduced(choice_axiom,[]) ).

fof(f7,plain,
    ( ? [X0] : ~ big_r(X0)
   => ~ big_r(sK0) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ( ~ big_r(sK0)
    & ~ big_q(sK1)
    & ! [X2] :
        ( ( big_r(X2)
          & ~ p )
        | ( big_q(X2)
          & p ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).

fof(f14,plain,
    ~ big_q(sK1),
    inference(cnf_transformation,[],[f9]) ).

fof(f13,plain,
    ! [X2] :
      ( big_r(X2)
      | big_q(X2) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f11,plain,
    ! [X2] :
      ( ~ p
      | big_q(X2) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f12,plain,
    ! [X2] :
      ( big_r(X2)
      | p ),
    inference(cnf_transformation,[],[f9]) ).

fof(f15,plain,
    ~ big_r(sK0),
    inference(cnf_transformation,[],[f9]) ).

cnf(c_50,negated_conjecture,
    ~ big_q(sK1),
    inference(cnf_transformation,[],[f14]) ).

cnf(c_51,negated_conjecture,
    ( big_r(X0)
    | big_q(X0) ),
    inference(cnf_transformation,[],[f13]) ).

cnf(c_53,negated_conjecture,
    ( ~ p
    | big_q(X0) ),
    inference(cnf_transformation,[],[f11]) ).

cnf(c_52,negated_conjecture,
    ( big_r(X0)
    | p ),
    inference(cnf_transformation,[],[f12]) ).

cnf(c_55,plain,
    ( big_r(sK0)
    | p ),
    inference(instantiation,[status(thm)],[c_52]) ).

cnf(c_49,negated_conjecture,
    ~ big_r(sK0),
    inference(cnf_transformation,[],[f15]) ).

cnf(c_62,negated_conjecture,
    big_q(X0),
    inference(global_propositional_subsumption,[status(thm)],[c_51,c_53,c_55,c_49]) ).

cnf(c_68,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_50,c_62]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13  % Command  : python3 prover_driver.py --schedule_mode external --schedule fof_schedule --no_cores 8 --problem_version fof /export/starexec/sandbox2/benchmark/theBenchmark.p 300 --prover /export/starexec/sandbox2/solver/bin/res/iproveropt_no_z3
% 0.15/0.34  % Computer : n009.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit : 300
% 0.15/0.34  % WCLimit  : 300
% 0.15/0.34  % DateTime : Mon Sep  5 02:53:35 EDT 2022
% 0.15/0.34  % CPUTime  : 
% 1.06/1.50  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.06/1.50  
% 1.06/1.50  %---------------- iProver v3.6 (pre CASC-J11 2022) ----------------%
% 1.06/1.50  
% 1.06/1.50  ------  iProver source info
% 1.06/1.50  
% 1.06/1.50  git: date: 2022-07-26 19:47:37 +0300
% 1.06/1.50  git: sha1: 69e283425f6c8ae3fb9e67f2058d741e849b12e1
% 1.06/1.50  git: non_committed_changes: false
% 1.06/1.50  git: last_make_outside_of_git: false
% 1.06/1.50  
% 1.06/1.50  ------ Parsing...
% 1.06/1.50  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Option_epr_non_horn_non_eq
% 1.06/1.50  
% 1.06/1.50  
% 1.06/1.50  ------ Preprocessing...
% 1.06/1.50  
% 1.06/1.50  % SZS status Theorem for theBenchmark.p
% 1.06/1.50  
% 1.06/1.50  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.06/1.50  
% 1.06/1.50  ------                               Statistics
% 1.06/1.50  
% 1.06/1.50  ------ Selected
% 1.06/1.50  
% 1.06/1.50  total_time:                             0.03
% 1.06/1.50  
%------------------------------------------------------------------------------