TSTP Solution File: SYO298^5 by LEO-II---1.7.0

View Problem - Process Solution

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

% Computer : n004.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 17:33:14 EDT 2022

% Result   : Theorem 0.18s 0.37s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (  14 unt;   4 typ;   0 def)
%            Number of atoms       :   49 (  13 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :  131 (  25   ~;  10   |;   6   &;  86   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   21 (  21   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   32 (   0   ^  24   !;   8   ?;  32   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_p,type,
    p: $i > $i > $o ).

thf(tp_q,type,
    q: $i > $i > $o ).

thf(tp_sK1_L,type,
    sK1_L: ( $i > $o ) > $i ).

thf(tp_sK2_SY5,type,
    sK2_SY5: $i > ( $i > $o ) > $i ).

thf(1,conjecture,
    ? [A: $i > $o] :
    ! [L: $i] :
    ? [Xy: $i] :
    ! [Xz: $i] :
      ( ( A @ Xz )
     => ( ( p @ Xz @ Xy )
        & ( q @ L @ Xy ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE5B) ).

thf(2,negated_conjecture,
    ( ( ? [A: $i > $o] :
        ! [L: $i] :
        ? [Xy: $i] :
        ! [Xz: $i] :
          ( ( A @ Xz )
         => ( ( p @ Xz @ Xy )
            & ( q @ L @ Xy ) ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ? [A: $i > $o] :
        ! [L: $i] :
        ? [Xy: $i] :
        ! [Xz: $i] :
          ( ( A @ Xz )
         => ( ( p @ Xz @ Xy )
            & ( q @ L @ Xy ) ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ~ ? [A: $i > $o] :
          ! [L: $i] :
          ? [Xy: $i] :
          ! [Xz: $i] :
            ( ( A @ Xz )
           => ( ( p @ Xz @ Xy )
              & ( q @ L @ Xy ) ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[3]) ).

thf(5,plain,
    ( ( ! [A: $i > $o,SY4: $i] :
          ( ( A @ ( sK2_SY5 @ SY4 @ A ) )
          & ( ~ ( p @ ( sK2_SY5 @ SY4 @ A ) @ SY4 )
            | ~ ( q @ ( sK1_L @ A ) @ SY4 ) ) ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[4]) ).

thf(6,plain,
    ( ( ! [A: $i > $o,SY4: $i] :
          ( ( A @ ( sK2_SY5 @ SY4 @ A ) )
          & ( ~ ( p @ ( sK2_SY5 @ SY4 @ A ) @ SY4 )
            | ~ ( q @ ( sK1_L @ A ) @ SY4 ) ) ) )
    = $true ),
    inference(copy,[status(thm)],[5]) ).

thf(7,plain,
    ( ( ! [SX0: $i > $o,SX1: $i] :
          ~ ( ~ ( SX0 @ ( sK2_SY5 @ SX1 @ SX0 ) )
            | ~ ( ~ ( p @ ( sK2_SY5 @ SX1 @ SX0 ) @ SX1 )
                | ~ ( q @ ( sK1_L @ SX0 ) @ SX1 ) ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[6]) ).

thf(8,plain,
    ! [SV1: $i > $o] :
      ( ( ! [SY6: $i] :
            ~ ( ~ ( SV1 @ ( sK2_SY5 @ SY6 @ SV1 ) )
              | ~ ( ~ ( p @ ( sK2_SY5 @ SY6 @ SV1 ) @ SY6 )
                  | ~ ( q @ ( sK1_L @ SV1 ) @ SY6 ) ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[7]) ).

thf(9,plain,
    ! [SV2: $i,SV1: $i > $o] :
      ( ( ~ ( ~ ( SV1 @ ( sK2_SY5 @ SV2 @ SV1 ) )
            | ~ ( ~ ( p @ ( sK2_SY5 @ SV2 @ SV1 ) @ SV2 )
                | ~ ( q @ ( sK1_L @ SV1 ) @ SV2 ) ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[8]) ).

thf(10,plain,
    ! [SV2: $i,SV1: $i > $o] :
      ( ( ~ ( SV1 @ ( sK2_SY5 @ SV2 @ SV1 ) )
        | ~ ( ~ ( p @ ( sK2_SY5 @ SV2 @ SV1 ) @ SV2 )
            | ~ ( q @ ( sK1_L @ SV1 ) @ SV2 ) ) )
      = $false ),
    inference(extcnf_not_pos,[status(thm)],[9]) ).

thf(11,plain,
    ! [SV2: $i,SV1: $i > $o] :
      ( ( ~ ( SV1 @ ( sK2_SY5 @ SV2 @ SV1 ) ) )
      = $false ),
    inference(extcnf_or_neg,[status(thm)],[10]) ).

thf(13,plain,
    ! [SV2: $i,SV1: $i > $o] :
      ( ( SV1 @ ( sK2_SY5 @ SV2 @ SV1 ) )
      = $true ),
    inference(extcnf_not_neg,[status(thm)],[11]) ).

thf(19,plain,
    $false = $true,
    inference(prim_subst,[status(thm)],[13:[bind(SV1,$thf( ^ [SV5: $i] : $false ))]]) ).

thf(37,plain,
    $false = $true,
    inference(sim,[status(thm)],[19]) ).

thf(38,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[37]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYO298^5 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33  % Computer : n004.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 : Sat Jul  9 11:16:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  
% 0.12/0.34   No.of.Axioms: 0
% 0.12/0.34  
% 0.12/0.34   Length.of.Defs: 0
% 0.12/0.34  
% 0.12/0.34   Contains.Choice.Funs: false
% 0.12/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:25,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.18/0.37  
% 0.18/0.37  ********************************
% 0.18/0.37  *   All subproblems solved!    *
% 0.18/0.37  ********************************
% 0.18/0.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:37,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.18/0.37  
% 0.18/0.37  %**** Beginning of derivation protocol ****
% 0.18/0.37  % SZS output start CNFRefutation
% See solution above
% 0.18/0.37  
% 0.18/0.37  %**** End of derivation protocol ****
% 0.18/0.37  %**** no. of clauses in derivation: 15 ****
% 0.18/0.37  %**** clause counter: 37 ****
% 0.18/0.37  
% 0.18/0.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:37,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------