↑ 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  : SEU882^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:09 AM UTC 2026

% Result   : Theorem 0.10s 0.25s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (  16 unt;   0 typ;   0 def)
%            Number of atoms       :   44 (  28 equ;   0 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :   35 (  21   ~;   0   |;   0   &;  14   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   1 usr;   3 con; 0-2 aty)
%            Number of variables   :   31 (   0   ^;  19   !;  12   ?;  31   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_sK1_Xy,type,
    sK1_Xy: $i ).

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

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

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

thf(4,plain,
    ( ( ? [SY3: $i > $i,SY4: $i] :
          ( ( SY3 @ SY4 )
          = sK1_Xy ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[3]) ).

thf(5,plain,
    ( ( ~ ? [SY3: $i > $i,SY4: $i] :
            ( ( SY3 @ SY4 )
            = sK1_Xy ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[4]) ).

thf(6,plain,
    ( ( ~ ? [SY3: $i > $i,SY4: $i] :
            ( ( SY3 @ SY4 )
            = sK1_Xy ) )
    = $true ),
    inference(copy,[status(thm)],[5]) ).

thf(7,plain,
    ( ( ~ ~ ! [SX0: $i > $i] :
              ~ ~ ! [SX1: $i] :
                    ( ( SX0 @ SX1 )
                   != sK1_Xy ) )
    = $true ),
    inference(unfold_def,[status(thm)],[6]) ).

thf(8,plain,
    ( ( ~ ! [SX0: $i > $i] :
            ~ ~ ! [SX1: $i] :
                  ( ( SX0 @ SX1 )
                 != sK1_Xy ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[7]) ).

thf(9,plain,
    ( ( ! [SX0: $i > $i] :
          ~ ~ ! [SX1: $i] :
                ( ( SX0 @ SX1 )
               != sK1_Xy ) )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[8]) ).

thf(10,plain,
    ! [SV1: $i > $i] :
      ( ( ~ ~ ! [SY5: $i] :
                ( ( SV1 @ SY5 )
               != sK1_Xy ) )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[9]) ).

thf(11,plain,
    ! [SV1: $i > $i] :
      ( ( ~ ! [SY5: $i] :
              ( ( SV1 @ SY5 )
             != sK1_Xy ) )
      = $false ),
    inference(extcnf_not_pos,[status(thm)],[10]) ).

thf(12,plain,
    ! [SV1: $i > $i] :
      ( ( ! [SY5: $i] :
            ( ( SV1 @ SY5 )
           != sK1_Xy ) )
      = $true ),
    inference(extcnf_not_neg,[status(thm)],[11]) ).

thf(13,plain,
    ! [SV2: $i,SV1: $i > $i] :
      ( ( ( SV1 @ SV2 )
       != sK1_Xy )
      = $true ),
    inference(extcnf_forall_pos,[status(thm)],[12]) ).

thf(14,plain,
    ! [SV2: $i,SV1: $i > $i] :
      ( ( ( SV1 @ SV2 )
        = sK1_Xy )
      = $false ),
    inference(extcnf_not_pos,[status(thm)],[13]) ).

thf(15,plain,
    $false = $true,
    inference(extuni,[status(esa)],[14:[bind(SV2,$thf( sK1_Xy )),bind(SV1,$thf( ^ [SX0: $i] : SX0 ))]]) ).

thf(16,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU882^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % 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.20  % Computer : n007.cluster.edu
% 0.10/0.20  % Model    : x86_64 x86_64
% 0.10/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20  % Memory   : 8046.5625MB
% 0.10/0.20  % OS       : Linux 6.8.0-71-generic
% 0.10/0.20  % CPULimit : 300
% 0.10/0.20  % WCLimit  : 300
% 0.10/0.20  % DateTime : Tue Oct  6 15:35:30 UTC 2026
% 0.10/0.21  % CPUTime  : 
% 0.10/0.21  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.25  
% 0.10/0.25   No.of.Axioms: 0
% 0.10/0.25  
% 0.10/0.25   Length.of.Defs: 0
% 0.10/0.25  
% 0.10/0.25   Contains.Choice.Funs: false
% 0.10/0.25  
% 0.10/0.25  ********************************
% 0.10/0.25  *   All subproblems solved!    *
% 0.10/0.25  ********************************
% 0.10/0.25  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:0,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:15,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.25  
% 0.10/0.25  %**** Beginning of derivation protocol ****
% 0.10/0.25  % SZS output start CNFRefutation
% See solution above
% 0.10/0.25  
% 0.10/0.25  %**** End of derivation protocol ****
% 0.10/0.25  %**** no. of clauses in derivation: 16 ****
% 0.10/0.25  %**** clause counter: 15 ****
% 0.10/0.25  
% 0.10/0.25  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:0,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:15,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------