↑ 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  : SEU926^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 : n009.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:36 AM UTC 2026

% Result   : Theorem 3.11s 2.07s
% Output   : Refutation 3.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   10 (   5 unt;   0 typ;   3 def)
%            Number of atoms       :   12 (   3 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   87 (   8   ~;   2   |;   7   &;  59   @)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   25 (  25   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   30 (   9   ^;  14   !;   4   ?;  30   :)
%                                         (   0  !>;   0  ?*;   0  @-;   3  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(sk1_decl,type,
    sk1: $i > $o ).

thf(sk2_decl,type,
    sk2: ( ( $i > $i ) > $o ) > $i > $i ).

thf(sk3_decl,type,
    sk3: ( ( $i > $i ) > $o ) > $i ).

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

thf(sk2_def,definition,
    ( sk2
    = ( ^ [A: ( $i > $i ) > $o] :
        @+[B: $i > $i] :
          ~ ( ( A @ B )
           => ( ( A
                @ ^ [C: $i] : ( B @ ( B @ C ) ) )
              & ! [C: $i] :
                  ( ( sk1 @ C )
                 => ( sk1 @ ( B @ C ) ) ) ) ) ) ) ).

thf(sk3_def,definition,
    ( sk3
    = ( ^ [A: ( $i > $i ) > $o] :
        @+[B: $i] :
          ~ ( ( sk1 @ B )
           => ( sk1 @ ( sk2 @ A @ B ) ) ) ) ) ).

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

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

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

thf(4,plain,
    ! [A: ( $i > $i ) > $o] :
      ( ( A @ ( sk2 @ A ) )
      & ( ~ ( A
            @ ^ [B: $i] : ( sk2 @ A @ ( sk2 @ A @ B ) ) )
        | ( sk1 @ ( sk3 @ A ) ) )
      & ( ~ ( A
            @ ^ [B: $i] : ( sk2 @ A @ ( sk2 @ A @ B ) ) )
        | ~ ( sk1 @ ( sk2 @ A @ ( sk3 @ A ) ) ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ! [A: ( $i > $i ) > $o] : ( A @ ( sk2 @ A ) ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(9,plain,
    $false,
    inference(prim_subst,[status(thm)],[5:[bind(A,$thf( ^ [B: $i > $i] : $false ))]]) ).

thf(14,plain,
    $false,
    inference(simp,[status(thm)],[9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU926^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % 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.24  % Computer : n009.cluster.edu
% 0.10/0.24  % Model    : x86_64 x86_64
% 0.10/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.24  % Memory   : 8046.5625MB
% 0.10/0.24  % OS       : Linux 6.8.0-71-generic
% 0.10/0.24  % CPULimit : 300
% 0.10/0.24  % WCLimit  : 300
% 0.10/0.24  % DateTime : Tue Sep 29 14:46:00 UTC 2026
% 0.10/0.24  % CPUTime  : 
% 0.10/0.24  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.95/0.80  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.13/0.98  % [INFO] 	 Parsing done (178ms). 
% 1.13/1.00  % [INFO] 	 Running in sequential loop mode. 
% 1.85/1.40  % [INFO] 	 eprover registered as external prover. 
% 1.85/1.41  % [INFO] 	 Scanning for conjecture ... 
% 1.85/1.49  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.00/1.52  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.00/1.52  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.00/1.52  % [INFO] 	 Type checking passed. 
% 2.00/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.11/2.06  % [INFO] 	 Killing All external provers ... 
% 3.11/2.06  % Time passed: 1683ms (effective reasoning time: 1057ms)
% 3.11/2.06  % 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.11/2.07  % Axioms used in derivation (0): 
% 3.11/2.07  % No. of inferences in proof: 7
% 3.11/2.07  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1683 ms resp. 1057 ms w/o parsing
% 3.11/2.12  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.11/2.13  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------