↑ Up

LEO-II---2.3.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LEO-II---2.3.1
% Problem  : SET014^4 : TPTP v9.3.1. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Oct  7 10:38:53 AM UTC 2026

% Result   : Theorem 0.11s 0.18s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   46 (  40 unt;   0 typ;  14 def)
%            Number of atoms       :  179 (  53 equ;   0 cnn)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :  208 (  27   ~;  28   |;  14   &; 116   @)
%                                         (   0 <=>;  23  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   31 (  31   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   21 (  18 usr;   3 con; 0-3 aty)
%            Number of variables   :   73 (  32   ^;  39   !;   2   ?;  73   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_complement,type,
    complement: ( $i > $o ) > $i > $o ).

thf(tp_disjoint,type,
    disjoint: ( $i > $o ) > ( $i > $o ) > $o ).

thf(tp_emptyset,type,
    emptyset: $i > $o ).

thf(tp_excl_union,type,
    excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(tp_in,type,
    in: $i > ( $i > $o ) > $o ).

thf(tp_intersection,type,
    intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(tp_is_a,type,
    is_a: $i > ( $i > $o ) > $o ).

thf(tp_meets,type,
    meets: ( $i > $o ) > ( $i > $o ) > $o ).

thf(tp_misses,type,
    misses: ( $i > $o ) > ( $i > $o ) > $o ).

thf(tp_sK1_SY0,type,
    sK1_SY0: $i > $o ).

thf(tp_sK2_SY21,type,
    sK2_SY21: $i > $o ).

thf(tp_sK3_SY26,type,
    sK3_SY26: $i > $o ).

thf(tp_sK4_SY32,type,
    sK4_SY32: $i ).

thf(tp_setminus,type,
    setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(tp_singleton,type,
    singleton: $i > $i > $o ).

thf(tp_subset,type,
    subset: ( $i > $o ) > ( $i > $o ) > $o ).

thf(tp_union,type,
    union: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(tp_unord_pair,type,
    unord_pair: $i > $i > $i > $o ).

thf(complement,definition,
    ( complement
    = ( ^ [X: $i > $o,U: $i] :
          ~ ( X @ U ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement) ).

thf(disjoint,definition,
    ( disjoint
    = ( ^ [X: $i > $o,Y: $i > $o] :
          ( ( intersection @ X @ Y )
          = emptyset ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint) ).

thf(emptyset,definition,
    ( emptyset
    = ( ^ [X: $i] : $false ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyset) ).

thf(excl_union,definition,
    ( excl_union
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( ( X @ U )
            & ~ ( Y @ U ) )
          | ( ~ ( X @ U )
            & ( Y @ U ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',excl_union) ).

thf(in,definition,
    ( in
    = ( ^ [X: $i,M: $i > $o] : ( M @ X ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',in) ).

thf(intersection,definition,
    ( intersection
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          & ( Y @ U ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection) ).

thf(is_a,definition,
    ( is_a
    = ( ^ [X: $i,M: $i > $o] : ( M @ X ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',is_a) ).

thf(meets,definition,
    ( meets
    = ( ^ [X: $i > $o,Y: $i > $o] :
        ? [U: $i] :
          ( ( X @ U )
          & ( Y @ U ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',meets) ).

thf(misses,definition,
    ( misses
    = ( ^ [X: $i > $o,Y: $i > $o] :
          ~ ? [U: $i] :
              ( ( X @ U )
              & ( Y @ U ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',misses) ).

thf(setminus,definition,
    ( setminus
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          & ~ ( Y @ U ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminus) ).

thf(singleton,definition,
    ( singleton
    = ( ^ [X: $i,U: $i] : ( U = X ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton) ).

thf(subset,definition,
    ( subset
    = ( ^ [X: $i > $o,Y: $i > $o] :
        ! [U: $i] :
          ( ( X @ U )
         => ( Y @ U ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).

thf(union,definition,
    ( union
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          | ( Y @ U ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',union) ).

thf(unord_pair,definition,
    ( unord_pair
    = ( ^ [X: $i,Y: $i,U: $i] :
          ( ( U = X )
          | ( U = Y ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unord_pair) ).

thf(1,conjecture,
    ! [X: $i > $o,Y: $i > $o,A: $i > $o] :
      ( ( ( subset @ X @ A )
        & ( subset @ Y @ A ) )
     => ( subset @ ( union @ X @ Y ) @ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).

thf(2,negated_conjecture,
    ( ( ! [X: $i > $o,Y: $i > $o,A: $i > $o] :
          ( ( ( subset @ X @ A )
            & ( subset @ Y @ A ) )
         => ( subset @ ( union @ X @ Y ) @ A ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ! [SY0: $i > $o,SY1: $i > $o,SY2: $i > $o] :
          ( ( ! [SY5: $i] :
                ( ( SY0 @ SY5 )
               => ( SY2 @ SY5 ) )
            & ! [SY8: $i] :
                ( ( SY1 @ SY8 )
               => ( SY2 @ SY8 ) ) )
         => ! [SY14: $i] :
              ( ( ( SY0 @ SY14 )
                | ( SY1 @ SY14 ) )
             => ( SY2 @ SY14 ) ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2,complement,disjoint,emptyset,excl_union,in,intersection,is_a,meets,misses,setminus,singleton,subset,union,unord_pair]) ).

thf(4,plain,
    ( ( ! [SY21: $i > $o,SY22: $i > $o] :
          ( ( ! [SY23: $i] :
                ( ( sK1_SY0 @ SY23 )
               => ( SY22 @ SY23 ) )
            & ! [SY8: $i] :
                ( ( SY21 @ SY8 )
               => ( SY22 @ SY8 ) ) )
         => ! [SY25: $i] :
              ( ( ( sK1_SY0 @ SY25 )
                | ( SY21 @ SY25 ) )
             => ( SY22 @ SY25 ) ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[3]) ).

thf(5,plain,
    ( ( ! [SY26: $i > $o] :
          ( ( ! [SY23: $i] :
                ( ( sK1_SY0 @ SY23 )
               => ( SY26 @ SY23 ) )
            & ! [SY28: $i] :
                ( ( sK2_SY21 @ SY28 )
               => ( SY26 @ SY28 ) ) )
         => ! [SY29: $i] :
              ( ( ( sK1_SY0 @ SY29 )
                | ( sK2_SY21 @ SY29 ) )
             => ( SY26 @ SY29 ) ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[4]) ).

thf(6,plain,
    ( ( ( ! [SY30: $i] :
            ( ( sK1_SY0 @ SY30 )
           => ( sK3_SY26 @ SY30 ) )
        & ! [SY31: $i] :
            ( ( sK2_SY21 @ SY31 )
           => ( sK3_SY26 @ SY31 ) ) )
     => ! [SY32: $i] :
          ( ( ( sK1_SY0 @ SY32 )
            | ( sK2_SY21 @ SY32 ) )
         => ( sK3_SY26 @ SY32 ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[5]) ).

thf(7,plain,
    ( ( ! [SY30: $i] :
          ( ( sK1_SY0 @ SY30 )
         => ( sK3_SY26 @ SY30 ) ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[6]) ).

thf(8,plain,
    ( ( ! [SY31: $i] :
          ( ( sK2_SY21 @ SY31 )
         => ( sK3_SY26 @ SY31 ) ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[6]) ).

thf(9,plain,
    ( ( ! [SY32: $i] :
          ( ( ( sK1_SY0 @ SY32 )
            | ( sK2_SY21 @ SY32 ) )
         => ( sK3_SY26 @ SY32 ) ) )
    = $false ),
    inference(standard_cnf,[status(thm)],[6]) ).

thf(10,plain,
    ( ( ~ ! [SY32: $i] :
            ( ( ( sK1_SY0 @ SY32 )
              | ( sK2_SY21 @ SY32 ) )
           => ( sK3_SY26 @ SY32 ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[9]) ).

thf(11,plain,
    ( ( ( ( sK1_SY0 @ sK4_SY32 )
        | ( sK2_SY21 @ sK4_SY32 ) )
      & ~ ( sK3_SY26 @ sK4_SY32 ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[10]) ).

thf(12,plain,
    ( ( ! [SY30: $i] :
          ( ~ ( sK1_SY0 @ SY30 )
          | ( sK3_SY26 @ SY30 ) ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[7]) ).

thf(13,plain,
    ( ( ! [SY31: $i] :
          ( ~ ( sK2_SY21 @ SY31 )
          | ( sK3_SY26 @ SY31 ) ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[8]) ).

thf(14,plain,
    ( ( ! [SY31: $i] :
          ( ~ ( sK2_SY21 @ SY31 )
          | ( sK3_SY26 @ SY31 ) ) )
    = $true ),
    inference(copy,[status(thm)],[13]) ).

thf(15,plain,
    ( ( ! [SY30: $i] :
          ( ~ ( sK1_SY0 @ SY30 )
          | ( sK3_SY26 @ SY30 ) ) )
    = $true ),
    inference(copy,[status(thm)],[12]) ).

thf(16,plain,
    ( ( ( ( sK1_SY0 @ sK4_SY32 )
        | ( sK2_SY21 @ sK4_SY32 ) )
      & ~ ( sK3_SY26 @ sK4_SY32 ) )
    = $true ),
    inference(copy,[status(thm)],[11]) ).

thf(17,plain,
    ( ( ~ ( ~ ( ( sK1_SY0 @ sK4_SY32 )
              | ( sK2_SY21 @ sK4_SY32 ) )
          | ~ ~ ( sK3_SY26 @ sK4_SY32 ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[16,complement,disjoint,emptyset,excl_union,in,intersection,is_a,meets,misses,setminus,singleton,subset,union,unord_pair]) ).

thf(18,plain,
    ! [SV1: $i] :
      ( ( ~ ( sK2_SY21 @ SV1 )
        | ( sK3_SY26 @ SV1 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[14]) ).

thf(19,plain,
    ! [SV2: $i] :
      ( ( ~ ( sK1_SY0 @ SV2 )
        | ( sK3_SY26 @ SV2 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[15]) ).

thf(20,plain,
    ( ( ~ ( ( sK1_SY0 @ sK4_SY32 )
          | ( sK2_SY21 @ sK4_SY32 ) )
      | ~ ~ ( sK3_SY26 @ sK4_SY32 ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[17]) ).

thf(21,plain,
    ! [SV1: $i] :
      ( ( ( ~ ( sK2_SY21 @ SV1 ) )
        = $true )
      | ( ( sK3_SY26 @ SV1 )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[18]) ).

thf(22,plain,
    ! [SV2: $i] :
      ( ( ( ~ ( sK1_SY0 @ SV2 ) )
        = $true )
      | ( ( sK3_SY26 @ SV2 )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[19]) ).

thf(23,plain,
    ( ( ~ ( ( sK1_SY0 @ sK4_SY32 )
          | ( sK2_SY21 @ sK4_SY32 ) ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[20]) ).

thf(24,plain,
    ( ( ~ ~ ( sK3_SY26 @ sK4_SY32 ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[20]) ).

thf(25,plain,
    ! [SV1: $i] :
      ( ( ( sK2_SY21 @ SV1 )
        = $false )
      | ( ( sK3_SY26 @ SV1 )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[21]) ).

thf(26,plain,
    ! [SV2: $i] :
      ( ( ( sK1_SY0 @ SV2 )
        = $false )
      | ( ( sK3_SY26 @ SV2 )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[22]) ).

thf(27,plain,
    ( ( ( sK1_SY0 @ sK4_SY32 )
      | ( sK2_SY21 @ sK4_SY32 ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[23]) ).

thf(28,plain,
    ( ( ~ ( sK3_SY26 @ sK4_SY32 ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[24]) ).

thf(29,plain,
    ( ( ( sK1_SY0 @ sK4_SY32 )
      = $true )
    | ( ( sK2_SY21 @ sK4_SY32 )
      = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[27]) ).

thf(30,plain,
    ( ( sK3_SY26 @ sK4_SY32 )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[28]) ).

thf(31,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[25,30,29,26]) ).

thf(32,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET014^4 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.03  % Command  : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.15  % Computer : n013.cluster.edu
% 0.11/0.15  % Model    : x86_64 x86_64
% 0.11/0.15  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.15  % Memory   : 8046.5625MB
% 0.11/0.15  % OS       : Linux 6.8.0-71-generic
% 0.11/0.15  % CPULimit : 300
% 0.11/0.15  % WCLimit  : 300
% 0.11/0.15  % DateTime : Tue Oct  6 14:25:36 UTC 2026
% 0.11/0.15  % CPUTime  : 
% 0.11/0.15  Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.18  
% 0.11/0.18   No.of.Axioms: 0
% 0.11/0.18  
% 0.11/0.18   Length.of.Defs: 2083
% 0.11/0.18  
% 0.11/0.18   Contains.Choice.Funs: false
% 0.11/0.18  
% 0.11/0.18  ********************************
% 0.11/0.18  *   All subproblems solved!    *
% 0.11/0.18  ********************************
% 0.11/0.18  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:2,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:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:31,loop_count:0,foatp_calls:1,translation:fof_experiment)
% 0.11/0.18  
% 0.11/0.18  %**** Beginning of derivation protocol ****
% 0.11/0.18  % SZS output start CNFRefutation
% See solution above
% 0.11/0.18  
% 0.11/0.18  %**** End of derivation protocol ****
% 0.11/0.18  %**** no. of clauses in derivation: 32 ****
% 0.11/0.18  %**** clause counter: 31 ****
% 0.11/0.18  
% 0.11/0.18  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:2,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:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:31,loop_count:0,foatp_calls:1,translation:fof_experiment)
%------------------------------------------------------------------------------