↑ Up

Leo-III---1.8.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Leo-III---1.8.0
% Problem  : SEV485^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39

% Computer : n018.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 Sep 30 08:37:21 AM UTC 2026

% Result   : Theorem 4.03s 2.31s
% Output   : Refutation 4.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   52 (  12 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  123 (  13   ~;   7   |;   6   &;  97   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   29 (   0   ^;  29   !;   0   ?;  29   :)

% Comments : 
%------------------------------------------------------------------------------
thf('type/nums/num_type',type,
    'type/nums/num': $tType ).

thf('const/sets/UNIV_decl',type,
    'const/sets/UNIV': 
      !>[TA: $tType] : ( TA > $o ) ).

thf('const/sets/HAS_SIZE_decl',type,
    'const/sets/HAS_SIZE': 
      !>[TA: $tType] : ( ( TA > $o ) > 'type/nums/num' > $o ) ).

thf('const/sets/FINITE_decl',type,
    'const/sets/FINITE': 
      !>[TA: $tType] : ( ( TA > $o ) > $o ) ).

thf('const/sets/CARD_decl',type,
    'const/sets/CARD': 
      !>[TA: $tType] : ( ( TA > $o ) > 'type/nums/num' ) ).

thf('const/nums/NUMERAL_decl',type,
    'const/nums/NUMERAL': 'type/nums/num' > 'type/nums/num' ).

thf('const/nums/BIT1_decl',type,
    'const/nums/BIT1': 'type/nums/num' > 'type/nums/num' ).

thf('const/nums/BIT0_decl',type,
    'const/nums/BIT0': 'type/nums/num' > 'type/nums/num' ).

thf('const/nums/_0_decl',type,
    'const/nums/_0': 'type/nums/num' ).

thf(4,axiom,
    'const/sets/HAS_SIZE' @ $o @ ( 'const/sets/UNIV' @ $o ) @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT0' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/HAS_SIZE_BOOL_') ).

thf(9,plain,
    'const/sets/HAS_SIZE' @ $o @ ( 'const/sets/UNIV' @ $o ) @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT0' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(3,axiom,
    ! [TA: $tType,A: TA > $o,B: 'type/nums/num'] :
      ( ( 'const/sets/HAS_SIZE' @ TA @ A @ B )
      = ( ( 'const/sets/FINITE' @ TA @ A )
        & ( ( 'const/sets/CARD' @ TA @ A )
          = B ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/HAS_SIZE_') ).

thf(6,plain,
    ! [TA: $tType,A: TA > $o,B: 'type/nums/num'] :
      ( ( 'const/sets/HAS_SIZE' @ TA @ A @ B )
      = ( ( 'const/sets/FINITE' @ TA @ A )
        & ( ( 'const/sets/CARD' @ TA @ A )
          = B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(7,plain,
    ! [TA: $tType,B: 'type/nums/num',A: TA > $o] :
      ( ( 'const/sets/HAS_SIZE' @ TA @ A @ B )
      = ( ( 'const/sets/FINITE' @ TA @ A )
        & ( ( 'const/sets/CARD' @ TA @ A )
          = B ) ) ),
    inference(cnf,[status(esa)],[6]) ).

thf(8,plain,
    ! [TA: $tType,B: 'type/nums/num',A: TA > $o] :
      ( ( ( 'const/sets/FINITE' @ TA @ A )
        & ( ( 'const/sets/CARD' @ TA @ A )
          = B ) )
      = ( 'const/sets/HAS_SIZE' @ TA @ A @ B ) ),
    inference(lifteq,[status(thm)],[7]) ).

thf(11,plain,
    ! [TA: $tType,B: 'type/nums/num',A: TA > $o] :
      ( ( ( 'const/sets/FINITE' @ TA @ A )
        & ( ( 'const/sets/CARD' @ TA @ A )
          = B ) )
      | ~ ( 'const/sets/HAS_SIZE' @ TA @ A @ B ) ),
    inference(bool_ext,[status(thm)],[8]) ).

thf(15,plain,
    ! [TA: $tType,B: 'type/nums/num',A: TA > $o] :
      ( ( ( 'const/sets/FINITE' @ TA @ A )
        | ~ ( 'const/sets/HAS_SIZE' @ TA @ A @ B ) )
      & ( ( ( 'const/sets/CARD' @ TA @ A )
          = B )
        | ~ ( 'const/sets/HAS_SIZE' @ TA @ A @ B ) ) ),
    inference(cnf,[status(esa)],[11]) ).

thf(16,plain,
    ! [TA: $tType,B: 'type/nums/num',A: TA > $o] :
      ( ( 'const/sets/FINITE' @ TA @ A )
      | ~ ( 'const/sets/HAS_SIZE' @ TA @ A @ B ) ),
    inference(cnfConj,[status(thm)],[15]) ).

thf(1,conjecture,
    'const/sets/FINITE' @ $o @ ( 'const/sets/UNIV' @ $o ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/FINITE_BOOL_') ).

thf(2,negated_conjecture,
    ~ ( 'const/sets/FINITE' @ $o @ ( 'const/sets/UNIV' @ $o ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(5,plain,
    ~ ( 'const/sets/FINITE' @ $o @ ( 'const/sets/UNIV' @ $o ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(19,plain,
    ! [TA: $tType,B: 'type/nums/num',A: TA > $o] :
      ( ~ ( 'const/sets/HAS_SIZE' @ TA @ A @ B )
      | ~ $true
      | ( ( 'const/sets/FINITE' @ TA @ A )
       != ( 'const/sets/FINITE' @ $o @ ( 'const/sets/UNIV' @ $o ) ) ) ),
    inference(paramod_ordered,[status(thm)],[16,5]) ).

thf(20,plain,
    ! [TA: $tType,B: 'type/nums/num',A: TA > $o] :
      ( ~ ( 'const/sets/HAS_SIZE' @ TA @ A @ B )
      | ( ( 'const/sets/FINITE' @ TA @ A )
       != ( 'const/sets/FINITE' @ $o @ ( 'const/sets/UNIV' @ $o ) ) ) ),
    inference(simp,[status(thm)],[19]) ).

thf(21,plain,
    ! [A: 'type/nums/num'] :
      ~ ( 'const/sets/HAS_SIZE' @ $o @ ( 'const/sets/UNIV' @ $o ) @ A ),
    inference(pattern_uni,[status(thm)],[20:[bind(A,$thf( 'const/sets/UNIV' @ $o )),bind(B,$thf( B )),bind_type(TA,$thf( $o ))]]) ).

thf(28,plain,
    ! [A: 'type/nums/num'] :
      ~ ( 'const/sets/HAS_SIZE' @ $o @ ( 'const/sets/UNIV' @ $o ) @ A ),
    inference(simp,[status(thm)],[21]) ).

thf(30,plain,
    $false,
    inference(rewrite,[status(thm)],[9,28]) ).

thf(31,plain,
    $false,
    inference(simp,[status(thm)],[30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEV485^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.07  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.10/0.21  % Computer : n018.cluster.edu
% 0.10/0.21  % Model    : x86_64 x86_64
% 0.10/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21  % Memory   : 8046.5625MB
% 0.10/0.21  % OS       : Linux 6.8.0-71-generic
% 0.10/0.21  % CPULimit : 300
% 0.10/0.21  % WCLimit  : 300
% 0.10/0.21  % DateTime : Tue Sep 29 15:55:41 UTC 2026
% 0.10/0.21  % CPUTime  : 
% 0.10/0.21  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.90/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.23/0.98  % [INFO] 	 Parsing done (188ms). 
% 1.23/1.00  % [INFO] 	 Running in sequential loop mode. 
% 1.84/1.39  % [INFO] 	 eprover registered as external prover. 
% 2.06/1.40  % [INFO] 	 Scanning for conjecture ... 
% 2.06/1.49  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ... 
% 2.26/1.52  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 2.26/1.53  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.26/1.54  % [INFO] 	 Type checking passed. 
% 2.26/1.54  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 4.03/2.30  % [INFO] 	 Killing All external provers ... 
% 4.03/2.31  % Time passed: 1944ms (effective reasoning time: 1301ms)
% 4.03/2.31  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 4.03/2.31  % Axioms used in derivation (2): thm/sets/HAS_SIZE_BOOL_, thm/sets/HAS_SIZE_
% 4.03/2.31  % No. of inferences in proof: 18
% 4.03/2.31  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1944 ms resp. 1301 ms w/o parsing
% 4.03/2.36  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.03/2.36  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------