↑ 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  : SEV083^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 : n011.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:49 AM UTC 2026

% Result   : Theorem 4.36s 2.35s
% Output   : Refutation 4.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (  10 unt;   0 typ;   4 def)
%            Number of atoms       :  162 (  61 equ;  34 cnn)
%            Maximal formula atoms :   18 (   7 avg)
%            Number of connectives :  258 (  28   ~;  24   |;  16   &; 184   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   97 (  97   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   60 (  34   ^;  19   !;   3   ?;  60   :)
%                                         (   0  !>;   0  ?*;   0  @-;   4  @+)

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

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

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

thf(sk4_decl,type,
    sk4: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).

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

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

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

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

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

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

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

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

thf(7,plain,
    ! [A: ( $i > $o ) > ( $i > $o ) > $o] :
      ( ( A
        @ ^ [B: $i] : $true
        @ ^ [B: $i] : $false )
      | ~ ( A @ ( sk1 @ A ) @ ( sk1 @ A ) )
      | ~ ( A @ ( sk2 @ A ) @ ( sk4 @ A ) ) ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(10,plain,
    ( ( ( ^ [A: $i] : $true )
      = ( ^ [A: $i] : $false ) )
    | ( ( sk1 @ ( (=) @ ( $i > $o ) ) )
     != ( sk1 @ ( (=) @ ( $i > $o ) ) ) )
    | ( ( sk2 @ ( (=) @ ( $i > $o ) ) )
     != ( sk4 @ ( (=) @ ( $i > $o ) ) ) ) ),
    inference(replace_andrewseq,[status(thm)],[7:[bind(A,$thf( (=) @ ( $i > $o ) ))]]) ).

thf(11,plain,
    ( ( ( ^ [A: $i] : $false )
      = ( ^ [A: $i] : $true ) )
    | ( ( sk1 @ ( (=) @ ( $i > $o ) ) )
     != ( sk1 @ ( (=) @ ( $i > $o ) ) ) )
    | ( ( sk4 @ ( (=) @ ( $i > $o ) ) )
     != ( sk2 @ ( (=) @ ( $i > $o ) ) ) ) ),
    inference(lifteq,[status(thm)],[10]) ).

thf(12,plain,
    ( ( sk4 @ ( (=) @ ( $i > $o ) ) )
   != ( sk2 @ ( (=) @ ( $i > $o ) ) ) ),
    inference(simp,[status(thm)],[11]) ).

thf(6,plain,
    ! [A: ( $i > $o ) > ( $i > $o ) > $o] :
      ( ( A
        @ ^ [B: $i] : $true
        @ ^ [B: $i] : $false )
      | ~ ( A @ ( sk1 @ A ) @ ( sk1 @ A ) )
      | ( A @ ( sk3 @ A ) @ ( sk4 @ A ) ) ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(9,plain,
    ( ( ( ^ [A: $i] : $true )
      = ( ^ [A: $i] : $false ) )
    | ( ( sk1 @ ( (=) @ ( $i > $o ) ) )
     != ( sk1 @ ( (=) @ ( $i > $o ) ) ) )
    | ( ( sk3 @ ( (=) @ ( $i > $o ) ) )
      = ( sk4 @ ( (=) @ ( $i > $o ) ) ) ) ),
    inference(replace_andrewseq,[status(thm)],[6:[bind(A,$thf( (=) @ ( $i > $o ) ))]]) ).

thf(13,plain,
    ( ( ( ^ [A: $i] : $false )
      = ( ^ [A: $i] : $true ) )
    | ( ( sk1 @ ( (=) @ ( $i > $o ) ) )
     != ( sk1 @ ( (=) @ ( $i > $o ) ) ) )
    | ( ( sk4 @ ( (=) @ ( $i > $o ) ) )
      = ( sk3 @ ( (=) @ ( $i > $o ) ) ) ) ),
    inference(lifteq,[status(thm)],[9]) ).

thf(14,plain,
    ( ( sk4 @ ( (=) @ ( $i > $o ) ) )
    = ( sk3 @ ( (=) @ ( $i > $o ) ) ) ),
    inference(simp,[status(thm)],[13]) ).

thf(18,plain,
    ( ( sk3 @ ( (=) @ ( $i > $o ) ) )
   != ( sk2 @ ( (=) @ ( $i > $o ) ) ) ),
    inference(rewrite,[status(thm)],[12,14]) ).

thf(5,plain,
    ! [A: ( $i > $o ) > ( $i > $o ) > $o] :
      ( ( A
        @ ^ [B: $i] : $true
        @ ^ [B: $i] : $false )
      | ~ ( A @ ( sk1 @ A ) @ ( sk1 @ A ) )
      | ( A @ ( sk2 @ A ) @ ( sk3 @ A ) ) ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(8,plain,
    ( ( ( ^ [A: $i] : $true )
      = ( ^ [A: $i] : $false ) )
    | ( ( sk1 @ ( (=) @ ( $i > $o ) ) )
     != ( sk1 @ ( (=) @ ( $i > $o ) ) ) )
    | ( ( sk2 @ ( (=) @ ( $i > $o ) ) )
      = ( sk3 @ ( (=) @ ( $i > $o ) ) ) ) ),
    inference(replace_andrewseq,[status(thm)],[5:[bind(A,$thf( (=) @ ( $i > $o ) ))]]) ).

thf(15,plain,
    ( ( ( ^ [A: $i] : $false )
      = ( ^ [A: $i] : $true ) )
    | ( ( sk1 @ ( (=) @ ( $i > $o ) ) )
     != ( sk1 @ ( (=) @ ( $i > $o ) ) ) )
    | ( ( sk3 @ ( (=) @ ( $i > $o ) ) )
      = ( sk2 @ ( (=) @ ( $i > $o ) ) ) ) ),
    inference(lifteq,[status(thm)],[8]) ).

thf(16,plain,
    ( ( sk3 @ ( (=) @ ( $i > $o ) ) )
    = ( sk2 @ ( (=) @ ( $i > $o ) ) ) ),
    inference(simp,[status(thm)],[15]) ).

thf(22,plain,
    ( ( sk2 @ ( (=) @ ( $i > $o ) ) )
   != ( sk2 @ ( (=) @ ( $i > $o ) ) ) ),
    inference(rewrite,[status(thm)],[18,16]) ).

thf(23,plain,
    $false,
    inference(simp,[status(thm)],[22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV083^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % 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.09/0.21  % Computer : n011.cluster.edu
% 0.09/0.21  % Model    : x86_64 x86_64
% 0.09/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21  % Memory   : 8046.5625MB
% 0.09/0.21  % OS       : Linux 6.8.0-71-generic
% 0.09/0.21  % CPULimit : 300
% 0.09/0.21  % WCLimit  : 300
% 0.09/0.21  % DateTime : Tue Sep 29 15:09:48 UTC 2026
% 0.09/0.21  % CPUTime  : 
% 0.09/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.89/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.24/0.98  % [INFO] 	 Parsing done (191ms). 
% 1.24/1.00  % [INFO] 	 Running in sequential loop mode. 
% 2.04/1.40  % [INFO] 	 eprover registered as external prover. 
% 2.04/1.41  % [INFO] 	 Scanning for conjecture ... 
% 2.23/1.50  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.23/1.53  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.23/1.53  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.23/1.54  % [INFO] 	 Type checking passed. 
% 2.23/1.54  % [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.36/2.34  % [INFO] 	 Killing All external provers ... 
% 4.36/2.34  % Time passed: 1988ms (effective reasoning time: 1337ms)
% 4.36/2.34  % 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.36/2.34  % Axioms used in derivation (0): 
% 4.36/2.34  % No. of inferences in proof: 19
% 4.36/2.35  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1988 ms resp. 1337 ms w/o parsing
% 4.77/2.46  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.77/2.46  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------