↑ 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  : SET175^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 : n004.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:22:55 AM UTC 2026

% Result   : Theorem 3.25s 2.04s
% Output   : Refutation 3.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (  10 unt;   0 typ;   2 def)
%            Number of atoms       :   43 (  10 equ;   0 cnn)
%            Maximal formula atoms :    5 (   3 avg)
%            Number of connectives :   81 (  17   ~;  15   |;  11   &;  38   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   16 (   7   ^;   7   !;   0   ?;  16   :)
%                                         (   0  !>;   0  ?*;   0  @-;   2  @+)

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

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

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

thf(sk3_decl,type,
    sk3: a ).

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

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

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

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

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

thf(4,plain,
    ( ( ^ [A: a] :
          ( ( sk1 @ A )
          | ( ( sk1 @ A )
            & ( sk2 @ A ) ) ) )
   != sk1 ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ( ( ^ [A: a] :
          ( ( sk1 @ A )
          | ( ( sk1 @ A )
            & ( sk2 @ A ) ) ) )
   != sk1 ),
    inference(lifteq,[status(thm)],[4]) ).

thf(6,plain,
    ( ( ( sk1 @ sk3 )
      | ( ( sk1 @ sk3 )
        & ( sk2 @ sk3 ) ) )
   != ( sk1 @ sk3 ) ),
    inference(func_ext,[status(esa)],[5]) ).

thf(7,plain,
    ( ~ ( ( sk1 @ sk3 )
        | ( ( sk1 @ sk3 )
          & ( sk2 @ sk3 ) ) )
    | ~ ( sk1 @ sk3 ) ),
    inference(bool_ext,[status(thm)],[6]) ).

thf(9,plain,
    ( ( ~ ( sk1 @ sk3 )
      | ~ ( sk1 @ sk3 ) )
    & ( ~ ( sk1 @ sk3 )
      | ~ ( sk2 @ sk3 )
      | ~ ( sk1 @ sk3 ) ) ),
    inference(cnf,[status(esa)],[7]) ).

thf(10,plain,
    ( ~ ( sk1 @ sk3 )
    | ~ ( sk1 @ sk3 ) ),
    inference(cnfConj,[status(thm)],[9]) ).

thf(12,plain,
    ~ ( sk1 @ sk3 ),
    inference(simp,[status(thm)],[10]) ).

thf(19,plain,
    ( $false
    | ( $false
      & ( sk2 @ sk3 ) ) ),
    inference(rewrite,[status(thm)],[6,12]) ).

thf(20,plain,
    $false,
    inference(simp,[status(thm)],[19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET175^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 : n004.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 13:37:07 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.86/0.77  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.16/0.95  % [INFO] 	 Parsing done (175ms). 
% 1.16/0.96  % [INFO] 	 Running in sequential loop mode. 
% 1.72/1.36  % [INFO] 	 eprover registered as external prover. 
% 1.72/1.37  % [INFO] 	 Scanning for conjecture ... 
% 1.91/1.45  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.91/1.48  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.91/1.48  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.91/1.48  % [INFO] 	 Type checking passed. 
% 1.91/1.49  % [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.25/2.04  % [INFO] 	 Killing All external provers ... 
% 3.25/2.04  % Time passed: 1698ms (effective reasoning time: 1074ms)
% 3.25/2.04  % 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.25/2.04  % Axioms used in derivation (0): 
% 3.25/2.04  % No. of inferences in proof: 12
% 3.25/2.04  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1698 ms resp. 1074 ms w/o parsing
% 3.25/2.09  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.25/2.09  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------