↑ 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  : SET591^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39

% Computer : n002.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:22:58 AM UTC 2026

% Result   : Theorem 4.51s 2.41s
% Output   : Refutation 4.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (  11 unt;   0 typ;   2 def)
%            Number of atoms       :   36 (  11 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   67 (  20   ~;   3   |;   8   &;  25   @)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   11 (  11   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   30 (  10   ^;  16   !;   2   ?;  30   :)
%                                         (   0  !>;   0  ?*;   0  @-;   2  @+)

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

thf(sk1_decl,type,
    sk1: a > $o ).

thf(sk2_decl,type,
    sk2: a > $o ).

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: a > $o] :
          ~ ( ? [B: a > $o] :
              ! [C: a] :
                ( ( A @ C )
               => ( ( B @ C )
                  & ~ ( A @ C ) ) )
           => ( A
              = ( ^ [B: a] : $false ) ) ) ) ) ).

thf(sk2_def,definition,
    ( sk2
    = ( @+[A: a > $o] :
        ! [B: a] :
          ( ( sk1 @ B )
         => ( ( A @ B )
            & ~ ( sk1 @ B ) ) ) ) ) ).

thf(1,conjecture,
    ! [A: a > $o,B: a > $o] :
      ( ! [C: a] :
          ( ( A @ C )
         => ( ( B @ C )
            & ~ ( A @ C ) ) )
     => ( A
        = ( ^ [C: a] : $false ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_50_pme) ).

thf(2,negated_conjecture,
    ~ ! [A: a > $o,B: a > $o] :
        ( ! [C: a] :
            ( ( A @ C )
           => ( ( B @ C )
              & ~ ( A @ C ) ) )
       => ( A
          = ( ^ [C: a] : $false ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: a > $o,B: a > $o] :
        ( ! [C: a] :
            ( ( A @ C )
           => ( ( B @ C )
              & ~ ( A @ C ) ) )
       => ( A
          = ( ^ [C: a] : $false ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ~ ! [A: a > $o] :
        ( ? [B: a > $o] :
          ! [C: a] :
            ( ( A @ C )
           => ( ( B @ C )
              & ~ ( A @ C ) ) )
       => ( A
          = ( ^ [B: a] : $false ) ) ),
    inference(miniscope,[status(thm)],[3]) ).

thf(5,plain,
    ! [A: a] :
      ( ( ~ ( sk1 @ A )
        | ( sk2 @ A ) )
      & ( ~ ( sk1 @ A )
        | ~ ( sk1 @ A ) )
      & ( sk1
       != ( ^ [B: a] : $false ) ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(8,plain,
    ( sk1
   != ( ^ [A: a] : $false ) ),
    inference(cnfConj,[status(thm)],[5]) ).

thf(10,plain,
    ( sk1
   != ( ^ [A: a] : $false ) ),
    inference(lifteq,[status(thm)],[8]) ).

thf(7,plain,
    ! [A: a] :
      ( ~ ( sk1 @ A )
      | ~ ( sk1 @ A ) ),
    inference(cnfConj,[status(thm)],[5]) ).

thf(9,plain,
    ! [A: a] :
      ~ ( sk1 @ A ),
    inference(simp,[status(thm)],[7]) ).

thf(12,plain,
    ( ( ^ [A: a] : $false )
   != ( ^ [A: a] : $false ) ),
    inference(rewrite,[status(thm)],[10,9]) ).

thf(13,plain,
    $false,
    inference(simp,[status(thm)],[12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SET591^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.10  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.25/0.28  % Computer : n002.cluster.edu
% 0.25/0.28  % Model    : x86_64 x86_64
% 0.25/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.25/0.28  % Memory   : 8046.5625MB
% 0.25/0.28  % OS       : Linux 6.8.0-71-generic
% 0.25/0.28  % CPULimit : 300
% 0.25/0.28  % WCLimit  : 300
% 0.25/0.28  % DateTime : Tue Sep 29 13:41:07 UTC 2026
% 0.25/0.28  % CPUTime  : 
% 0.25/0.28  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 1.18/0.96  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.70/1.16  % [INFO] 	 Parsing done (196ms). 
% 1.70/1.18  % [INFO] 	 Running in sequential loop mode. 
% 2.40/1.63  % [INFO] 	 eprover registered as external prover. 
% 2.40/1.64  % [INFO] 	 Scanning for conjecture ... 
% 2.65/1.74  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.65/1.78  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.65/1.78  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.65/1.78  % [INFO] 	 Type checking passed. 
% 2.65/1.79  % [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.51/2.41  % [INFO] 	 Killing All external provers ... 
% 4.51/2.41  % Time passed: 1948ms (effective reasoning time: 1223ms)
% 4.51/2.41  % 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.51/2.41  % Axioms used in derivation (0): 
% 4.51/2.41  % No. of inferences in proof: 11
% 4.51/2.41  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1948 ms resp. 1223 ms w/o parsing
% 4.51/2.46  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.51/2.46  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------