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

% Result   : Theorem 5.31s 2.96s
% Output   : Refutation 5.31s
% 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       :   16 (   9 equ;   0 cnn)
%            Maximal formula atoms :    5 (   4 avg)
%            Number of connectives :   65 (   2   ~;   9   |;   6   &;  33   @)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (  11 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   21 (  21   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    2 (   0 usr;   1 con; 0-2 aty)
%            Number of variables   :   39 (  15   ^;  24   !;   0   ?;  39   :)

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU859^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.12/0.20  % Computer : n014.cluster.edu
% 0.12/0.20  % Model    : x86_64 x86_64
% 0.12/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.20  % Memory   : 8046.5625MB
% 0.12/0.20  % OS       : Linux 6.8.0-71-generic
% 0.12/0.20  % CPULimit : 300
% 0.12/0.20  % WCLimit  : 300
% 0.12/0.20  % DateTime : Tue Sep 29 14:40:58 UTC 2026
% 0.12/0.20  % CPUTime  : 
% 0.12/0.20  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
% 1.12/0.80  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.58/1.08  % [INFO] 	 Parsing done (277ms). 
% 1.58/1.10  % [INFO] 	 Running in sequential loop mode. 
% 2.59/1.71  % [INFO] 	 eprover registered as external prover. 
% 2.59/1.72  % [INFO] 	 Scanning for conjecture ... 
% 2.79/1.86  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.98/1.92  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.98/1.92  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.98/1.93  % [INFO] 	 Type checking passed. 
% 2.98/1.93  % [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 ... 
% 5.31/2.96  % External prover 'e' found a proof!
% 5.31/2.96  % [INFO] 	 Killing All external provers ... 
% 5.31/2.96  % Time passed: 2619ms (effective reasoning time: 1849ms)
% 5.31/2.96  % 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)>
% 5.31/2.96  % Axioms used in derivation (0): 
% 5.31/2.96  % No. of inferences in proof: 4
% 5.31/2.96  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2619 ms resp. 1849 ms w/o parsing
% 5.31/3.02  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.31/3.02  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------