↑ 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  : SEU550^2 : TPTP v9.3.1. Bugfixed v5.2.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 : n011.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:28:30 AM UTC 2026

% Result   : Theorem 3.14s 2.07s
% Output   : Refutation 3.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   14 (   8 unt;   0 typ;   3 def)
%            Number of atoms       :   79 (  44 equ;   0 cnn)
%            Maximal formula atoms :    3 (   5 avg)
%            Number of connectives :  107 (  11   ~;   3   |;  16   &;  52   @)
%                                         (   0 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   10 (  10   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   57 (   1   ^;  39   !;  15   ?;  57   :)
%                                         (   0  !>;   0  ?*;   0  @-;   2  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(exu_decl,type,
    exu: ( $i > $o ) > $o ).

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

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

thf(exu_def,definition,
    ( exu
    = ( ^ [A: $i > $o] :
        ? [B: $i] :
          ( ( A @ B )
          & ! [C: $i] :
              ( ( A @ C )
             => ( B = C ) ) ) ) ) ).

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

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

thf(1,conjecture,
    ! [A: $i > $o,B: $i > $o] :
      ( ! [C: $i,D: $i] :
          ( ( C = D )
         => ( ( A @ C )
            = ( B @ D ) ) )
     => ( ( exu @ A )
        = ( exu @ B ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exu__Cong) ).

thf(2,negated_conjecture,
    ~ ! [A: $i > $o,B: $i > $o] :
        ( ! [C: $i,D: $i] :
            ( ( C = D )
           => ( ( A @ C )
              = ( B @ D ) ) )
       => ( ( exu @ A )
          = ( exu @ B ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

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

thf(4,plain,
    ! [B: $i,A: $i] :
      ( ( ( A != B )
        | ( ( sk1 @ A )
          = ( sk2 @ B ) ) )
      & ( ( ? [C: $i] :
              ( ( sk1 @ C )
              & ! [D: $i] :
                  ( ( sk1 @ D )
                 => ( C = D ) ) ) )
       != ( ? [C: $i] :
              ( ( sk2 @ C )
              & ! [D: $i] :
                  ( ( sk2 @ D )
                 => ( C = D ) ) ) ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(6,plain,
    ( ( ? [A: $i] :
          ( ( sk1 @ A )
          & ! [B: $i] :
              ( ( sk1 @ B )
             => ( A = B ) ) ) )
   != ( ? [A: $i] :
          ( ( sk2 @ A )
          & ! [B: $i] :
              ( ( sk2 @ B )
             => ( A = B ) ) ) ) ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(9,plain,
    ( ( ? [A: $i] :
          ( ( sk2 @ A )
          & ! [B: $i] :
              ( ( sk2 @ B )
             => ( A = B ) ) ) )
   != ( ? [A: $i] :
          ( ( sk1 @ A )
          & ! [B: $i] :
              ( ( sk1 @ B )
             => ( A = B ) ) ) ) ),
    inference(lifteq,[status(thm)],[6]) ).

thf(5,plain,
    ! [B: $i,A: $i] :
      ( ( A != B )
      | ( ( sk1 @ A )
        = ( sk2 @ B ) ) ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(7,plain,
    ! [B: $i,A: $i] :
      ( ( A != B )
      | ( ( sk1 @ A )
        = ( sk2 @ B ) ) ),
    inference(lifteq,[status(thm)],[5]) ).

thf(8,plain,
    ! [A: $i] :
      ( ( sk2 @ A )
      = ( sk1 @ A ) ),
    inference(simp,[status(thm)],[7]) ).

thf(12,plain,
    ( ( ? [A: $i] :
          ( ( sk1 @ A )
          & ! [B: $i] :
              ( ( sk1 @ B )
             => ( A = B ) ) ) )
   != ( ? [A: $i] :
          ( ( sk1 @ A )
          & ! [B: $i] :
              ( ( sk1 @ B )
             => ( A = B ) ) ) ) ),
    inference(rewrite,[status(thm)],[9,8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU550^2 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.08  % 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.09/0.21  % Computer : n011.cluster.edu
% 0.09/0.21  % Model    : x86_64 x86_64
% 0.09/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21  % Memory   : 8046.5625MB
% 0.09/0.21  % OS       : Linux 6.8.0-71-generic
% 0.09/0.21  % CPULimit : 300
% 0.09/0.21  % WCLimit  : 300
% 0.09/0.21  % DateTime : Tue Sep 29 13:49:46 UTC 2026
% 0.09/0.22  % CPUTime  : 
% 0.09/0.22  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
% 0.85/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.15/0.97  % [INFO] 	 Parsing done (181ms). 
% 1.15/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.70/1.39  % [INFO] 	 eprover registered as external prover. 
% 1.70/1.40  % [INFO] 	 Scanning for conjecture ... 
% 1.87/1.49  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.03/1.52  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.03/1.52  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.03/1.53  % [INFO] 	 Type checking passed. 
% 2.03/1.53  % [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 ... 
% 3.14/2.06  % [INFO] 	 Killing All external provers ... 
% 3.14/2.07  % Time passed: 1710ms (effective reasoning time: 1074ms)
% 3.14/2.07  % 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)>
% 3.14/2.07  % Axioms used in derivation (0): 
% 3.14/2.07  % No. of inferences in proof: 11
% 3.14/2.07  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1710 ms resp. 1074 ms w/o parsing
% 3.41/2.13  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.41/2.13  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------