↑ 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  : SEV603^1 : TPTP v9.3.1. Released v9.3.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 : n010.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:25 AM UTC 2026

% Result   : Theorem 4.05s 2.20s
% Output   : Refutation 4.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   13 (  11 unt;   0 typ;   1 def)
%            Number of atoms       :   50 (  17 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :   75 (   5   ~;   2   |;   0   &;  68   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   2 con; 0-4 aty)
%            Number of variables   :   27 (   0   ^;  26   !;   0   ?;  27   :)
%                                         (   0  !>;   0  ?*;   0  @-;   1  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(skt1_type,type,
    skt1: $tType ).

thf(in_decl,type,
    in: 
      !>[TA: $tType] : ( TA > ( TA > $o ) > $o ) ).

thf(univ_decl,type,
    univ: 
      !>[TA: $tType] : ( TA > $o ) ).

thf(insert_decl,type,
    insert: 
      !>[TA: $tType] : ( TA > ( TA > $o ) > TA > $o ) ).

thf(sk1_decl,type,
    sk1: skt1 ).

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: skt1] :
          ( ( insert @ skt1 @ A @ ( univ @ skt1 ) )
         != ( univ @ skt1 ) ) ) ) ).

thf(5,axiom,
    ! [TA: $tType,A: TA > $o,B: TA > $o] :
      ( ( A = B )
      = ( ! [C: TA] :
            ( ( in @ TA @ C @ A )
            = ( in @ TA @ C @ B ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred_set/EXTENSION_') ).

thf(14,plain,
    ! [TA: $tType,A: TA > $o,B: TA > $o] :
      ( ( A = B )
      = ( ! [C: TA] :
            ( ( in @ TA @ C @ A )
            = ( in @ TA @ C @ B ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(1,conjecture,
    ! [TA: $tType,A: TA] :
      ( ( insert @ TA @ A @ ( univ @ TA ) )
      = ( univ @ TA ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred_set/INSERT_UNIV_') ).

thf(2,negated_conjecture,
    ~ ! [TA: $tType,A: TA] :
        ( ( insert @ TA @ A @ ( univ @ TA ) )
        = ( univ @ TA ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(6,plain,
    ~ ! [TA: $tType,A: TA] :
        ( ( insert @ TA @ A @ ( univ @ TA ) )
        = ( univ @ TA ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    ! [TA: $tType,A: TA,B: TA,C: TA > $o] :
      ( ( in @ TA @ A @ ( insert @ TA @ B @ C ) )
      = ( ( A = B )
        | ( in @ TA @ A @ C ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred_set/IN_INSERT_') ).

thf(9,plain,
    ! [TA: $tType,A: TA,B: TA,C: TA > $o] :
      ( ( in @ TA @ A @ ( insert @ TA @ B @ C ) )
      = ( ( A = B )
        | ( in @ TA @ A @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(4,axiom,
    ! [TA: $tType,A: TA] : ( in @ TA @ A @ ( univ @ TA ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred_set/IN_UNIV_') ).

thf(12,plain,
    ! [TA: $tType,A: TA] : ( in @ TA @ A @ ( univ @ TA ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(7,plain,
    ( ( insert @ skt1 @ sk1 @ ( univ @ skt1 ) )
   != ( univ @ skt1 ) ),
    inference(cnf,[status(esa)],[6]) ).

thf(8,plain,
    ( ( insert @ skt1 @ sk1 @ ( univ @ skt1 ) )
   != ( univ @ skt1 ) ),
    inference(lifteq,[status(thm)],[7]) ).

thf(29,plain,
    $false,
    inference(e,[status(thm)],[14,6,9,12,8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEV603^1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.07  % 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.12/0.21  % Computer : n010.cluster.edu
% 0.12/0.21  % Model    : x86_64 x86_64
% 0.12/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.21  % Memory   : 8046.5625MB
% 0.12/0.21  % OS       : Linux 6.8.0-71-generic
% 0.12/0.21  % CPULimit : 300
% 0.12/0.21  % WCLimit  : 300
% 0.12/0.21  % DateTime : Tue Sep 29 16:00:03 UTC 2026
% 0.12/0.22  % CPUTime  : 
% 0.12/0.22  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.95/0.71  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.14/0.89  % [INFO] 	 Parsing done (176ms). 
% 1.32/0.90  % [INFO] 	 Running in sequential loop mode. 
% 1.95/1.31  % [INFO] 	 eprover registered as external prover. 
% 1.95/1.32  % [INFO] 	 Scanning for conjecture ... 
% 2.12/1.41  % [INFO] 	 Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ... 
% 2.12/1.45  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 2.12/1.46  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.12/1.47  % [INFO] 	 Type checking passed. 
% 2.12/1.47  % [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.05/2.20  % External prover 'e' found a proof!
% 4.05/2.20  % [INFO] 	 Killing All external provers ... 
% 4.05/2.20  % Time passed: 1885ms (effective reasoning time: 1294ms)
% 4.05/2.20  % 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.05/2.20  % Axioms used in derivation (3): pred_set/EXTENSION_, pred_set/IN_INSERT_, pred_set/IN_UNIV_
% 4.05/2.20  % No. of inferences in proof: 12
% 4.05/2.20  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1885 ms resp. 1294 ms w/o parsing
% 4.05/2.26  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.05/2.26  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------