↑ 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  : SET604^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 : n010.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:40:31 AM UTC 2026

% Result   : Theorem 0.07s 0.21s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   23 (  19 unt;   0 typ;   0 def)
%            Number of atoms       :  110 (  37 equ;   0 cnn)
%            Maximal formula atoms :    2 (   4 avg)
%            Number of connectives :   42 (  21   ~;  11   |;   5   &;   5   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   2 usr;   3 con; 0-2 aty)
%            Number of variables   :   22 (  18   ^;   4   !;   0   ?;  22   :)

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

thf(tp_sK1_X,type,
    sK1_X: a > $o ).

thf(tp_sK2_SV1,type,
    sK2_SV1: a ).

thf(1,conjecture,
    ! [X: a > $o] :
      ( ( ^ [Xx: a] :
            ( $false
            & ~ ( X @ Xx ) ) )
      = ( ^ [Xx: a] : $false ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_75_pme) ).

thf(2,negated_conjecture,
    ( ( ! [X: a > $o] :
          ( ( ^ [Xx: a] :
                ( $false
                & ~ ( X @ Xx ) ) )
          = ( ^ [Xx: a] : $false ) ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ( ( ! [X: a > $o] :
          ( ( ^ [Xx: a] :
                ( $false
                & ~ ( X @ Xx ) ) )
          = ( ^ [Xx: a] : $false ) ) )
    = $false ),
    inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ( ^ [SY3: a] :
            ( $false
            & ~ ( sK1_X @ SY3 ) ) )
      = ( ^ [Xx: a] : $false ) )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[3]) ).

thf(5,plain,
    ( ( ( ^ [SY3: a] :
            ( $false
            & ~ ( sK1_X @ SY3 ) ) )
     != ( ^ [Xx: a] : $false ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[4]) ).

thf(6,plain,
    ( ( ( ^ [SY3: a] : $false )
     != ( ^ [Xx: a] : $false ) )
    = $true ),
    inference(extcnf_combined,[status(esa)],[5]) ).

thf(7,plain,
    ( ( ( ^ [SY3: a] : $false )
     != ( ^ [Xx: a] : $false ) )
    = $true ),
    inference(copy,[status(thm)],[6]) ).

thf(8,plain,
    ( ( ( ^ [SY3: a] : $false )
      = ( ^ [Xx: a] : $false ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[7]) ).

thf(9,plain,
    ( ( ! [SV1: a] : ( $false = $false ) )
    = $false ),
    inference(extcnf_equal_neg,[status(thm)],[8]) ).

thf(10,plain,
    ( ( ( ^ [SY3: a] : $false )
      = ( ^ [Xx: a] : $false ) )
    = $false ),
    inference(extcnf_equal_neg,[status(thm)],[8]) ).

thf(11,plain,
    ( ( $false = $false )
    = $false ),
    inference(extcnf_forall_neg,[status(esa)],[9]) ).

thf(12,plain,
    ( ( ~ ( $false
          | $false )
      | ~ ( ~ $false
          | ~ $false ) )
    = $false ),
    inference(extcnf_equal_neg,[status(thm)],[11]) ).

thf(13,plain,
    ( ( $false = $false )
    = $false ),
    inference(extcnf_equal_neg,[status(thm)],[11]) ).

thf(14,plain,
    ( ( ~ ( $false
          | $false ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[12]) ).

thf(15,plain,
    ( ( ~ ( ~ $false
          | ~ $false ) )
    = $false ),
    inference(extcnf_or_neg,[status(thm)],[12]) ).

thf(16,plain,
    ( ( $false
      | $false )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[14]) ).

thf(17,plain,
    ( ( ~ $false
      | ~ $false )
    = $true ),
    inference(extcnf_not_neg,[status(thm)],[15]) ).

thf(18,plain,
    ( ( $false = $true )
    | ( $false = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[16]) ).

thf(19,plain,
    ( ( ( ~ $false ) = $true )
    | ( ( ~ $false ) = $true ) ),
    inference(extcnf_or_pos,[status(thm)],[17]) ).

thf(20,plain,
    ( ( $false = $false )
    | ( ( ~ $false ) = $true ) ),
    inference(extcnf_not_pos,[status(thm)],[19]) ).

thf(21,plain,
    ( ( $false = $false )
    | ( $false = $false ) ),
    inference(extcnf_not_pos,[status(thm)],[20]) ).

thf(22,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[10,21,18,13]) ).

thf(23,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET604^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.07/0.18  % Computer : n010.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Oct  6 14:47:25 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  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.07/0.21  
% 0.07/0.21   No.of.Axioms: 0
% 0.07/0.21  
% 0.07/0.21   Length.of.Defs: 0
% 0.07/0.21  
% 0.07/0.21   Contains.Choice.Funs: false
% 0.07/0.21  
% 0.07/0.21  ********************************
% 0.07/0.21  *   All subproblems solved!    *
% 0.07/0.21  ********************************
% 0.07/0.21  % 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:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:22,loop_count:0,foatp_calls:1,translation:fof_experiment)
% 0.07/0.21  
% 0.07/0.21  %**** Beginning of derivation protocol ****
% 0.07/0.21  % SZS output start CNFRefutation
% See solution above
% 0.07/0.21  
% 0.07/0.21  %**** End of derivation protocol ****
% 0.07/0.21  %**** no. of clauses in derivation: 23 ****
% 0.07/0.21  %**** clause counter: 22 ****
% 0.07/0.21  
% 0.07/0.21  % 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:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:22,loop_count:0,foatp_calls:1,translation:fof_experiment)
%------------------------------------------------------------------------------