↑ 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  : SYO334^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 : n008.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:45:36 AM UTC 2026

% Result   : Theorem 9.43s 3.61s
% Output   : Refutation 9.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   30
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   50 (  25 unt;   0 typ;   7 def)
%            Number of atoms       :   64 (  45 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :  707 (  55   ~;  29   |;  23   &; 560   @)
%                                         (   0 <=>;  40  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   6 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :   62 (  62   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   14 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :  164 (   1   ^; 150   !;   6   ?; 164   :)
%                                         (   0  !>;   0  ?*;   0  @-;   7  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(c_type,type,
    c: $tType ).

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

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

thf(c_starc_decl,type,
    c_starc: c > c > c ).

thf(c_starb_decl,type,
    c_starb: b > b > b ).

thf(c_stara_decl,type,
    c_stara: a > a > a ).

thf(sk1_decl,type,
    sk1: a > b ).

thf(sk2_decl,type,
    sk2: a > c ).

thf(sk3_decl,type,
    sk3: b > c ).

thf(sk4_decl,type,
    sk4: b > a ).

thf(sk5_decl,type,
    sk5: b ).

thf(sk6_decl,type,
    sk6: b ).

thf(sk7_decl,type,
    sk7: c > $o ).

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: a > b] :
          ~ ! [B: a > c,C: b > c] :
              ( ( ! [D: a,E: c > $o] :
                    ( ( E @ ( C @ ( A @ D ) ) )
                   => ( E @ ( B @ D ) ) )
                & ! [D: b] :
                  ? [E: a] :
                  ! [F: b > $o] :
                    ( ( F @ ( A @ E ) )
                   => ( F @ D ) )
                & ! [D: a,E: a,F: b > $o] :
                    ( ( F @ ( A @ ( c_stara @ D @ E ) ) )
                   => ( F @ ( c_starb @ ( A @ D ) @ ( A @ E ) ) ) )
                & ! [D: a,E: a,F: c > $o] :
                    ( ( F @ ( B @ ( c_stara @ D @ E ) ) )
                   => ( F @ ( c_starc @ ( B @ D ) @ ( B @ E ) ) ) ) )
             => ! [D: b,E: b,F: c > $o] :
                  ( ( F @ ( C @ ( c_starb @ D @ E ) ) )
                 => ( F @ ( c_starc @ ( C @ D ) @ ( C @ E ) ) ) ) ) ) ) ).

thf(sk2_def,definition,
    ( sk2
    = ( @+[A: a > c] :
          ~ ! [B: b > c] :
              ( ( ! [C: a,D: c > $o] :
                    ( ( D @ ( B @ ( sk1 @ C ) ) )
                   => ( D @ ( A @ C ) ) )
                & ! [C: b] :
                  ? [D: a] :
                  ! [E: b > $o] :
                    ( ( E @ ( sk1 @ D ) )
                   => ( E @ C ) )
                & ! [C: a,D: a,E: b > $o] :
                    ( ( E @ ( sk1 @ ( c_stara @ C @ D ) ) )
                   => ( E @ ( c_starb @ ( sk1 @ C ) @ ( sk1 @ D ) ) ) )
                & ! [C: a,D: a,E: c > $o] :
                    ( ( E @ ( A @ ( c_stara @ C @ D ) ) )
                   => ( E @ ( c_starc @ ( A @ C ) @ ( A @ D ) ) ) ) )
             => ! [C: b,D: b,E: c > $o] :
                  ( ( E @ ( B @ ( c_starb @ C @ D ) ) )
                 => ( E @ ( c_starc @ ( B @ C ) @ ( B @ D ) ) ) ) ) ) ) ).

thf(sk3_def,definition,
    ( sk3
    = ( @+[A: b > c] :
          ~ ( ( ! [B: a,C: c > $o] :
                  ( ( C @ ( A @ ( sk1 @ B ) ) )
                 => ( C @ ( sk2 @ B ) ) )
              & ! [B: b] :
                ? [C: a] :
                ! [D: b > $o] :
                  ( ( D @ ( sk1 @ C ) )
                 => ( D @ B ) )
              & ! [B: a,C: a,D: b > $o] :
                  ( ( D @ ( sk1 @ ( c_stara @ B @ C ) ) )
                 => ( D @ ( c_starb @ ( sk1 @ B ) @ ( sk1 @ C ) ) ) )
              & ! [B: a,C: a,D: c > $o] :
                  ( ( D @ ( sk2 @ ( c_stara @ B @ C ) ) )
                 => ( D @ ( c_starc @ ( sk2 @ B ) @ ( sk2 @ C ) ) ) ) )
           => ! [B: b,C: b,D: c > $o] :
                ( ( D @ ( A @ ( c_starb @ B @ C ) ) )
               => ( D @ ( c_starc @ ( A @ B ) @ ( A @ C ) ) ) ) ) ) ) ).

thf(sk4_def,definition,
    ( sk4
    = ( ^ [A: b] :
        @+[B: a] :
        ! [C: b > $o] :
          ( ( C @ ( sk1 @ B ) )
         => ( C @ A ) ) ) ) ).

thf(sk5_def,definition,
    ( sk5
    = ( @+[A: b] :
          ~ ! [B: b,C: c > $o] :
              ( ( C @ ( sk3 @ ( c_starb @ A @ B ) ) )
             => ( C @ ( c_starc @ ( sk3 @ A ) @ ( sk3 @ B ) ) ) ) ) ) ).

thf(sk6_def,definition,
    ( sk6
    = ( @+[A: b] :
          ~ ! [B: c > $o] :
              ( ( B @ ( sk3 @ ( c_starb @ sk5 @ A ) ) )
             => ( B @ ( c_starc @ ( sk3 @ sk5 ) @ ( sk3 @ A ) ) ) ) ) ) ).

thf(sk7_def,definition,
    ( sk7
    = ( @+[A: c > $o] :
          ~ ( ( A @ ( sk3 @ ( c_starb @ sk5 @ sk6 ) ) )
           => ( A @ ( c_starc @ ( sk3 @ sk5 ) @ ( sk3 @ sk6 ) ) ) ) ) ) ).

thf(1,conjecture,
    ! [A: a > b,B: a > c,C: b > c] :
      ( ( ! [D: a,E: c > $o] :
            ( ( E @ ( C @ ( A @ D ) ) )
           => ( E @ ( B @ D ) ) )
        & ! [D: b] :
          ? [E: a] :
          ! [F: b > $o] :
            ( ( F @ ( A @ E ) )
           => ( F @ D ) )
        & ! [D: a,E: a,F: b > $o] :
            ( ( F @ ( A @ ( c_stara @ D @ E ) ) )
           => ( F @ ( c_starb @ ( A @ D ) @ ( A @ E ) ) ) )
        & ! [D: a,E: a,F: c > $o] :
            ( ( F @ ( B @ ( c_stara @ D @ E ) ) )
           => ( F @ ( c_starc @ ( B @ D ) @ ( B @ E ) ) ) ) )
     => ! [D: b,E: b,F: c > $o] :
          ( ( F @ ( C @ ( c_starb @ D @ E ) ) )
         => ( F @ ( c_starc @ ( C @ D ) @ ( C @ E ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM270_INST) ).

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

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

thf(4,plain,
    ! [J: c > $o,I: a,H: a,G: b > $o,F: a,E: a,D: b > $o,C: b,B: c > $o,A: a] :
      ( ( ~ ( B @ ( sk3 @ ( sk1 @ A ) ) )
        | ( B @ ( sk2 @ A ) ) )
      & ( ~ ( D @ ( sk1 @ ( sk4 @ C ) ) )
        | ( D @ C ) )
      & ( ~ ( G @ ( sk1 @ ( c_stara @ E @ F ) ) )
        | ( G @ ( c_starb @ ( sk1 @ E ) @ ( sk1 @ F ) ) ) )
      & ( ~ ( J @ ( sk2 @ ( c_stara @ H @ I ) ) )
        | ( J @ ( c_starc @ ( sk2 @ H ) @ ( sk2 @ I ) ) ) )
      & ( sk7 @ ( sk3 @ ( c_starb @ sk5 @ sk6 ) ) )
      & ~ ( sk7 @ ( c_starc @ ( sk3 @ sk5 ) @ ( sk3 @ sk6 ) ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(10,plain,
    ! [C: b > $o,B: a,A: a] :
      ( ~ ( C @ ( sk1 @ ( c_stara @ A @ B ) ) )
      | ( C @ ( c_starb @ ( sk1 @ A ) @ ( sk1 @ B ) ) ) ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(12,plain,
    ! [B: a,A: a] :
      ( ( ( sk1 @ ( c_stara @ A @ B ) )
       != ( sk1 @ ( c_stara @ A @ B ) ) )
      | ( ( sk1 @ ( c_stara @ A @ B ) )
        = ( c_starb @ ( sk1 @ A ) @ ( sk1 @ B ) ) ) ),
    inference(replace_leibeq,[status(thm)],[10:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( (=) @ b @ ( sk1 @ ( c_stara @ A @ B ) ) ))]]) ).

thf(22,plain,
    ! [B: a,A: a] :
      ( ( ( sk1 @ ( c_stara @ A @ B ) )
       != ( sk1 @ ( c_stara @ A @ B ) ) )
      | ( ( sk1 @ ( c_stara @ A @ B ) )
        = ( c_starb @ ( sk1 @ A ) @ ( sk1 @ B ) ) ) ),
    inference(lifteq,[status(thm)],[12]) ).

thf(23,plain,
    ! [B: a,A: a] :
      ( ( sk1 @ ( c_stara @ A @ B ) )
      = ( c_starb @ ( sk1 @ A ) @ ( sk1 @ B ) ) ),
    inference(simp,[status(thm)],[22]) ).

thf(9,plain,
    ! [B: c > $o,A: a] :
      ( ~ ( B @ ( sk3 @ ( sk1 @ A ) ) )
      | ( B @ ( sk2 @ A ) ) ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(14,plain,
    ! [A: a] :
      ( ( ( sk3 @ ( sk1 @ A ) )
       != ( sk3 @ ( sk1 @ A ) ) )
      | ( ( sk3 @ ( sk1 @ A ) )
        = ( sk2 @ A ) ) ),
    inference(replace_leibeq,[status(thm)],[9:[bind(A,$thf( A )),bind(B,$thf( (=) @ c @ ( sk3 @ ( sk1 @ A ) ) ))]]) ).

thf(17,plain,
    ! [A: a] :
      ( ( ( sk3 @ ( sk1 @ A ) )
       != ( sk3 @ ( sk1 @ A ) ) )
      | ( ( sk3 @ ( sk1 @ A ) )
        = ( sk2 @ A ) ) ),
    inference(lifteq,[status(thm)],[14]) ).

thf(18,plain,
    ! [A: a] :
      ( ( sk3 @ ( sk1 @ A ) )
      = ( sk2 @ A ) ),
    inference(simp,[status(thm)],[17]) ).

thf(8,plain,
    sk7 @ ( sk3 @ ( c_starb @ sk5 @ sk6 ) ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(6,plain,
    ! [C: c > $o,B: a,A: a] :
      ( ~ ( C @ ( sk2 @ ( c_stara @ A @ B ) ) )
      | ( C @ ( c_starc @ ( sk2 @ A ) @ ( sk2 @ B ) ) ) ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(19,plain,
    ! [C: c > $o,B: a,A: a] :
      ( ~ ( C @ ( sk2 @ ( c_stara @ A @ B ) ) )
      | ( C @ ( c_starc @ ( sk2 @ A ) @ ( sk2 @ B ) ) ) ),
    inference(simp,[status(thm)],[6]) ).

thf(5,plain,
    ! [B: b > $o,A: b] :
      ( ~ ( B @ ( sk1 @ ( sk4 @ A ) ) )
      | ( B @ A ) ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(11,plain,
    ! [A: b] :
      ( ( ( sk1 @ ( sk4 @ A ) )
       != ( sk1 @ ( sk4 @ A ) ) )
      | ( ( sk1 @ ( sk4 @ A ) )
        = A ) ),
    inference(replace_leibeq,[status(thm)],[5:[bind(A,$thf( A )),bind(B,$thf( (=) @ b @ ( sk1 @ ( sk4 @ A ) ) ))]]) ).

thf(24,plain,
    ! [A: b] :
      ( ( ( sk1 @ ( sk4 @ A ) )
       != ( sk1 @ ( sk4 @ A ) ) )
      | ( ( sk1 @ ( sk4 @ A ) )
        = A ) ),
    inference(lifteq,[status(thm)],[11]) ).

thf(25,plain,
    ! [A: b] :
      ( ( sk1 @ ( sk4 @ A ) )
      = A ),
    inference(simp,[status(thm)],[24]) ).

thf(30,plain,
    ! [C: c > $o,B: a,A: b] :
      ( ~ ( C @ ( sk3 @ A ) )
      | ( C @ ( sk2 @ B ) )
      | ( ( sk1 @ ( sk4 @ A ) )
       != ( sk1 @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[25,9]) ).

thf(31,plain,
    ! [B: b,A: c > $o] :
      ( ~ ( A @ ( sk3 @ B ) )
      | ( A @ ( sk2 @ ( sk4 @ B ) ) ) ),
    inference(pattern_uni,[status(thm)],[30:[bind(A,$thf( D )),bind(B,$thf( sk4 @ D ))]]) ).

thf(39,plain,
    ! [A: b] :
      ( ( ( sk3 @ A )
       != ( sk3 @ A ) )
      | ( ( sk3 @ A )
        = ( sk2 @ ( sk4 @ A ) ) ) ),
    inference(replace_leibeq,[status(thm)],[31:[bind(A,$thf( (=) @ c @ ( sk3 @ B ) ))]]) ).

thf(40,plain,
    ! [A: b] :
      ( ( ( sk3 @ A )
       != ( sk3 @ A ) )
      | ( ( sk3 @ A )
        = ( sk2 @ ( sk4 @ A ) ) ) ),
    inference(lifteq,[status(thm)],[39]) ).

thf(42,plain,
    ! [A: b] :
      ( ( sk3 @ A )
      = ( sk2 @ ( sk4 @ A ) ) ),
    inference(pattern_uni,[status(thm)],[40:[]]) ).

thf(51,plain,
    ! [A: b] :
      ( ( sk3 @ A )
      = ( sk2 @ ( sk4 @ A ) ) ),
    inference(simp,[status(thm)],[42]) ).

thf(7,plain,
    ~ ( sk7 @ ( c_starc @ ( sk3 @ sk5 ) @ ( sk3 @ sk6 ) ) ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(77,plain,
    ! [A: b] :
      ( ~ ( sk7 @ ( c_starc @ ( sk3 @ sk5 ) @ ( sk2 @ ( sk4 @ A ) ) ) )
      | ( ( sk3 @ A )
       != ( sk3 @ sk6 ) ) ),
    inference(paramod_ordered,[status(thm)],[51,7]) ).

thf(78,plain,
    ~ ( sk7 @ ( c_starc @ ( sk3 @ sk5 ) @ ( sk2 @ ( sk4 @ sk6 ) ) ) ),
    inference(pattern_uni,[status(thm)],[77:[bind(A,$thf( sk6 ))]]) ).

thf(146,plain,
    ! [A: b] :
      ( ~ ( sk7 @ ( c_starc @ ( sk2 @ ( sk4 @ A ) ) @ ( sk2 @ ( sk4 @ sk6 ) ) ) )
      | ( ( sk3 @ A )
       != ( sk3 @ sk5 ) ) ),
    inference(paramod_ordered,[status(thm)],[51,78]) ).

thf(147,plain,
    ~ ( sk7 @ ( c_starc @ ( sk2 @ ( sk4 @ sk5 ) ) @ ( sk2 @ ( sk4 @ sk6 ) ) ) ),
    inference(pattern_uni,[status(thm)],[146:[bind(A,$thf( sk5 ))]]) ).

thf(245,plain,
    ! [C: c > $o,B: a,A: a] :
      ( ~ ( C @ ( sk2 @ ( c_stara @ A @ B ) ) )
      | ~ $true
      | ( ( C @ ( c_starc @ ( sk2 @ A ) @ ( sk2 @ B ) ) )
       != ( sk7 @ ( c_starc @ ( sk2 @ ( sk4 @ sk5 ) ) @ ( sk2 @ ( sk4 @ sk6 ) ) ) ) ) ),
    inference(paramod_ordered,[status(thm)],[19,147]) ).

thf(246,plain,
    ! [C: c > $o,B: a,A: a] :
      ( ~ ( C @ ( sk2 @ ( c_stara @ A @ B ) ) )
      | ( ( C @ ( c_starc @ ( sk2 @ A ) @ ( sk2 @ B ) ) )
       != ( sk7 @ ( c_starc @ ( sk2 @ ( sk4 @ sk5 ) ) @ ( sk2 @ ( sk4 @ sk6 ) ) ) ) ) ),
    inference(simp,[status(thm)],[245]) ).

thf(286,plain,
    ~ ( sk7 @ ( sk2 @ ( c_stara @ ( sk4 @ sk5 ) @ ( sk4 @ sk6 ) ) ) ),
    inference(pre_uni,[status(thm)],[246:[bind(A,$thf( sk4 @ sk5 )),bind(B,$thf( sk4 @ sk6 )),bind(C,$thf( sk7 ))]]) ).

thf(312,plain,
    ( ~ $true
    | ( ( sk7 @ ( sk3 @ ( c_starb @ sk5 @ sk6 ) ) )
     != ( sk7 @ ( sk2 @ ( c_stara @ ( sk4 @ sk5 ) @ ( sk4 @ sk6 ) ) ) ) ) ),
    inference(paramod_ordered,[status(thm)],[8,286]) ).

thf(313,plain,
    ( ( sk7 @ ( sk3 @ ( c_starb @ sk5 @ sk6 ) ) )
   != ( sk7 @ ( sk2 @ ( c_stara @ ( sk4 @ sk5 ) @ ( sk4 @ sk6 ) ) ) ) ),
    inference(simp,[status(thm)],[312]) ).

thf(320,plain,
    ( ( sk3 @ ( c_starb @ sk5 @ sk6 ) )
   != ( sk2 @ ( c_stara @ ( sk4 @ sk5 ) @ ( sk4 @ sk6 ) ) ) ),
    inference(simp,[status(thm)],[313]) ).

thf(335,plain,
    ! [A: a] :
      ( ( ( sk2 @ A )
       != ( sk2 @ ( c_stara @ ( sk4 @ sk5 ) @ ( sk4 @ sk6 ) ) ) )
      | ( ( sk3 @ ( sk1 @ A ) )
       != ( sk3 @ ( c_starb @ sk5 @ sk6 ) ) ) ),
    inference(paramod_ordered,[status(thm)],[18,320]) ).

thf(342,plain,
    ! [A: a] :
      ( ( A
       != ( c_stara @ ( sk4 @ sk5 ) @ ( sk4 @ sk6 ) ) )
      | ( ( sk1 @ A )
       != ( c_starb @ sk5 @ sk6 ) ) ),
    inference(simp,[status(thm)],[335]) ).

thf(348,plain,
    ( ( sk1 @ ( c_stara @ ( sk4 @ sk5 ) @ ( sk4 @ sk6 ) ) )
   != ( c_starb @ sk5 @ sk6 ) ),
    inference(simp,[status(thm)],[342]) ).

thf(442,plain,
    ! [B: a,A: a] :
      ( ( ( c_starb @ ( sk1 @ A ) @ ( sk1 @ B ) )
       != ( c_starb @ sk5 @ sk6 ) )
      | ( ( sk1 @ ( c_stara @ A @ B ) )
       != ( sk1 @ ( c_stara @ ( sk4 @ sk5 ) @ ( sk4 @ sk6 ) ) ) ) ),
    inference(paramod_ordered,[status(thm)],[23,348]) ).

thf(443,plain,
    ( ( c_starb @ ( sk1 @ ( sk4 @ sk5 ) ) @ ( sk1 @ ( sk4 @ sk6 ) ) )
   != ( c_starb @ sk5 @ sk6 ) ),
    inference(pattern_uni,[status(thm)],[442:[bind(A,$thf( sk4 @ sk5 )),bind(B,$thf( sk4 @ sk6 ))]]) ).

thf(506,plain,
    ( ( c_starb @ sk5 @ sk6 )
   != ( c_starb @ sk5 @ sk6 ) ),
    inference(rewrite,[status(thm)],[443,25]) ).

thf(507,plain,
    $false,
    inference(simp,[status(thm)],[506]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO334^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.11/0.20  % Computer : n008.cluster.edu
% 0.11/0.20  % Model    : x86_64 x86_64
% 0.11/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.20  % Memory   : 8046.5625MB
% 0.11/0.20  % OS       : Linux 6.8.0-71-generic
% 0.11/0.20  % CPULimit : 300
% 0.11/0.20  % WCLimit  : 300
% 0.11/0.20  % DateTime : Tue Sep 29 16:47:09 UTC 2026
% 0.11/0.21  % CPUTime  : 
% 0.11/0.21  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.87/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.18/0.98  % [INFO] 	 Parsing done (189ms). 
% 1.18/1.00  % [INFO] 	 Running in sequential loop mode. 
% 1.94/1.42  % [INFO] 	 eprover registered as external prover. 
% 1.94/1.43  % [INFO] 	 Scanning for conjecture ... 
% 2.13/1.54  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.13/1.59  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.13/1.59  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.13/1.59  % [INFO] 	 Type checking passed. 
% 2.32/1.60  % [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 ... 
% 9.43/3.60  % [INFO] 	 Killing All external provers ... 
% 9.43/3.61  % Time passed: 3256ms (effective reasoning time: 2599ms)
% 9.43/3.61  % 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)>
% 9.43/3.61  % Axioms used in derivation (0): 
% 9.43/3.61  % No. of inferences in proof: 43
% 9.43/3.61  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3256 ms resp. 2599 ms w/o parsing
% 9.43/3.68  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.43/3.68  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------