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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : LEO-II---1.7.0
% Problem  : SYN064+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 : n022.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:23:12 EDT 2022

% Result   : Theorem 0.15s 0.38s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (  16 unt;   3 typ;   0 def)
%            Number of atoms       :   55 (  15 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :   68 (  14   ~;   2   |;   2   &;  46   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   4 con; 0-2 aty)
%            Number of variables   :   32 (   0   ^  24   !;   8   ?;  32   :)

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

thf(tp_sK1_Z,type,
    sK1_Z: $i ).

thf(tp_sK2_SY4,type,
    sK2_SY4: $i ).

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

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

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

thf(4,plain,
    ( ( ~ ? [X: $i,Y: $i] :
            ( ( big_p @ X @ Y )
           => ! [Z: $i,W: $i] : ( big_p @ Z @ W ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[3]) ).

thf(5,plain,
    ( ( ! [X: $i,Y: $i] : ( big_p @ X @ Y )
      & ~ ( big_p @ sK1_Z @ sK2_SY4 ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[4]) ).

thf(6,plain,
    ( ( ! [X: $i,Y: $i] : ( big_p @ X @ Y )
      & ~ ( big_p @ sK1_Z @ sK2_SY4 ) )
    = $true ),
    inference(copy,[status(thm)],[5]) ).

thf(7,plain,
    ( ( ~ ( ~ ! [SX0: $i,SX1: $i] : ( big_p @ SX0 @ SX1 )
          | ~ ~ ( big_p @ sK1_Z @ sK2_SY4 ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[6]) ).

thf(8,plain,
    ( ( ~ ! [SX0: $i,SX1: $i] : ( big_p @ SX0 @ SX1 )
      | ~ ~ ( big_p @ sK1_Z @ sK2_SY4 ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[7]) ).

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

thf(10,plain,
    ( ( ~ ~ ( big_p @ sK1_Z @ sK2_SY4 ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[8]) ).

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

thf(12,plain,
    ( ( ~ ( big_p @ sK1_Z @ sK2_SY4 ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[10]) ).

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

thf(14,plain,
    ( ( big_p @ sK1_Z @ sK2_SY4 )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[12]) ).

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

thf(16,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[14,15]) ).

thf(17,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN064+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.14  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.15/0.35  % Computer : n022.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Tue Jul 12 05:08:40 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.15/0.36  
% 0.15/0.36   No.of.Axioms: 0
% 0.15/0.36  
% 0.15/0.36   Length.of.Defs: 0
% 0.15/0.36  
% 0.15/0.36   Contains.Choice.Funs: false
% 0.15/0.36  (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.15/0.38  ********************************
% 0.15/0.38  *   All subproblems solved!    *
% 0.15/0.38  ********************************
% 0.15/0.38  % 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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:16,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.15/0.38  
% 0.15/0.38  %**** Beginning of derivation protocol ****
% 0.15/0.38  % SZS output start CNFRefutation
% See solution above
% 0.15/0.38  
% 0.15/0.38  %**** End of derivation protocol ****
% 0.15/0.38  %**** no. of clauses in derivation: 17 ****
% 0.15/0.38  %**** clause counter: 16 ****
% 0.15/0.38  
% 0.15/0.38  % 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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:16,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------