↑ 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  : SEV228^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 : n017.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:37:02 AM UTC 2026

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

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

thf(cS_decl,type,
    cS: a > $o ).

thf(sk1_decl,type,
    sk1: a ).

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

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

thf(sk2_def,definition,
    ( sk2
    = ( ^ [A: a > $o] :
        @+[B: a] :
          ~ ( ( A @ B )
           => ( cS @ B ) ) ) ) ).

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

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

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

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

thf(5,plain,
    cS @ sk1,
    inference(cnfConj,[status(thm)],[4]) ).

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

thf(8,plain,
    ( ( sk1
      = ( sk2 @ ( (=) @ a @ sk1 ) ) )
    | ( sk1 != sk1 ) ),
    inference(replace_leibeq,[status(thm)],[6:[bind(A,$thf( (=) @ a @ sk1 ))]]) ).

thf(9,plain,
    ( ( ( sk2 @ ( (=) @ a @ sk1 ) )
      = sk1 )
    | ( sk1 != sk1 ) ),
    inference(lifteq,[status(thm)],[8]) ).

thf(10,plain,
    ( ( sk2 @ ( (=) @ a @ sk1 ) )
    = sk1 ),
    inference(simp,[status(thm)],[9]) ).

thf(39,plain,
    $false,
    inference(e,[status(thm)],[3,5,10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV228^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.22  % Computer : n017.cluster.edu
% 0.10/0.22  % Model    : x86_64 x86_64
% 0.10/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.22  % Memory   : 8046.5625MB
% 0.10/0.22  % OS       : Linux 6.8.0-71-generic
% 0.10/0.22  % CPULimit : 300
% 0.10/0.22  % WCLimit  : 300
% 0.10/0.22  % DateTime : Tue Sep 29 15:18:37 UTC 2026
% 0.10/0.22  % CPUTime  : 
% 0.10/0.22  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.89/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.24/0.97  % [INFO] 	 Parsing done (174ms). 
% 1.24/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.84/1.38  % [INFO] 	 eprover registered as external prover. 
% 1.84/1.39  % [INFO] 	 Scanning for conjecture ... 
% 2.04/1.47  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.22/1.50  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.22/1.50  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.22/1.51  % [INFO] 	 Type checking passed. 
% 2.22/1.52  % [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.85/2.23  % External prover 'e' found a proof!
% 3.85/2.23  % [INFO] 	 Killing All external provers ... 
% 3.85/2.23  % Time passed: 1863ms (effective reasoning time: 1241ms)
% 3.85/2.23  % 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.85/2.23  % Axioms used in derivation (0): 
% 3.85/2.23  % No. of inferences in proof: 10
% 3.85/2.23  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1863 ms resp. 1241 ms w/o parsing
% 3.85/2.28  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.85/2.28  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------