↑ 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  : SEV149^5 : TPTP v9.3.1. Released v4.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 : n014.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:55 AM UTC 2026

% Result   : Theorem 4.77s 2.46s
% Output   : Refutation 5.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    4 (   1 unt;   0 typ;   0 def)
%            Number of atoms       :    1 (   0 equ;   0 cnn)
%            Maximal formula atoms :    1 (   0 avg)
%            Number of connectives :  251 (   2   ~;  12   |;  36   &; 144   @)
%                                         (   0 <=>;  57  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (  18 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   30 (  30   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    1 (   0 usr;   1 con; 0-0 aty)
%            Number of variables   :   84 (   0   ^;  84   !;   0   ?;  84   :)

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

thf(1,conjecture,
    ! [A: a > a > $o,B: a > a > $o,C: a,D: a] :
      ( ! [E: a > $o] :
          ( ( ! [F: a] :
                ( ( ( A @ C @ F )
                  | ( B @ C @ F ) )
               => ( E @ F ) )
            & ! [F: a,G: a] :
                ( ( ( E @ F )
                  & ( ( A @ F @ G )
                    | ( B @ F @ G ) ) )
               => ( E @ G ) ) )
         => ( E @ D ) )
     => ! [E: a > $o] :
          ( ( ! [F: a] :
                ( ( ! [G: a > $o] :
                      ( ( ! [H: a] :
                            ( ( A @ C @ H )
                           => ( G @ H ) )
                        & ! [H: a,I: a] :
                            ( ( ( G @ H )
                              & ( A @ H @ I ) )
                           => ( G @ I ) ) )
                     => ( G @ F ) )
                  | ! [G: a > $o] :
                      ( ( ! [H: a] :
                            ( ( B @ C @ H )
                           => ( G @ H ) )
                        & ! [H: a,I: a] :
                            ( ( ( G @ H )
                              & ( B @ H @ I ) )
                           => ( G @ I ) ) )
                     => ( G @ F ) ) )
               => ( E @ F ) )
            & ! [F: a,G: a] :
                ( ( ( E @ F )
                  & ( ! [H: a > $o] :
                        ( ( ! [I: a] :
                              ( ( A @ F @ I )
                             => ( H @ I ) )
                          & ! [I: a,J: a] :
                              ( ( ( H @ I )
                                & ( A @ I @ J ) )
                             => ( H @ J ) ) )
                       => ( H @ G ) )
                    | ! [H: a > $o] :
                        ( ( ! [I: a] :
                              ( ( B @ F @ I )
                             => ( H @ I ) )
                          & ! [I: a,J: a] :
                              ( ( ( H @ I )
                                & ( B @ I @ J ) )
                             => ( H @ J ) ) )
                       => ( H @ G ) ) ) )
               => ( E @ G ) ) )
         => ( E @ D ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM251B_pme) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV149^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % 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.11/0.21  % Computer : n014.cluster.edu
% 0.11/0.21  % Model    : x86_64 x86_64
% 0.11/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.21  % Memory   : 8046.5625MB
% 0.11/0.21  % OS       : Linux 6.8.0-71-generic
% 0.11/0.21  % CPULimit : 300
% 0.11/0.21  % WCLimit  : 300
% 0.11/0.21  % DateTime : Tue Sep 29 15:16:30 UTC 2026
% 0.11/0.21  % CPUTime  : 
% 0.11/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.91/0.78  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.25/0.99  % [INFO] 	 Parsing done (203ms). 
% 1.25/1.00  % [INFO] 	 Running in sequential loop mode. 
% 2.12/1.41  % [INFO] 	 eprover registered as external prover. 
% 2.12/1.42  % [INFO] 	 Scanning for conjecture ... 
% 2.34/1.54  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.34/1.59  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.34/1.59  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.34/1.60  % [INFO] 	 Type checking passed. 
% 2.51/1.60  % [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.77/2.46  % External prover 'e' found a proof!
% 4.77/2.46  % [INFO] 	 Killing All external provers ... 
% 4.77/2.46  % Time passed: 2113ms (effective reasoning time: 1453ms)
% 4.77/2.46  % 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.77/2.46  % Axioms used in derivation (0): 
% 4.77/2.46  % No. of inferences in proof: 4
% 4.77/2.46  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2113 ms resp. 1453 ms w/o parsing
% 5.11/2.50  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.11/2.50  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------