↑ 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  : SEV185^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 : n015.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:58 AM UTC 2026

% Result   : Theorem 4.45s 2.20s
% Output   : Refutation 4.59s
% 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 :   71 (   2   ~;   0   |;   6   &;  39   @)
%                                         (   0 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (  11 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   :   33 (   0   ^;  33   !;   0   ?;  33   :)

% Comments : 
%------------------------------------------------------------------------------
thf(b_type,type,
    b: $tType ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SEV185^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.10  % 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.25/0.30  % Computer : n015.cluster.edu
% 0.25/0.30  % Model    : x86_64 x86_64
% 0.25/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.25/0.30  % Memory   : 8046.5625MB
% 0.25/0.30  % OS       : Linux 6.8.0-71-generic
% 0.25/0.30  % CPULimit : 300
% 0.25/0.30  % WCLimit  : 300
% 0.25/0.30  % DateTime : Tue Sep 29 15:22:33 UTC 2026
% 0.25/0.31  % CPUTime  : 
% 0.25/0.31  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.93/0.78  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.36/0.93  % [INFO] 	 Parsing done (149ms). 
% 1.36/0.94  % [INFO] 	 Running in sequential loop mode. 
% 2.02/1.36  % [INFO] 	 eprover registered as external prover. 
% 2.02/1.37  % [INFO] 	 Scanning for conjecture ... 
% 2.25/1.46  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.25/1.49  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.25/1.49  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.25/1.49  % [INFO] 	 Type checking passed. 
% 2.25/1.50  % [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.45/2.19  % External prover 'e' found a proof!
% 4.45/2.19  % [INFO] 	 Killing All external provers ... 
% 4.45/2.19  % Time passed: 1757ms (effective reasoning time: 1250ms)
% 4.45/2.19  % 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.45/2.20  % Axioms used in derivation (0): 
% 4.45/2.20  % No. of inferences in proof: 4
% 4.45/2.20  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1757 ms resp. 1250 ms w/o parsing
% 4.59/2.22  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.59/2.22  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------