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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : LEO-II---1.7.0
% Problem  : SYO292^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 : 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 17:33:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
thf(tp_cP,type,
    cP: $i > $i > $o ).

thf(tp_sK1_Xx,type,
    sK1_Xx: ( $i > $o ) > $i ).

thf(tp_sK2_SY3,type,
    sK2_SY3: ( $i > $o ) > $i ).

thf(1,conjecture,
    ? [A: $i > $o] :
    ! [Xx: $i,Xy: $i] :
      ( ( ( A @ Xx )
        | ( A @ Xy ) )
     => ( cP @ Xx @ Xy ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE5E) ).

thf(2,negated_conjecture,
    ( ( ? [A: $i > $o] :
        ! [Xx: $i,Xy: $i] :
          ( ( ( A @ Xx )
            | ( A @ Xy ) )
         => ( cP @ Xx @ Xy ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ? [A: $i > $o] :
        ! [Xx: $i,Xy: $i] :
          ( ( ( A @ Xx )
            | ( A @ Xy ) )
         => ( cP @ Xx @ Xy ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ~ ? [A: $i > $o] :
          ! [Xx: $i,Xy: $i] :
            ( ( ( A @ Xx )
              | ( A @ Xy ) )
           => ( cP @ Xx @ Xy ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[3]) ).

thf(5,plain,
    ( ( ! [A: $i > $o] :
          ( ( ( A @ ( sK1_Xx @ A ) )
            | ( A @ ( sK2_SY3 @ A ) ) )
          & ~ ( cP @ ( sK1_Xx @ A ) @ ( sK2_SY3 @ A ) ) ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[4]) ).

thf(6,plain,
    ( ( ! [A: $i > $o] :
          ( ( ( A @ ( sK1_Xx @ A ) )
            | ( A @ ( sK2_SY3 @ A ) ) )
          & ~ ( cP @ ( sK1_Xx @ A ) @ ( sK2_SY3 @ A ) ) ) )
    = $true ),
    inference(copy,[status(thm)],[5]) ).

thf(7,plain,
    ( ( ! [SX0: $i > $o] :
          ~ ( ~ ( ( SX0 @ ( sK1_Xx @ SX0 ) )
                | ( SX0 @ ( sK2_SY3 @ SX0 ) ) )
            | ~ ~ ( cP @ ( sK1_Xx @ SX0 ) @ ( sK2_SY3 @ SX0 ) ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[6]) ).

thf(8,plain,
    ! [SV1: $i > $o] :
      ( ( ~ ( ~ ( ( SV1 @ ( sK1_Xx @ SV1 ) )
                | ( SV1 @ ( sK2_SY3 @ SV1 ) ) )
            | ~ ~ ( cP @ ( sK1_Xx @ SV1 ) @ ( sK2_SY3 @ SV1 ) ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[7]) ).

thf(9,plain,
    ! [SV1: $i > $o] :
      ( ( ~ ( ( SV1 @ ( sK1_Xx @ SV1 ) )
            | ( SV1 @ ( sK2_SY3 @ SV1 ) ) )
        | ~ ~ ( cP @ ( sK1_Xx @ SV1 ) @ ( sK2_SY3 @ SV1 ) ) )
      = $false ),
    inference(extcnf_not_pos,[status(thm)],[8]) ).

thf(10,plain,
    ! [SV1: $i > $o] :
      ( ( ~ ( ( SV1 @ ( sK1_Xx @ SV1 ) )
            | ( SV1 @ ( sK2_SY3 @ SV1 ) ) ) )
      = $false ),
    inference(extcnf_or_neg,[status(thm)],[9]) ).

thf(12,plain,
    ! [SV1: $i > $o] :
      ( ( ( SV1 @ ( sK1_Xx @ SV1 ) )
        | ( SV1 @ ( sK2_SY3 @ SV1 ) ) )
      = $true ),
    inference(extcnf_not_neg,[status(thm)],[10]) ).

thf(14,plain,
    ! [SV1: $i > $o] :
      ( ( ( SV1 @ ( sK1_Xx @ SV1 ) )
        = $true )
      | ( ( SV1 @ ( sK2_SY3 @ SV1 ) )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[12]) ).

thf(17,plain,
    ( ( $false = $true )
    | ( $false = $true ) ),
    inference(prim_subst,[status(thm)],[14:[bind(SV1,$thf( ^ [SV4: $i] : $false ))]]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYO292^5 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jul  9 00:07:44 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  
% 0.13/0.35   No.of.Axioms: 0
% 0.13/0.35  
% 0.13/0.35   Length.of.Defs: 0
% 0.13/0.35  
% 0.13/0.35   Contains.Choice.Funs: false
% 0.13/0.35  (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.13/0.38  ********************************
% 0.13/0.38  *   All subproblems solved!    *
% 0.13/0.38  ********************************
% 0.13/0.38  % SZS status Theorem for /export/starexec/sandbox/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:36,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.38  
% 0.13/0.38  %**** Beginning of derivation protocol ****
% 0.13/0.38  % SZS output start CNFRefutation
% See solution above
% 0.13/0.38  
% 0.13/0.38  %**** End of derivation protocol ****
% 0.13/0.38  %**** no. of clauses in derivation: 15 ****
% 0.13/0.38  %**** clause counter: 36 ****
% 0.13/0.38  
% 0.13/0.38  % SZS status Theorem for /export/starexec/sandbox/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:36,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------