↑ 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  : SEU885^5 : TPTP v9.3.1. Released v4.0.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 : n007.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:49:10 AM UTC 2026

% Result   : Theorem 0.10s 0.20s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   35 (  29 unt;   0 typ;   0 def)
%            Number of atoms       :  164 (  72 equ;   0 cnn)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :  225 (  86   ~;  27   |;  12   &;  86   @)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   46 (   0   ^;  34   !;  12   ?;  46   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_a,type,
    a: $tType ).

thf(tp_b,type,
    b: $tType ).

thf(tp_cF,type,
    cF: b > a ).

thf(tp_cU,type,
    cU: b > $o ).

thf(tp_cV,type,
    cV: b > $o ).

thf(tp_sK1_SX0,type,
    sK1_SX0: a ).

thf(tp_sK2_SY4,type,
    sK2_SY4: b ).

thf(1,conjecture,
    ( ! [Xx: b] :
        ( ( cU @ Xx )
       => ( cV @ Xx ) )
   => ! [Xx: a] :
        ( ? [Xt: b] :
            ( ( cU @ Xt )
            & ( Xx
              = ( cF @ Xt ) ) )
       => ? [Xt: b] :
            ( ( cV @ Xt )
            & ( Xx
              = ( cF @ Xt ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM30A_pme) ).

thf(2,negated_conjecture,
    ( ( ! [Xx: b] :
          ( ( cU @ Xx )
         => ( cV @ Xx ) )
     => ! [Xx: a] :
          ( ? [Xt: b] :
              ( ( cU @ Xt )
              & ( Xx
                = ( cF @ Xt ) ) )
         => ? [Xt: b] :
              ( ( cV @ Xt )
              & ( Xx
                = ( cF @ Xt ) ) ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ! [Xx: b] :
          ( ( cU @ Xx )
         => ( cV @ Xx ) )
     => ! [Xx: a] :
          ( ? [Xt: b] :
              ( ( cU @ Xt )
              & ( Xx
                = ( cF @ Xt ) ) )
         => ? [Xt: b] :
              ( ( cV @ Xt )
              & ( Xx
                = ( cF @ Xt ) ) ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ! [Xx: b] :
          ( ( cU @ Xx )
         => ( cV @ Xx ) ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(5,plain,
    ( ( ! [Xx: a] :
          ( ? [Xt: b] :
              ( ( cU @ Xt )
              & ( Xx
                = ( cF @ Xt ) ) )
         => ? [Xt: b] :
              ( ( cV @ Xt )
              & ( Xx
                = ( cF @ Xt ) ) ) ) )
    = $false ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(6,plain,
    ( ( ~ ! [Xx: a] :
            ( ? [Xt: b] :
                ( ( cU @ Xt )
                & ( Xx
                  = ( cF @ Xt ) ) )
           => ? [Xt: b] :
                ( ( cV @ Xt )
                & ( Xx
                  = ( cF @ Xt ) ) ) ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[5]) ).

thf(7,plain,
    ( ( ! [Xx: b] :
          ( ( cU @ Xx )
         => ( cV @ Xx ) ) )
    = $true ),
    inference(copy,[status(thm)],[4]) ).

thf(8,plain,
    ( ( ~ ! [Xx: a] :
            ( ? [Xt: b] :
                ( ( cU @ Xt )
                & ( Xx
                  = ( cF @ Xt ) ) )
           => ? [Xt: b] :
                ( ( cV @ Xt )
                & ( Xx
                  = ( cF @ Xt ) ) ) ) )
    = $true ),
    inference(copy,[status(thm)],[6]) ).

thf(9,plain,
    ( ( ~ ! [SX0: a] :
            ( ~ ~ ! [SX1: b] :
                    ~ ~ ( ~ ( cU @ SX1 )
                        | ( SX0
                         != ( cF @ SX1 ) ) )
            | ~ ! [SX1: b] :
                  ~ ~ ( ~ ( cV @ SX1 )
                      | ( SX0
                       != ( cF @ SX1 ) ) ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[8]) ).

thf(10,plain,
    ( ( ! [SX0: b] :
          ( ~ ( cU @ SX0 )
          | ( cV @ SX0 ) ) )
    = $true ),
    inference(unfold_def,[status(thm)],[7]) ).

thf(11,plain,
    ( ( ! [SX0: a] :
          ( ~ ~ ! [SX1: b] :
                  ~ ~ ( ~ ( cU @ SX1 )
                      | ( SX0
                       != ( cF @ SX1 ) ) )
          | ~ ! [SX1: b] :
                ~ ~ ( ~ ( cV @ SX1 )
                    | ( SX0
                     != ( cF @ SX1 ) ) ) ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[9]) ).

thf(12,plain,
    ! [SV1: b] :
      ( ( ~ ( cU @ SV1 )
        | ( cV @ SV1 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[10]) ).

thf(13,plain,
    ( ( ~ ~ ! [SY4: b] :
              ~ ~ ( ~ ( cU @ SY4 )
                  | ( sK1_SX0
                   != ( cF @ SY4 ) ) )
      | ~ ! [SY5: b] :
            ~ ~ ( ~ ( cV @ SY5 )
                | ( sK1_SX0
                 != ( cF @ SY5 ) ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[11]) ).

thf(14,plain,
    ! [SV1: b] :
      ( ( ( ~ ( cU @ SV1 ) )
        = $true )
      | ( ( cV @ SV1 )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[12]) ).

thf(15,plain,
    ( ( ~ ~ ! [SY4: b] :
              ~ ~ ( ~ ( cU @ SY4 )
                  | ( sK1_SX0
                   != ( cF @ SY4 ) ) ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[13]) ).

thf(16,plain,
    ( ( ~ ! [SY5: b] :
            ~ ~ ( ~ ( cV @ SY5 )
                | ( sK1_SX0
                 != ( cF @ SY5 ) ) ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[13]) ).

thf(17,plain,
    ! [SV1: b] :
      ( ( ( cU @ SV1 )
        = $false )
      | ( ( cV @ SV1 )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[14]) ).

thf(18,plain,
    ( ( ~ ! [SY4: b] :
            ~ ~ ( ~ ( cU @ SY4 )
                | ( sK1_SX0
                 != ( cF @ SY4 ) ) ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[15]) ).

thf(19,plain,
    ( ( ! [SY5: b] :
          ~ ~ ( ~ ( cV @ SY5 )
              | ( sK1_SX0
               != ( cF @ SY5 ) ) ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[16]) ).

thf(20,plain,
    ( ( ! [SY4: b] :
          ~ ~ ( ~ ( cU @ SY4 )
              | ( sK1_SX0
               != ( cF @ SY4 ) ) ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[18]) ).

thf(21,plain,
    ! [SV2: b] :
      ( ( ~ ~ ( ~ ( cV @ SV2 )
              | ( sK1_SX0
               != ( cF @ SV2 ) ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[19]) ).

thf(22,plain,
    ( ( ~ ~ ( ~ ( cU @ sK2_SY4 )
            | ( sK1_SX0
             != ( cF @ sK2_SY4 ) ) ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[20]) ).

thf(23,plain,
    ! [SV2: b] :
      ( ( ~ ( ~ ( cV @ SV2 )
            | ( sK1_SX0
             != ( cF @ SV2 ) ) ) )
      = $false ),
    inference(extcnf_not_pos,[status(thm)],[21]) ).

thf(24,plain,
    ( ( ~ ( ~ ( cU @ sK2_SY4 )
          | ( sK1_SX0
           != ( cF @ sK2_SY4 ) ) ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[22]) ).

thf(25,plain,
    ! [SV2: b] :
      ( ( ~ ( cV @ SV2 )
        | ( sK1_SX0
         != ( cF @ SV2 ) ) )
      = $true ),
    inference(extcnf_not_neg,[status(thm)],[23]) ).

thf(26,plain,
    ( ( ~ ( cU @ sK2_SY4 )
      | ( sK1_SX0
       != ( cF @ sK2_SY4 ) ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[24]) ).

thf(27,plain,
    ! [SV2: b] :
      ( ( ( ~ ( cV @ SV2 ) )
        = $true )
      | ( ( sK1_SX0
         != ( cF @ SV2 ) )
        = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[25]) ).

thf(28,plain,
    ( ( ~ ( cU @ sK2_SY4 ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[26]) ).

thf(29,plain,
    ( ( sK1_SX0
     != ( cF @ sK2_SY4 ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[26]) ).

thf(30,plain,
    ! [SV2: b] :
      ( ( ( cV @ SV2 )
        = $false )
      | ( ( sK1_SX0
         != ( cF @ SV2 ) )
        = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[27]) ).

thf(31,plain,
    ( ( cU @ sK2_SY4 )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[28]) ).

thf(32,plain,
    ( ( sK1_SX0
      = ( cF @ sK2_SY4 ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[29]) ).

thf(33,plain,
    ! [SV2: b] :
      ( ( ( sK1_SX0
          = ( cF @ SV2 ) )
        = $false )
      | ( ( cV @ SV2 )
        = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[30]) ).

thf(34,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[17,33,32,31]) ).

thf(35,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU885^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % 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.10/0.18  % Computer : n007.cluster.edu
% 0.10/0.18  % Model    : x86_64 x86_64
% 0.10/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18  % Memory   : 8046.5625MB
% 0.10/0.18  % OS       : Linux 6.8.0-71-generic
% 0.10/0.18  % CPULimit : 300
% 0.10/0.18  % WCLimit  : 300
% 0.10/0.18  % DateTime : Tue Oct  6 15:35:45 UTC 2026
% 0.10/0.18  % CPUTime  : 
% 0.10/0.18  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.10/0.20  
% 0.10/0.20   No.of.Axioms: 0
% 0.10/0.20  
% 0.10/0.20   Length.of.Defs: 0
% 0.10/0.20  
% 0.10/0.20   Contains.Choice.Funs: false
% 0.10/0.20  
% 0.10/0.20  ********************************
% 0.10/0.20  *   All subproblems solved!    *
% 0.10/0.20  ********************************
% 0.10/0.20  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:1,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:34,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.20  
% 0.10/0.20  %**** Beginning of derivation protocol ****
% 0.10/0.20  % SZS output start CNFRefutation
% See solution above
% 0.10/0.20  
% 0.10/0.20  %**** End of derivation protocol ****
% 0.10/0.20  %**** no. of clauses in derivation: 35 ****
% 0.10/0.20  %**** clause counter: 34 ****
% 0.10/0.20  
% 0.10/0.20  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:1,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:34,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------