TSTP Solution File: SEU140+1 by Leo-III---1.7.7

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SEU140+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n024.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:57:10 EDT 2023

% Result   : Theorem 3.09s 1.72s
% Output   : Refutation 3.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   35 (  15 unt;   5 typ;   0 def)
%            Number of atoms       :   52 (  15 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  120 (   8   ~;   0   |;   8   &;  90   @)
%                                         (   1 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   7   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   47 (   0   ^;  43   !;   4   ?;  47   :)

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

thf(disjoint_type,type,
    disjoint: $i > $i > $o ).

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

thf(set_intersection2_type,type,
    set_intersection2: $i > $i > $i ).

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

thf(13,axiom,
    ! [A: $i,B: $i] :
      ( ( disjoint @ A @ B )
     => ( disjoint @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).

thf(52,plain,
    ! [A: $i,B: $i] :
      ( ( disjoint @ A @ B )
     => ( disjoint @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).

thf(7,axiom,
    ! [A: $i] :
      ( ( empty @ A )
     => ( A = empty_set ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).

thf(32,plain,
    ! [A: $i] :
      ( ( empty @ A )
     => ( A = empty_set ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(10,axiom,
    ! [A: $i] :
      ( ( set_intersection2 @ A @ empty_set )
      = empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_boole) ).

thf(39,plain,
    ! [A: $i] :
      ( ( set_intersection2 @ A @ empty_set )
      = empty_set ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(8,axiom,
    empty @ empty_set,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).

thf(35,plain,
    empty @ empty_set,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(1,conjecture,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( subset @ A @ B )
        & ( disjoint @ B @ C ) )
     => ( disjoint @ A @ C ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_xboole_1) ).

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

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

thf(5,axiom,
    ? [A: $i] :
      ~ ( empty @ A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_xboole_0) ).

thf(26,plain,
    ? [A: $i] :
      ~ ( empty @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(9,axiom,
    ! [A: $i,B: $i] :
      ( ( set_intersection2 @ A @ B )
      = ( set_intersection2 @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).

thf(36,plain,
    ! [A: $i,B: $i] :
      ( ( set_intersection2 @ A @ B )
      = ( set_intersection2 @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(11,axiom,
    ! [A: $i,B: $i] :
      ( ( disjoint @ A @ B )
    <=> ( ( set_intersection2 @ A @ B )
        = empty_set ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).

thf(42,plain,
    ! [A: $i,B: $i] :
      ( ( ( disjoint @ A @ B )
       => ( ( set_intersection2 @ A @ B )
          = empty_set ) )
      & ( ( ( set_intersection2 @ A @ B )
          = empty_set )
       => ( disjoint @ A @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

thf(4,axiom,
    ? [A: $i] : ( empty @ A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_xboole_0) ).

thf(24,plain,
    ? [A: $i] : ( empty @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(3,axiom,
    ! [A: $i,B: $i] :
      ~ ( ( empty @ A )
        & ( A != B )
        & ( empty @ B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_boole) ).

thf(20,plain,
    ! [A: $i,B: $i] :
      ~ ( ( empty @ A )
        & ( A != B )
        & ( empty @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(15,axiom,
    ! [A: $i,B: $i] : ( subset @ A @ A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).

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

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

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

thf(14,axiom,
    ! [A: $i] :
      ( ( subset @ A @ empty_set )
     => ( A = empty_set ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_1) ).

thf(54,plain,
    ! [A: $i] :
      ( ( subset @ A @ empty_set )
     => ( A = empty_set ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).

thf(12,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( subset @ A @ B )
     => ( subset @ ( set_intersection2 @ A @ C ) @ ( set_intersection2 @ B @ C ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_xboole_1) ).

thf(49,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( subset @ A @ B )
     => ( subset @ ( set_intersection2 @ A @ C ) @ ( set_intersection2 @ B @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).

thf(61,plain,
    $false,
    inference(e,[status(thm)],[52,32,39,35,16,26,36,42,24,20,57,29,54,49]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SEU140+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.16  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n024.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Thu May 18 12:48:53 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 1.00/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.19/0.98  % [INFO] 	 Parsing done (119ms). 
% 1.19/0.99  % [INFO] 	 Running in sequential loop mode. 
% 1.72/1.18  % [INFO] 	 eprover registered as external prover. 
% 1.72/1.18  % [INFO] 	 cvc4 registered as external prover. 
% 1.72/1.19  % [INFO] 	 Scanning for conjecture ... 
% 1.84/1.24  % [INFO] 	 Found a conjecture and 17 axioms. Running axiom selection ... 
% 1.84/1.28  % [INFO] 	 Axiom selection finished. Selected 13 axioms (removed 4 axioms). 
% 1.84/1.29  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.84/1.30  % [INFO] 	 Type checking passed. 
% 1.84/1.30  % [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.09/1.72  % External prover 'e' found a proof!
% 3.09/1.72  % [INFO] 	 Killing All external provers ... 
% 3.09/1.72  % Time passed: 1189ms (effective reasoning time: 729ms)
% 3.09/1.72  % 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.09/1.72  % Axioms used in derivation (13): fc1_xboole_0, t2_boole, commutativity_k3_xboole_0, t6_boole, d7_xboole_0, t26_xboole_1, reflexivity_r1_tarski, symmetry_r1_xboole_0, rc2_xboole_0, idempotence_k3_xboole_0, t3_xboole_1, t8_boole, rc1_xboole_0
% 3.09/1.72  % No. of inferences in proof: 30
% 3.09/1.72  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1189 ms resp. 729 ms w/o parsing
% 3.09/1.76  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.09/1.76  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------