↑ 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  : SEU568^2 : TPTP v9.3.1. Released v3.7.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 : 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:28:34 AM UTC 2026

% Result   : Theorem 3.30s 2.07s
% Output   : Refutation 3.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   16 (  12 unt;   0 typ;   5 def)
%            Number of atoms       :   54 (  17 equ;   0 cnn)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  120 (  31   ~;   3   |;   4   &;  58   @)
%                                         (   0 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   30 (   0   ^;  27   !;   0   ?;  30   :)
%                                         (   0  !>;   0  ?*;   0  @-;   3  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(in_decl,type,
    in: $i > $i > $o ).

thf(subset_decl,type,
    subset: $i > $i > $o ).

thf(notsubsetI_decl,type,
    notsubsetI: $o ).

thf(notequalI1_decl,type,
    notequalI1: $o ).

thf(sk1_decl,type,
    sk1: $i ).

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

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

thf(notsubsetI_def,definition,
    ( notsubsetI
    = ( ! [A: $i,B: $i,C: $i] :
          ( ( in @ C @ A )
         => ( ~ ( in @ C @ B )
           => ~ ( subset @ A @ B ) ) ) ) ) ).

thf(notequalI1_def,definition,
    ( notequalI1
    = ( ! [A: $i,B: $i] :
          ( ~ ( subset @ A @ B )
         => ( A != B ) ) ) ) ).

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

thf(sk2_def,definition,
    ( sk2
    = ( @+[A: $i] :
          ~ ! [B: $i] :
              ( ( in @ B @ sk1 )
             => ( ~ ( in @ B @ A )
               => ( sk1 != A ) ) ) ) ) ).

thf(sk3_def,definition,
    ( sk3
    = ( @+[A: $i] :
          ~ ( ( in @ A @ sk1 )
           => ( ~ ( in @ A @ sk2 )
             => ( sk1 != sk2 ) ) ) ) ) ).

thf(1,conjecture,
    ( notsubsetI
   => ( notequalI1
     => ! [A: $i,B: $i,C: $i] :
          ( ( in @ C @ A )
         => ( ~ ( in @ C @ B )
           => ( A != B ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',notequalI2) ).

thf(2,negated_conjecture,
    ~ ( notsubsetI
     => ( notequalI1
       => ! [A: $i,B: $i,C: $i] :
            ( ( in @ C @ A )
           => ( ~ ( in @ C @ B )
             => ( A != B ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ! [A: $i,B: $i,C: $i] :
          ( ( in @ C @ A )
         => ( ~ ( in @ C @ B )
           => ~ ( subset @ A @ B ) ) )
     => ( ! [A: $i,B: $i] :
            ( ~ ( subset @ A @ B )
           => ( A != B ) )
       => ! [A: $i,B: $i,C: $i] :
            ( ( in @ C @ A )
           => ( ~ ( in @ C @ B )
             => ( A != B ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ! [E: $i,D: $i,C: $i,B: $i,A: $i] :
      ( ( ~ ( in @ C @ A )
        | ( in @ C @ B )
        | ~ ( subset @ A @ B ) )
      & ( ( subset @ D @ E )
        | ( D != E ) )
      & ( in @ sk3 @ sk1 )
      & ~ ( in @ sk3 @ sk2 )
      & ( sk1 = sk2 ) ),
    inference(cnf,[status(esa)],[3]) ).

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

thf(8,plain,
    ~ ( in @ sk3 @ sk2 ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(6,plain,
    sk1 = sk2,
    inference(cnfConj,[status(thm)],[4]) ).

thf(10,plain,
    sk2 = sk1,
    inference(lifteq,[status(thm)],[6]) ).

thf(13,plain,
    ~ ( in @ sk3 @ sk1 ),
    inference(rewrite,[status(thm)],[8,10]) ).

thf(14,plain,
    $false,
    inference(rewrite,[status(thm)],[5,13]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU568^2 : TPTP v9.3.1. Released v3.7.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.10/0.20  % Computer : n017.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.21  % WCLimit  : 300
% 0.10/0.21  % DateTime : Tue Sep 29 13:46:22 UTC 2026
% 0.10/0.21  % CPUTime  : 
% 0.10/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.88/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.22/0.97  % [INFO] 	 Parsing done (184ms). 
% 1.22/0.99  % [INFO] 	 Running in sequential loop mode. 
% 1.80/1.39  % [INFO] 	 eprover registered as external prover. 
% 1.80/1.39  % [INFO] 	 Scanning for conjecture ... 
% 2.20/1.50  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.20/1.54  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.20/1.54  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.20/1.54  % [INFO] 	 Type checking passed. 
% 2.20/1.55  % [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.30/2.07  % [INFO] 	 Killing All external provers ... 
% 3.30/2.07  % Time passed: 1726ms (effective reasoning time: 1075ms)
% 3.30/2.07  % 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.30/2.07  % Axioms used in derivation (0): 
% 3.30/2.07  % No. of inferences in proof: 11
% 3.30/2.07  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1726 ms resp. 1075 ms w/o parsing
% 3.30/2.13  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.30/2.13  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------