↑ 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  : SYO360^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 : n017.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 11:08:07 AM UTC 2026

% Result   : Theorem 0.09s 0.22s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   32 (  27 unt;   0 typ;   0 def)
%            Number of atoms       :  114 (  78 equ;   0 cnn)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :  142 (   2   ~;   4   |;   3   &; 130   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :   11 (  11   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   33 (   0   ^;  33   !;   0   ?;  33   :)

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

thf(tp_f,type,
    f: ( a > a ) > a > a ).

thf(tp_g,type,
    g: ( a > a ) > a > a ).

thf(tp_h,type,
    h: a > a ).

thf(tp_j,type,
    j: a > a ).

thf(tp_sK1_SV4,type,
    sK1_SV4: a ).

thf(tp_sK2_E,type,
    sK2_E: a ).

thf(tp_sK3_E,type,
    sK3_E: a ).

thf(tp_sK4_E,type,
    sK4_E: a ).

thf(1,conjecture,
    ( ( ! [X: a > a,Y: a] :
          ( ( f @ X @ Y )
          = ( g @ X @ Y ) )
      & ! [Z: a] :
          ( ( h @ Z )
          = ( j @ Z ) ) )
   => ( ( f @ h )
      = ( g @ j ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEDEC1) ).

thf(2,negated_conjecture,
    ( ( ( ! [X: a > a,Y: a] :
            ( ( f @ X @ Y )
            = ( g @ X @ Y ) )
        & ! [Z: a] :
            ( ( h @ Z )
            = ( j @ Z ) ) )
     => ( ( f @ h )
        = ( g @ j ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ( ! [X: a > a,Y: a] :
            ( ( f @ X @ Y )
            = ( g @ X @ Y ) )
        & ! [Z: a] :
            ( ( h @ Z )
            = ( j @ Z ) ) )
     => ( ( f @ h )
        = ( g @ j ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ! [X: a > a,Y: a] :
          ( ( f @ X @ Y )
          = ( g @ X @ Y ) ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(5,plain,
    ( ( ! [Z: a] :
          ( ( h @ Z )
          = ( j @ Z ) ) )
    = $true ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(6,plain,
    ( ( ( f @ h )
      = ( g @ j ) )
    = $false ),
    inference(standard_cnf,[status(thm)],[3]) ).

thf(7,plain,
    ( ( ( f @ h )
     != ( g @ j ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[6]) ).

thf(8,plain,
    ( ( ! [Z: a] :
          ( ( h @ Z )
          = ( j @ Z ) ) )
    = $true ),
    inference(copy,[status(thm)],[5]) ).

thf(9,plain,
    ( ( ! [X: a > a,Y: a] :
          ( ( f @ X @ Y )
          = ( g @ X @ Y ) ) )
    = $true ),
    inference(copy,[status(thm)],[4]) ).

thf(10,plain,
    ( ( ( f @ h )
     != ( g @ j ) )
    = $true ),
    inference(copy,[status(thm)],[7]) ).

thf(11,plain,
    ! [SV1: a] :
      ( ( ( h @ SV1 )
        = ( j @ SV1 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[8]) ).

thf(12,plain,
    ! [SV2: a > a] :
      ( ( ! [SY3: a] :
            ( ( f @ SV2 @ SY3 )
            = ( g @ SV2 @ SY3 ) ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[9]) ).

thf(13,plain,
    ( ( ( f @ h )
      = ( g @ j ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[10]) ).

thf(14,plain,
    ! [SV3: a,SV2: a > a] :
      ( ( ( f @ SV2 @ SV3 )
        = ( g @ SV2 @ SV3 ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[12]) ).

thf(15,plain,
    ( ( ! [SV4: a] :
          ( ( f @ h @ SV4 )
          = ( g @ j @ SV4 ) ) )
    = $false ),
    inference(extcnf_equal_neg,[status(thm)],[13]) ).

thf(16,plain,
    ( ( ( f @ h )
      = ( g @ j ) )
    = $false ),
    inference(extcnf_equal_neg,[status(thm)],[13]) ).

thf(17,plain,
    ( ( ( f @ h @ sK1_SV4 )
      = ( g @ j @ sK1_SV4 ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[15]) ).

thf(18,plain,
    ( ( ( f @ h @ sK2_E )
      = ( g @ j @ sK2_E ) )
    = $false ),
    inference(extuni,[status(esa)],[16]) ).

thf(19,plain,
    ! [SV5: a] :
      ( ( ( h @ SV5 )
        = ( j @ SV5 ) )
      = $true ),
    inference(rename,[status(thm)],[11]) ).

thf(20,plain,
    ! [SV6: a,SV7: a > a] :
      ( ( ( f @ SV7 @ SV6 )
        = ( g @ SV7 @ SV6 ) )
      = $true ),
    inference(rename,[status(thm)],[14]) ).

thf(23,plain,
    ( ( ( f @ h @ sK3_E )
      = ( g @ j @ sK3_E ) )
    = $false ),
    inference(extuni,[status(esa)],[16]) ).

thf(24,plain,
    ! [SV6: a,SV7: a > a] :
      ( ( ( ( f @ h @ sK1_SV4 )
          = ( g @ j @ sK1_SV4 ) )
        = ( ( f @ SV7 @ SV6 )
          = ( g @ SV7 @ SV6 ) ) )
      = $false ),
    inference(res,[status(thm)],[17,20]) ).

thf(25,plain,
    ! [SV5: a] :
      ( ( ( ( f @ h @ sK1_SV4 )
          = ( g @ j @ sK1_SV4 ) )
        = ( ( h @ SV5 )
          = ( j @ SV5 ) ) )
      = $false ),
    inference(res,[status(thm)],[17,19]) ).

thf(26,plain,
    ! [SV5: a] :
      ( ( ( ( f @ h @ sK1_SV4 )
          = ( j @ SV5 ) )
        = $false )
      | ( ( ( g @ j @ sK1_SV4 )
          = ( h @ SV5 ) )
        = $false ) ),
    inference(extuni,[status(esa)],[25]) ).

thf(27,plain,
    ! [SV5: a] :
      ( ( ( ( g @ j @ sK1_SV4 )
          = ( j @ SV5 ) )
        = $false )
      | ( ( ( f @ h @ sK1_SV4 )
          = ( h @ SV5 ) )
        = $false ) ),
    inference(extuni,[status(esa)],[25]) ).

thf(28,plain,
    ! [SV6: a,SV7: a > a] :
      ( ( ( ( f @ h @ sK1_SV4 )
          = ( g @ SV7 @ SV6 ) )
        = $false )
      | ( ( ( g @ j @ sK1_SV4 )
          = ( f @ SV7 @ SV6 ) )
        = $false ) ),
    inference(extuni,[status(esa)],[24]) ).

thf(29,plain,
    ( ( ( j @ sK4_E )
      = ( h @ sK4_E ) )
    = $false ),
    inference(extuni,[status(esa)],[24:[bind(SV6,$thf( sK1_SV4 )),bind(SV7,$thf( h ))]]) ).

thf(30,plain,
    ( ( ( g @ j @ sK1_SV4 )
      = ( g @ h @ sK1_SV4 ) )
    = $false ),
    inference(extuni,[status(esa)],[24:[bind(SV6,$thf( sK1_SV4 )),bind(SV7,$thf( h ))]]) ).

thf(31,plain,
    ( ( ( f @ h @ sK1_SV4 )
      = ( f @ j @ sK1_SV4 ) )
    = $false ),
    inference(extuni,[status(esa)],[24:[bind(SV6,$thf( sK1_SV4 )),bind(SV7,$thf( j ))]]) ).

thf(32,plain,
    ! [SV6: a,SV7: a > a] :
      ( ( ( ( g @ j @ sK1_SV4 )
          = ( g @ SV7 @ SV6 ) )
        = $false )
      | ( ( ( f @ h @ sK1_SV4 )
          = ( f @ SV7 @ SV6 ) )
        = $false ) ),
    inference(extuni,[status(esa)],[24]) ).

thf(33,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[16,32,31,30,29,28,27,26,23,20,19,18,17]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO360^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.09/0.18  % Computer : n017.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Tue Oct  6 17:31:15 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/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.09/0.22  
% 0.09/0.22   No.of.Axioms: 0
% 0.09/0.22  
% 0.09/0.22   Length.of.Defs: 0
% 0.09/0.22  
% 0.09/0.22   Contains.Choice.Funs: false
% 0.09/0.22  
% 0.09/0.22  ********************************
% 0.09/0.22  *   All subproblems solved!    *
% 0.09/0.22  ********************************
% 0.09/0.22  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:2,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:33,loop_count:5,foatp_calls:3,translation:fof_full)
% 0.09/0.22  
% 0.09/0.22  %**** Beginning of derivation protocol ****
% 0.09/0.22  % SZS output start CNFRefutation
% See solution above
% 0.09/0.22  
% 0.09/0.22  %**** End of derivation protocol ****
% 0.09/0.22  %**** no. of clauses in derivation: 32 ****
% 0.09/0.22  %**** clause counter: 33 ****
% 0.09/0.22  
% 0.09/0.22  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:2,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:33,loop_count:5,foatp_calls:3,translation:fof_full)
%------------------------------------------------------------------------------