TSTP Solution File: SET694+4 by Leo-III---1.7.7

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SET694+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n022.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May 19 11:54:06 EDT 2023

% Result   : Theorem 3.50s 1.84s
% Output   : Refutation 3.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   38 (   6 unt;  12 typ;   0 def)
%            Number of atoms       :   90 (   9 equ;   0 cnn)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :  288 (   7   ~;   6   |;  22   &; 217   @)
%                                         (  10 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   8 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   18 (  18   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   14 (  12 usr;   2 con; 0-2 aty)
%            Number of variables   :   65 (   0   ^;  62   !;   3   ?;  65   :)

% Comments : 
%------------------------------------------------------------------------------
thf(subset_type,type,
    subset: $i > $i > $o ).

thf(union_type,type,
    union: $i > $i > $i ).

thf(power_set_type,type,
    power_set: $i > $i ).

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

thf(equal_set_type,type,
    equal_set: $i > $i > $o ).

thf(intersection_type,type,
    intersection: $i > $i > $i ).

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

thf(difference_type,type,
    difference: $i > $i > $i ).

thf(singleton_type,type,
    singleton: $i > $i ).

thf(unordered_pair_type,type,
    unordered_pair: $i > $i > $i ).

thf(sum_type,type,
    sum: $i > $i ).

thf(product_type,type,
    product: $i > $i ).

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

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

thf(1,conjecture,
    ! [A: $i,B: $i] : ( subset @ ( union @ ( power_set @ A ) @ ( power_set @ B ) ) @ ( power_set @ ( union @ A @ B ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI22) ).

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

thf(14,plain,
    ~ ! [A: $i,B: $i] : ( subset @ ( union @ ( power_set @ A ) @ ( power_set @ B ) ) @ ( power_set @ ( union @ A @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

thf(89,plain,
    $false,
    inference(cvc4,[status(thm)],[56,14,29,73,34,63,79,47,50,16,40,23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET694+4 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n022.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu May 18 19:00:17 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.96/0.88  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.29/1.01  % [INFO] 	 Parsing done (137ms). 
% 1.29/1.02  % [INFO] 	 Running in sequential loop mode. 
% 1.62/1.21  % [INFO] 	 eprover registered as external prover. 
% 1.62/1.21  % [INFO] 	 cvc4 registered as external prover. 
% 1.62/1.22  % [INFO] 	 Scanning for conjecture ... 
% 1.91/1.27  % [INFO] 	 Found a conjecture and 11 axioms. Running axiom selection ... 
% 1.91/1.29  % [INFO] 	 Axiom selection finished. Selected 11 axioms (removed 0 axioms). 
% 1.91/1.31  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.91/1.32  % [INFO] 	 Type checking passed. 
% 1.91/1.32  % [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.50/1.84  % External prover 'cvc4' found a proof!
% 3.50/1.84  % [INFO] 	 Killing All external provers ... 
% 3.50/1.84  % Time passed: 1320ms (effective reasoning time: 817ms)
% 3.50/1.84  % 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.50/1.84  % Axioms used in derivation (11): power_set, unordered_pair, union, intersection, empty_set, subset, equal_set, singleton, difference, sum, product
% 3.50/1.84  % No. of inferences in proof: 26
% 3.50/1.84  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1320 ms resp. 817 ms w/o parsing
% 3.61/1.89  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.61/1.89  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------