↑ 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  : SEU903^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:29:33 AM UTC 2026

% Result   : Theorem 4.13s 2.32s
% Output   : Refutation 4.13s
% 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       :   10 (   9 equ;   0 cnn)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :  206 (   2   ~;   0   |;  30   &; 135   @)
%                                         (   0 <=>;  39  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (  17 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :   24 (  24   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    2 (   0 usr;   1 con; 0-2 aty)
%            Number of variables   :   60 (   0   ^;  60   !;   0   ?;  60   :)

% Comments : 
%------------------------------------------------------------------------------
thf(g_type,type,
    g: $tType ).

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

thf(a_type,type,
    a: $tType ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU903^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % 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.10/0.20  % Computer : n014.cluster.edu
% 0.10/0.20  % Model    : x86_64 x86_64
% 0.10/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20  % Memory   : 8046.5625MB
% 0.10/0.20  % OS       : Linux 6.8.0-71-generic
% 0.10/0.21  % CPULimit : 300
% 0.10/0.21  % WCLimit  : 300
% 0.10/0.21  % DateTime : Tue Sep 29 14:44:29 UTC 2026
% 0.10/0.21  % CPUTime  : 
% 0.10/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.90/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.24/0.99  % [INFO] 	 Parsing done (193ms). 
% 1.24/1.00  % [INFO] 	 Running in sequential loop mode. 
% 2.11/1.40  % [INFO] 	 eprover registered as external prover. 
% 2.11/1.41  % [INFO] 	 Scanning for conjecture ... 
% 2.34/1.52  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.34/1.57  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.34/1.57  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.34/1.58  % [INFO] 	 Type checking passed. 
% 2.34/1.59  % [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.13/2.31  % External prover 'e' found a proof!
% 4.13/2.31  % [INFO] 	 Killing All external provers ... 
% 4.13/2.32  % Time passed: 1964ms (effective reasoning time: 1309ms)
% 4.13/2.32  % 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.13/2.32  % Axioms used in derivation (0): 
% 4.13/2.32  % No. of inferences in proof: 4
% 4.13/2.32  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1964 ms resp. 1309 ms w/o parsing
% 4.13/2.36  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.13/2.36  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------