↑ 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  : SEV014^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 : 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:43 AM UTC 2026

% Result   : Theorem 3.47s 2.09s
% Output   : Refutation 3.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   10 (   6 unt;   0 typ;   2 def)
%            Number of atoms       :   15 (   2 equ;   0 cnn)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :  116 (  10   ~;   3   |;  15   &;  76   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   2 usr;   3 con; 0-2 aty)
%            Number of variables   :   40 (   0   ^;  38   !;   0   ?;  40   :)
%                                         (   0  !>;   0  ?*;   0  @-;   2  @+)

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

thf(sk1_decl,type,
    sk1: a > a > $o ).

thf(sk2_decl,type,
    sk2: a ).

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: a > a > $o] :
          ~ ( ( ! [B: a] : ( A @ B @ B )
              & ! [B: a,C: a] :
                  ( ( A @ B @ C )
                 => ( A @ C @ B ) )
              & ! [B: a,C: a,D: a] :
                  ( ( ( A @ B @ C )
                    & ( A @ C @ D ) )
                 => ( A @ B @ D ) ) )
           => ! [B: a] : ( A @ B @ B ) ) ) ) ).

thf(sk2_def,definition,
    ( sk2
    = ( @+[A: a] :
          ~ ( sk1 @ A @ A ) ) ) ).

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

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

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

thf(4,plain,
    ! [F: a,E: a,D: a,C: a,B: a,A: a] :
      ( ( sk1 @ A @ A )
      & ( ~ ( sk1 @ B @ C )
        | ( sk1 @ C @ B ) )
      & ( ~ ( sk1 @ D @ E )
        | ~ ( sk1 @ E @ F )
        | ( sk1 @ D @ F ) )
      & ~ ( sk1 @ sk2 @ sk2 ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(8,plain,
    ~ ( sk1 @ sk2 @ sk2 ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(5,plain,
    ! [A: a] : ( sk1 @ A @ A ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(11,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[8,5]) ).

thf(12,plain,
    $false,
    inference(simp,[status(thm)],[11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEV014^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % 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.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.20  % CPULimit : 300
% 0.10/0.20  % WCLimit  : 300
% 0.10/0.20  % DateTime : Tue Sep 29 15:00:15 UTC 2026
% 0.10/0.20  % CPUTime  : 
% 0.10/0.20  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
% 0.92/0.78  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.26/0.97  % [INFO] 	 Parsing done (183ms). 
% 1.26/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.87/1.39  % [INFO] 	 eprover registered as external prover. 
% 2.07/1.40  % [INFO] 	 Scanning for conjecture ... 
% 2.07/1.49  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.25/1.52  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.25/1.52  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.25/1.53  % [INFO] 	 Type checking passed. 
% 2.25/1.53  % [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 ... 
% 3.47/2.08  % [INFO] 	 Killing All external provers ... 
% 3.47/2.09  % Time passed: 1747ms (effective reasoning time: 1096ms)
% 3.47/2.09  % 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)>
% 3.47/2.09  % Axioms used in derivation (0): 
% 3.47/2.09  % No. of inferences in proof: 8
% 3.47/2.09  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1747 ms resp. 1096 ms w/o parsing
% 3.69/2.13  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.69/2.13  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------