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

% Computer : n020.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:30:55 EDT 2022

% Result   : Theorem 0.11s 0.27s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (  13 unt;   2 typ;   0 def)
%            Number of atoms       :   41 (  12 equ;   0 cnn)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   22 (   4   ~;   0   |;   0   &;  15   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    1 (   1   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   2 usr;   3 con; 0-2 aty)
%            Number of variables   :   13 (   0   ^   4   !;   9   ?;  13   :)

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

thf(tp_sK1_X,type,
    sK1_X: $i ).

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

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

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

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

thf(5,plain,
    ( ( ? [Y: $i] : ( p @ Y ) )
    = $false ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(6,plain,
    ( ( ~ ? [Y: $i] : ( p @ Y ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[5]) ).

thf(7,plain,
    ( ( ! [Y: $i] :
          ~ ( p @ Y ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[6]) ).

thf(8,plain,
    ( ( p @ sK1_X )
    = $true ),
    inference(extcnf_combined,[status(esa)],[4]) ).

thf(9,plain,
    ( ( p @ sK1_X )
    = $true ),
    inference(copy,[status(thm)],[8]) ).

thf(10,plain,
    ( ( ! [Y: $i] :
          ~ ( p @ Y ) )
    = $true ),
    inference(copy,[status(thm)],[7]) ).

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

thf(12,plain,
    ! [SV1: $i] :
      ( ( p @ SV1 )
      = $false ),
    inference(extcnf_not_pos,[status(thm)],[11]) ).

thf(13,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[9,12]) ).

thf(14,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.07  % Problem  : SYN974+1 : TPTP v8.1.0. Released v3.1.0.
% 0.01/0.07  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.07/0.26  % Computer : n020.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit : 300
% 0.07/0.26  % WCLimit  : 600
% 0.07/0.26  % DateTime : Tue Jul 12 06:26:27 EDT 2022
% 0.07/0.26  % CPUTime  : 
% 0.07/0.26  
% 0.07/0.26   No.of.Axioms: 0
% 0.07/0.26  
% 0.07/0.26   Length.of.Defs: 0
% 0.07/0.26  
% 0.07/0.26   Contains.Choice.Funs: false
% 0.07/0.26  (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.11/0.27  ********************************
% 0.11/0.27  *   All subproblems solved!    *
% 0.11/0.27  ********************************
% 0.11/0.27  % 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:13,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.11/0.27  
% 0.11/0.27  %**** Beginning of derivation protocol ****
% 0.11/0.27  % SZS output start CNFRefutation
% See solution above
% 0.11/0.27  
% 0.11/0.27  %**** End of derivation protocol ****
% 0.11/0.27  %**** no. of clauses in derivation: 14 ****
% 0.11/0.27  %**** clause counter: 13 ****
% 0.11/0.27  
% 0.11/0.27  % 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:13,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------