TSTP Solution File: SYN379+1 by LEO-II---1.7.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : LEO-II---1.7.0
% Problem  : SYN379+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s

% Computer : n024.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  : 600s
% DateTime : Thu Jul 21 08:25:45 EDT 2022

% Result   : Theorem 0.19s 0.37s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   32 (  29 unt;   2 typ;   0 def)
%            Number of atoms       :  110 (  28 equ;   0 cnn)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :  183 (  45   ~;   7   |;   9   &; 114   @)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   2 usr;   2 con; 0-3 aty)
%            Number of variables   :   87 (   0   ^  82   !;   5   ?;  87   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_big_p,type,
    big_p: $i > $o ).

thf(tp_big_q,type,
    big_q: $i > $i > $i > $o ).

thf(1,conjecture,
    ( ! [X: $i] : ( big_p @ X )
   => ? [Y: $i] :
        ( ! [X: $i,Z: $i] : ( big_q @ X @ Y @ Z )
       => ~ ! [Z: $i] :
              ( ( big_p @ Z )
              & ~ ( big_q @ Y @ Y @ Z ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2131) ).

thf(2,negated_conjecture,
    ( ( ! [X: $i] : ( big_p @ X )
     => ? [Y: $i] :
          ( ! [X: $i,Z: $i] : ( big_q @ X @ Y @ Z )
         => ~ ! [Z: $i] :
                ( ( big_p @ Z )
                & ~ ( big_q @ Y @ Y @ Z ) ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ! [X: $i] : ( big_p @ X )
     => ? [Y: $i] :
          ( ! [X: $i,Z: $i] : ( big_q @ X @ Y @ Z )
         => ~ ! [Z: $i] :
                ( ( big_p @ Z )
                & ~ ( big_q @ Y @ Y @ Z ) ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ! [X: $i] : ( big_p @ X ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(5,plain,
    ( ( ? [Y: $i] :
          ( ! [X: $i,Z: $i] : ( big_q @ X @ Y @ Z )
         => ~ ! [Z: $i] :
                ( ( big_p @ Z )
                & ~ ( big_q @ Y @ Y @ Z ) ) ) )
    = $false ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(6,plain,
    ( ( ~ ? [Y: $i] :
            ( ! [X: $i,Z: $i] : ( big_q @ X @ Y @ Z )
           => ~ ! [Z: $i] :
                  ( ( big_p @ Z )
                  & ~ ( big_q @ Y @ Y @ Z ) ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[5]) ).

thf(7,plain,
    ( ( ! [Y: $i,X: $i,Z: $i] : ( big_q @ X @ Y @ Z )
      & ! [Z: $i] : ( big_p @ Z )
      & ! [Y: $i,Z: $i] :
          ~ ( big_q @ Y @ Y @ Z ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[6]) ).

thf(8,plain,
    ( ( ! [X: $i] : ( big_p @ X ) )
    = $true ),
    inference(copy,[status(thm)],[4]) ).

thf(9,plain,
    ( ( ! [Y: $i,X: $i,Z: $i] : ( big_q @ X @ Y @ Z )
      & ! [Z: $i] : ( big_p @ Z )
      & ! [Y: $i,Z: $i] :
          ~ ( big_q @ Y @ Y @ Z ) )
    = $true ),
    inference(copy,[status(thm)],[7]) ).

thf(10,plain,
    ( ( ~ ( ~ ! [SX0: $i,SX1: $i,SX2: $i] : ( big_q @ SX1 @ SX0 @ SX2 )
          | ~ ~ ( ~ ! [SX0: $i] : ( big_p @ SX0 )
                | ~ ! [SX0: $i,SX1: $i] :
                      ~ ( big_q @ SX0 @ SX0 @ SX1 ) ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[9]) ).

thf(11,plain,
    ! [SV1: $i] :
      ( ( big_p @ SV1 )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[8]) ).

thf(12,plain,
    ( ( ~ ! [SX0: $i,SX1: $i,SX2: $i] : ( big_q @ SX1 @ SX0 @ SX2 )
      | ~ ~ ( ~ ! [SX0: $i] : ( big_p @ SX0 )
            | ~ ! [SX0: $i,SX1: $i] :
                  ~ ( big_q @ SX0 @ SX0 @ SX1 ) ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[10]) ).

thf(13,plain,
    ( ( ~ ! [SX0: $i,SX1: $i,SX2: $i] : ( big_q @ SX1 @ SX0 @ SX2 ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[12]) ).

thf(14,plain,
    ( ( ~ ~ ( ~ ! [SX0: $i] : ( big_p @ SX0 )
            | ~ ! [SX0: $i,SX1: $i] :
                  ~ ( big_q @ SX0 @ SX0 @ SX1 ) ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[12]) ).

thf(15,plain,
    ( ( ! [SX0: $i,SX1: $i,SX2: $i] : ( big_q @ SX1 @ SX0 @ SX2 ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[13]) ).

thf(16,plain,
    ( ( ~ ( ~ ! [SX0: $i] : ( big_p @ SX0 )
          | ~ ! [SX0: $i,SX1: $i] :
                ~ ( big_q @ SX0 @ SX0 @ SX1 ) ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[14]) ).

thf(17,plain,
    ! [SV2: $i] :
      ( ( ! [SY5: $i,SY6: $i] : ( big_q @ SY5 @ SV2 @ SY6 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[15]) ).

thf(18,plain,
    ( ( ~ ! [SX0: $i] : ( big_p @ SX0 )
      | ~ ! [SX0: $i,SX1: $i] :
            ~ ( big_q @ SX0 @ SX0 @ SX1 ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[16]) ).

thf(19,plain,
    ! [SV2: $i,SV3: $i] :
      ( ( ! [SY7: $i] : ( big_q @ SV3 @ SV2 @ SY7 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[17]) ).

thf(20,plain,
    ( ( ~ ! [SX0: $i] : ( big_p @ SX0 ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[18]) ).

thf(21,plain,
    ( ( ~ ! [SX0: $i,SX1: $i] :
            ~ ( big_q @ SX0 @ SX0 @ SX1 ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[18]) ).

thf(22,plain,
    ! [SV4: $i,SV2: $i,SV3: $i] :
      ( ( big_q @ SV3 @ SV2 @ SV4 )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[19]) ).

thf(23,plain,
    ( ( ! [SX0: $i] : ( big_p @ SX0 ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[20]) ).

thf(24,plain,
    ( ( ! [SX0: $i,SX1: $i] :
          ~ ( big_q @ SX0 @ SX0 @ SX1 ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[21]) ).

thf(25,plain,
    ! [SV5: $i] :
      ( ( big_p @ SV5 )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[23]) ).

thf(26,plain,
    ! [SV6: $i] :
      ( ( ! [SY8: $i] :
            ~ ( big_q @ SV6 @ SV6 @ SY8 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[24]) ).

thf(27,plain,
    ! [SV7: $i,SV6: $i] :
      ( ( ~ ( big_q @ SV6 @ SV6 @ SV7 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[26]) ).

thf(28,plain,
    ! [SV7: $i,SV6: $i] :
      ( ( big_q @ SV6 @ SV6 @ SV7 )
      = $false ),
    inference(extcnf_not_pos,[status(thm)],[27]) ).

thf(29,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[11,28,25,22]) ).

thf(30,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12  % Problem  : SYN379+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jul 12 03:55:13 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.34  
% 0.19/0.34   No.of.Axioms: 0
% 0.19/0.34  
% 0.19/0.34   Length.of.Defs: 0
% 0.19/0.34  
% 0.19/0.34   Contains.Choice.Funs: false
% 0.19/0.34  (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.19/0.37  
% 0.19/0.37  ********************************
% 0.19/0.37  *   All subproblems solved!    *
% 0.19/0.37  ********************************
% 0.19/0.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:29,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.19/0.37  
% 0.19/0.37  %**** Beginning of derivation protocol ****
% 0.19/0.37  % SZS output start CNFRefutation
% See solution above
% 0.19/0.37  
% 0.19/0.37  %**** End of derivation protocol ****
% 0.19/0.37  %**** no. of clauses in derivation: 30 ****
% 0.19/0.37  %**** clause counter: 29 ****
% 0.19/0.37  
% 0.19/0.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:29,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------