↑ 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  : SEV046^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 : n008.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:36:45 AM UTC 2026

% Result   : Theorem 6.59s 3.67s
% Output   : Refutation 7.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    4 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :    4 (   3 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :  266 (   2   ~;   0   |;  24   &; 198   @)
%                                         (   0 <=>;  42  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (  14 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   30 (  30   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    2 (   0 usr;   1 con; 0-2 aty)
%            Number of variables   :   90 (   0   ^;  90   !;   0   ?;  90   :)

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

thf(b_type,type,
    b: $tType ).

thf(1,conjecture,
    ! [A: a > a > $o,B: a > b > b > $o] :
      ( ( ! [C: a,D: a] :
            ( ( A @ C @ D )
           => ( A @ D @ C ) )
        & ! [C: a,D: a,E: a] :
            ( ( ( A @ C @ D )
              & ( A @ D @ E ) )
           => ( A @ C @ E ) )
        & ! [C: a] :
            ( ( A @ C @ C )
           => ( ! [D: b,E: b] :
                  ( ( B @ C @ D @ E )
                 => ( B @ C @ E @ D ) )
              & ! [D: b,E: b,F: b] :
                  ( ( ( B @ C @ D @ E )
                    & ( B @ C @ E @ F ) )
                 => ( B @ C @ D @ F ) ) ) )
        & ! [C: a,D: a] :
            ( ( A @ C @ D )
           => ( ( B @ C )
              = ( B @ D ) ) ) )
     => ( ! [C: a > b,D: a > b] :
            ( ! [E: a,F: a] :
                ( ( A @ E @ F )
               => ( B @ E @ ( C @ E ) @ ( D @ F ) ) )
           => ! [E: a,F: a] :
                ( ( A @ E @ F )
               => ( B @ E @ ( D @ E ) @ ( C @ F ) ) ) )
        & ! [C: a > b,D: a > b,E: a > b] :
            ( ( ! [F: a,G: a] :
                  ( ( A @ F @ G )
                 => ( B @ F @ ( C @ F ) @ ( D @ G ) ) )
              & ! [F: a,G: a] :
                  ( ( A @ F @ G )
                 => ( B @ F @ ( D @ F ) @ ( E @ G ) ) ) )
           => ! [F: a,G: a] :
                ( ( A @ F @ G )
               => ( B @ F @ ( C @ F ) @ ( E @ G ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM507_pme) ).

thf(2,negated_conjecture,
    ~ ! [A: a > a > $o,B: a > b > b > $o] :
        ( ( ! [C: a,D: a] :
              ( ( A @ C @ D )
             => ( A @ D @ C ) )
          & ! [C: a,D: a,E: a] :
              ( ( ( A @ C @ D )
                & ( A @ D @ E ) )
             => ( A @ C @ E ) )
          & ! [C: a] :
              ( ( A @ C @ C )
             => ( ! [D: b,E: b] :
                    ( ( B @ C @ D @ E )
                   => ( B @ C @ E @ D ) )
                & ! [D: b,E: b,F: b] :
                    ( ( ( B @ C @ D @ E )
                      & ( B @ C @ E @ F ) )
                   => ( B @ C @ D @ F ) ) ) )
          & ! [C: a,D: a] :
              ( ( A @ C @ D )
             => ( ( B @ C )
                = ( B @ D ) ) ) )
       => ( ! [C: a > b,D: a > b] :
              ( ! [E: a,F: a] :
                  ( ( A @ E @ F )
                 => ( B @ E @ ( C @ E ) @ ( D @ F ) ) )
             => ! [E: a,F: a] :
                  ( ( A @ E @ F )
                 => ( B @ E @ ( D @ E ) @ ( C @ F ) ) ) )
          & ! [C: a > b,D: a > b,E: a > b] :
              ( ( ! [F: a,G: a] :
                    ( ( A @ F @ G )
                   => ( B @ F @ ( C @ F ) @ ( D @ G ) ) )
                & ! [F: a,G: a] :
                    ( ( A @ F @ G )
                   => ( B @ F @ ( D @ F ) @ ( E @ G ) ) ) )
             => ! [F: a,G: a] :
                  ( ( A @ F @ G )
                 => ( B @ F @ ( C @ F ) @ ( E @ G ) ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: a > a > $o,B: a > b > b > $o] :
        ( ( ! [C: a,D: a] :
              ( ( A @ C @ D )
             => ( A @ D @ C ) )
          & ! [C: a,D: a,E: a] :
              ( ( ( A @ C @ D )
                & ( A @ D @ E ) )
             => ( A @ C @ E ) )
          & ! [C: a] :
              ( ( A @ C @ C )
             => ( ! [D: b,E: b] :
                    ( ( B @ C @ D @ E )
                   => ( B @ C @ E @ D ) )
                & ! [D: b,E: b,F: b] :
                    ( ( ( B @ C @ D @ E )
                      & ( B @ C @ E @ F ) )
                   => ( B @ C @ D @ F ) ) ) )
          & ! [C: a,D: a] :
              ( ( A @ C @ D )
             => ( ( B @ C )
                = ( B @ D ) ) ) )
       => ( ! [C: a > b,D: a > b] :
              ( ! [E: a,F: a] :
                  ( ( A @ E @ F )
                 => ( B @ E @ ( C @ E ) @ ( D @ F ) ) )
             => ! [E: a,F: a] :
                  ( ( A @ E @ F )
                 => ( B @ E @ ( D @ E ) @ ( C @ F ) ) ) )
          & ! [C: a > b,D: a > b,E: a > b] :
              ( ( ! [F: a,G: a] :
                    ( ( A @ F @ G )
                   => ( B @ F @ ( C @ F ) @ ( D @ G ) ) )
                & ! [F: a,G: a] :
                    ( ( A @ F @ G )
                   => ( B @ F @ ( D @ F ) @ ( E @ G ) ) ) )
             => ! [F: a,G: a] :
                  ( ( A @ F @ G )
                 => ( B @ F @ ( C @ F ) @ ( E @ G ) ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(94,plain,
    $false,
    inference(e,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SEV046^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.12  % 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.28/0.32  % Computer : n008.cluster.edu
% 0.28/0.32  % Model    : x86_64 x86_64
% 0.28/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.28/0.32  % Memory   : 8046.5625MB
% 0.28/0.32  % OS       : Linux 6.8.0-71-generic
% 0.28/0.32  % CPULimit : 300
% 0.28/0.32  % WCLimit  : 300
% 0.28/0.32  % DateTime : Tue Sep 29 15:05:54 UTC 2026
% 0.28/0.33  % CPUTime  : 
% 0.28/0.33  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.36/1.15  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.98/1.44  % [INFO] 	 Parsing done (285ms). 
% 1.98/1.46  % [INFO] 	 Running in sequential loop mode. 
% 3.20/2.07  % [INFO] 	 eprover registered as external prover. 
% 3.20/2.08  % [INFO] 	 Scanning for conjecture ... 
% 3.49/2.25  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 3.63/2.32  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 3.63/2.32  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 3.63/2.33  % [INFO] 	 Type checking passed. 
% 3.63/2.34  % [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 ... 
% 6.59/3.67  % External prover 'e' found a proof!
% 6.59/3.67  % [INFO] 	 Killing All external provers ... 
% 6.59/3.67  % Time passed: 3137ms (effective reasoning time: 2199ms)
% 6.59/3.67  % 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)>
% 6.59/3.67  % Axioms used in derivation (0): 
% 6.59/3.67  % No. of inferences in proof: 4
% 6.59/3.67  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3137 ms resp. 2199 ms w/o parsing
% 7.32/3.73  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.32/3.73  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------