↑ 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  : SET162+3 : TPTP v9.3.1. Released v2.2.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 : 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 : Sun Sep 27 08:29:38 AM UTC 2026

% Result   : Theorem 6.45s 3.65s
% Output   : Refutation 6.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   20 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   56 (  11 equ;   0 cnn)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  148 (   7   ~;   3   |;  10   &; 105   @)
%                                         (   6 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   40 (   0   ^;  40   !;   0   ?;  40   :)

% Comments : 
%------------------------------------------------------------------------------
thf(union_decl,type,
    union: $i > $i > $i ).

thf(empty_set_decl,type,
    empty_set: $i ).

thf(member_decl,type,
    member: $i > $i > $o ).

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

thf(empty_decl,type,
    empty: $i > $o ).

thf(10,axiom,
    ! [A: $i,B: $i] :
      ( ( A = B )
    <=> ! [C: $i] :
          ( ( A @ ( C @ member ) )
        <=> ( B @ ( C @ member ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_member_defn) ).

thf(56,plain,
    ! [A: $i,B: $i] :
      ( ( ! [C: $i] :
            ( ( ( B @ ( C @ member ) )
             => ( A @ ( C @ member ) ) )
            & ( ( A @ ( C @ member ) )
             => ( B @ ( C @ member ) ) ) )
       => ( A = B ) )
      & ( ( A = B )
       => ! [C: $i] :
            ( ( ( B @ ( C @ member ) )
             => ( A @ ( C @ member ) ) )
            & ( ( A @ ( C @ member ) )
             => ( B @ ( C @ member ) ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(3,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( B @ ( A @ union ) @ ( C @ member ) )
    <=> ( ( B @ ( C @ member ) )
        | ( A @ ( C @ member ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).

thf(14,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( ( B @ ( C @ member ) )
          | ( A @ ( C @ member ) ) )
       => ( B @ ( A @ union ) @ ( C @ member ) ) )
      & ( ( B @ ( A @ union ) @ ( C @ member ) )
       => ( ( B @ ( C @ member ) )
          | ( A @ ( C @ member ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(4,axiom,
    ! [A: $i] :
      ~ ( empty_set @ ( A @ member ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).

thf(22,plain,
    ! [A: $i] :
      ~ ( empty_set @ ( A @ member ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(8,axiom,
    ! [A: $i] : ( A @ ( A @ subset ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_subset) ).

thf(48,plain,
    ! [A: $i] : ( A @ ( A @ subset ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(9,axiom,
    ! [A: $i] :
      ( ( A @ empty )
    <=> ! [B: $i] :
          ~ ( A @ ( B @ member ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_defn) ).

thf(50,plain,
    ! [A: $i] :
      ( ( ! [B: $i] :
            ~ ( A @ ( B @ member ) )
       => ( A @ empty ) )
      & ( ( A @ empty )
       => ! [B: $i] :
            ~ ( A @ ( B @ member ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(1,conjecture,
    ! [A: $i] :
      ( ( empty_set @ ( A @ union ) )
      = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_union_empty_set) ).

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

thf(11,plain,
    ~ ! [A: $i] :
        ( ( empty_set @ ( A @ union ) )
        = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(7,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ subset ) )
    <=> ! [C: $i] :
          ( ( A @ ( C @ member ) )
         => ( B @ ( C @ member ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).

thf(40,plain,
    ! [A: $i,B: $i] :
      ( ( ! [C: $i] :
            ( ( A @ ( C @ member ) )
           => ( B @ ( C @ member ) ) )
       => ( B @ ( A @ subset ) ) )
      & ( ( B @ ( A @ subset ) )
       => ! [C: $i] :
            ( ( A @ ( C @ member ) )
           => ( B @ ( C @ member ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(6,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ union ) )
      = ( A @ ( B @ union ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_union) ).

thf(37,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ union ) )
      = ( A @ ( B @ union ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(5,axiom,
    ! [A: $i,B: $i] :
      ( ( A = B )
    <=> ( ( A @ ( B @ subset ) )
        & ( B @ ( A @ subset ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).

thf(25,plain,
    ! [A: $i,B: $i] :
      ( ( ( ( A @ ( B @ subset ) )
          & ( B @ ( A @ subset ) ) )
       => ( A = B ) )
      & ( ( A = B )
       => ( ( A @ ( B @ subset ) )
          & ( B @ ( A @ subset ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(108,plain,
    $false,
    inference(e,[status(thm)],[56,14,22,48,50,11,40,37,25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET162+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.12  % 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.22/0.48  % Computer : n004.cluster.edu
% 0.22/0.48  % Model    : x86_64 x86_64
% 0.22/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.48  % Memory   : 8046.5625MB
% 0.22/0.48  % OS       : Linux 6.8.0-71-generic
% 0.22/0.48  % CPULimit : 300
% 0.22/0.48  % WCLimit  : 300
% 0.22/0.48  % DateTime : Sat Sep 26 07:14:51 UTC 2026
% 0.22/0.48  % CPUTime  : 
% 0.22/0.48  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
% 1.45/1.32  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.80/1.59  % [INFO] 	 Parsing done (267ms). 
% 2.03/1.61  % [INFO] 	 Running in sequential loop mode. 
% 3.05/2.21  % [INFO] 	 eprover registered as external prover. 
% 3.05/2.23  % [INFO] 	 Scanning for conjecture ... 
% 3.24/2.36  % [INFO] 	 Found a conjecture (or negated_conjecture) and 8 axioms. Running axiom selection ... 
% 3.39/2.41  % [INFO] 	 Axiom selection finished. Selected 8 axioms (removed 0 axioms). 
% 3.39/2.44  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 3.39/2.45  % [INFO] 	 Type checking passed. 
% 3.39/2.45  % [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 ... 
% 6.45/3.64  % External prover 'e' found a proof!
% 6.45/3.64  % [INFO] 	 Killing All external provers ... 
% 6.45/3.64  % Time passed: 2955ms (effective reasoning time: 2025ms)
% 6.45/3.64  % 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)>
% 6.45/3.65  % Axioms used in derivation (8): reflexivity_of_subset, equal_member_defn, empty_set_defn, empty_defn, commutativity_of_union, equal_defn, union_defn, subset_defn
% 6.45/3.65  % No. of inferences in proof: 20
% 6.45/3.65  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2955 ms resp. 2025 ms w/o parsing
% 6.68/3.71  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.68/3.71  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------