↑ 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  : SYP117^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 : n007.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:50:40 AM UTC 2026

% Result   : Theorem 3.42s 2.06s
% Output   : Refutation 3.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (  13 unt;   0 typ;   1 def)
%            Number of atoms       :   16 (  15 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   31 (   8   ~;   1   |;   0   &;  22   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   2 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (   4   ^;  13   !;   0   ?;  18   :)
%                                         (   0  !>;   0  ?*;   0  @-;   1  @+)

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

thf(i_decl,type,
    i: 
      !>[TA: $tType] : ( TA > TA ) ).

thf(sk1_decl,type,
    sk1: skt1 ).

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

thf(3,axiom,
    ! [TA: $tType] :
      ( ( i @ TA )
      = ( ^ [A: TA] : A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','trivia/I_DEF_') ).

thf(7,plain,
    ! [TA: $tType] :
      ( ( i @ TA )
      = ( ^ [A: TA] : A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(8,plain,
    ! [TA: $tType] :
      ( ( i @ TA )
      = ( ^ [A: TA] : A ) ),
    inference(cnf,[status(esa)],[7]) ).

thf(9,plain,
    ! [TA: $tType] :
      ( ( i @ TA )
      = ( ^ [A: TA] : A ) ),
    inference(lifteq,[status(thm)],[8]) ).

thf(10,plain,
    ! [TA: $tType,A: TA] :
      ( ( i @ TA @ A )
      = A ),
    inference(func_ext,[status(esa)],[9]) ).

thf(1,conjecture,
    ! [TA: $tType,A: TA] :
      ( ( i @ TA @ A )
      = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','trivia/I_THM_') ).

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

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

thf(5,plain,
    ( ( i @ skt1 @ sk1 )
   != sk1 ),
    inference(cnf,[status(esa)],[4]) ).

thf(6,plain,
    ( ( i @ skt1 @ sk1 )
   != sk1 ),
    inference(lifteq,[status(thm)],[5]) ).

thf(11,plain,
    ! [A: skt1] :
      ( ( A != sk1 )
      | ( ( i @ skt1 @ A )
       != ( i @ skt1 @ sk1 ) ) ),
    inference(paramod_ordered,[status(thm)],[10,6]) ).

thf(12,plain,
    sk1 != sk1,
    inference(pattern_uni,[status(thm)],[11:[bind(A,$thf( sk1 ))]]) ).

thf(15,plain,
    $false,
    inference(simp,[status(thm)],[12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYP117^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.08/0.19  % Computer : n007.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 17:26:40 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  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.87/0.77  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.19/0.94  % [INFO] 	 Parsing done (170ms). 
% 1.19/0.96  % [INFO] 	 Running in sequential loop mode. 
% 1.79/1.37  % [INFO] 	 eprover registered as external prover. 
% 1.79/1.37  % [INFO] 	 Scanning for conjecture ... 
% 1.99/1.43  % [INFO] 	 No direction of definition trivia/I_DEF_ detected. Treating as axiom ... 
% 1.99/1.46  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 2.16/1.50  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 2.16/1.50  % [INFO] 	 No direction of definition trivia/I_DEF_ detected. Treating as axiom ... 
% 2.16/1.50  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.16/1.51  % [INFO] 	 Type checking passed. 
% 2.16/1.51  % [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.42/2.06  % [INFO] 	 Killing All external provers ... 
% 3.42/2.06  % Time passed: 1719ms (effective reasoning time: 1093ms)
% 3.42/2.06  % 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.42/2.06  % Axioms used in derivation (1): trivia/I_DEF_
% 3.42/2.06  % No. of inferences in proof: 13
% 3.42/2.06  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1719 ms resp. 1093 ms w/o parsing
% 3.42/2.11  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.42/2.11  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------