TSTP Solution File: LAT381+3 by Leo-III---1.7.7

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : LAT381+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n003.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:28:13 EDT 2023

% Result   : Theorem 3.95s 1.87s
% Output   : Refutation 3.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   31
% Syntax   : Number of formulae    :   50 (   9 unt;  14 typ;   0 def)
%            Number of atoms       :  193 (   5 equ;   0 cnn)
%            Maximal formula atoms :   22 (   5 avg)
%            Number of connectives :  518 (   5   ~;   4   |;  68   &; 356   @)
%                                         (   6 <=>;  79  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   8 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   21 (  21   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   17 (  14 usr;   6 con; 0-3 aty)
%            Number of variables   :   82 (   0   ^;  79   !;   3   ?;  82   :)

% Comments : 
%------------------------------------------------------------------------------
thf(aSet0_type,type,
    aSet0: $i > $o ).

thf(isEmpty0_type,type,
    isEmpty0: $i > $o ).

thf(aElementOf0_type,type,
    aElementOf0: $i > $i > $o ).

thf(aSubsetOf0_type,type,
    aSubsetOf0: $i > $i > $o ).

thf(aLowerBoundOfIn0_type,type,
    aLowerBoundOfIn0: $i > $i > $i > $o ).

thf(sdtlseqdt0_type,type,
    sdtlseqdt0: $i > $i > $o ).

thf(aUpperBoundOfIn0_type,type,
    aUpperBoundOfIn0: $i > $i > $i > $o ).

thf(aInfimumOfIn0_type,type,
    aInfimumOfIn0: $i > $i > $i > $o ).

thf(aSupremumOfIn0_type,type,
    aSupremumOfIn0: $i > $i > $i > $o ).

thf(xu_type,type,
    xu: $i ).

thf(xv_type,type,
    xv: $i ).

thf(aElement0_type,type,
    aElement0: $i > $o ).

thf(xT_type,type,
    xT: $i ).

thf(xS_type,type,
    xS: $i ).

thf(14,axiom,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ! [B: $i] :
          ( ( aElementOf0 @ B @ A )
         => ( aElement0 @ B ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).

thf(69,plain,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ! [B: $i] :
          ( ( aElementOf0 @ B @ A )
         => ( aElement0 @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).

thf(6,axiom,
    ( ( aSet0 @ xS )
    & ! [A: $i] :
        ( ( aElementOf0 @ A @ xS )
       => ( aElementOf0 @ A @ xT ) )
    & ( aSubsetOf0 @ xS @ xT ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__725_01) ).

thf(24,plain,
    ( ( aSet0 @ xS )
    & ! [A: $i] :
        ( ( aElementOf0 @ A @ xS )
       => ( aElementOf0 @ A @ xT ) )
    & ( aSubsetOf0 @ xS @ xT ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(10,axiom,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ! [B: $i] :
          ( ( aSubsetOf0 @ B @ A )
         => ! [C: $i] :
              ( ( aInfimumOfIn0 @ C @ B @ A )
            <=> ( ( aElementOf0 @ C @ A )
                & ( aLowerBoundOfIn0 @ C @ B @ A )
                & ! [D: $i] :
                    ( ( aLowerBoundOfIn0 @ D @ B @ A )
                   => ( sdtlseqdt0 @ D @ C ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefInf) ).

thf(46,plain,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ! [B: $i] :
          ( ( aSubsetOf0 @ B @ A )
         => ! [C: $i] :
              ( ( ( aInfimumOfIn0 @ C @ B @ A )
               => ( ( aElementOf0 @ C @ A )
                  & ( aLowerBoundOfIn0 @ C @ B @ A )
                  & ! [D: $i] :
                      ( ( aLowerBoundOfIn0 @ D @ B @ A )
                     => ( sdtlseqdt0 @ D @ C ) ) ) )
              & ( ( ( aElementOf0 @ C @ A )
                  & ( aLowerBoundOfIn0 @ C @ B @ A )
                  & ! [D: $i] :
                      ( ( aLowerBoundOfIn0 @ D @ B @ A )
                     => ( sdtlseqdt0 @ D @ C ) ) )
               => ( aInfimumOfIn0 @ C @ B @ A ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(16,axiom,
    ! [A: $i,B: $i] :
      ( ( ( aElement0 @ A )
        & ( aElement0 @ B ) )
     => ( ( sdtlseqdt0 @ A @ B )
       => $true ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessRel) ).

thf(73,plain,
    $true,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).

thf(4,axiom,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => $true ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSetSort) ).

thf(22,plain,
    $true,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(15,axiom,
    ! [A: $i] :
      ( ( aElement0 @ A )
     => ( sdtlseqdt0 @ A @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mARefl) ).

thf(71,plain,
    ! [A: $i] :
      ( ( aElement0 @ A )
     => ( sdtlseqdt0 @ A @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).

thf(12,axiom,
    ! [A: $i,B: $i] :
      ( ( ( aElement0 @ A )
        & ( aElement0 @ B ) )
     => ( ( ( sdtlseqdt0 @ A @ B )
          & ( sdtlseqdt0 @ B @ A ) )
       => ( A = B ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mASymm) ).

thf(58,plain,
    ! [A: $i,B: $i] :
      ( ( ( aElement0 @ A )
        & ( aElement0 @ B ) )
     => ( ( ( sdtlseqdt0 @ A @ B )
          & ( sdtlseqdt0 @ B @ A ) )
       => ( A = B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).

thf(18,axiom,
    ( ( aElementOf0 @ xu @ xT )
    & ( aElementOf0 @ xu @ xT )
    & ! [A: $i] :
        ( ( aElementOf0 @ A @ xS )
       => ( sdtlseqdt0 @ A @ xu ) )
    & ( aUpperBoundOfIn0 @ xu @ xS @ xT )
    & ! [A: $i] :
        ( ( ( ( aElementOf0 @ A @ xT )
            & ! [B: $i] :
                ( ( aElementOf0 @ B @ xS )
               => ( sdtlseqdt0 @ B @ A ) ) )
          | ( aUpperBoundOfIn0 @ A @ xS @ xT ) )
       => ( sdtlseqdt0 @ xu @ A ) )
    & ( aSupremumOfIn0 @ xu @ xS @ xT )
    & ( aElementOf0 @ xv @ xT )
    & ( aElementOf0 @ xv @ xT )
    & ! [A: $i] :
        ( ( aElementOf0 @ A @ xS )
       => ( sdtlseqdt0 @ A @ xv ) )
    & ( aUpperBoundOfIn0 @ xv @ xS @ xT )
    & ! [A: $i] :
        ( ( ( ( aElementOf0 @ A @ xT )
            & ! [B: $i] :
                ( ( aElementOf0 @ B @ xS )
               => ( sdtlseqdt0 @ B @ A ) ) )
          | ( aUpperBoundOfIn0 @ A @ xS @ xT ) )
       => ( sdtlseqdt0 @ xv @ A ) )
    & ( aSupremumOfIn0 @ xv @ xS @ xT ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__744) ).

thf(83,plain,
    ( ( aElementOf0 @ xu @ xT )
    & ( aElementOf0 @ xu @ xT )
    & ! [A: $i] :
        ( ( aElementOf0 @ A @ xS )
       => ( sdtlseqdt0 @ A @ xu ) )
    & ( aUpperBoundOfIn0 @ xu @ xS @ xT )
    & ! [A: $i] :
        ( ( ( ( aElementOf0 @ A @ xT )
            & ! [B: $i] :
                ( ( aElementOf0 @ B @ xS )
               => ( sdtlseqdt0 @ B @ A ) ) )
          | ( aUpperBoundOfIn0 @ A @ xS @ xT ) )
       => ( sdtlseqdt0 @ xu @ A ) )
    & ( aSupremumOfIn0 @ xu @ xS @ xT )
    & ( aElementOf0 @ xv @ xT )
    & ( aElementOf0 @ xv @ xT )
    & ! [A: $i] :
        ( ( aElementOf0 @ A @ xS )
       => ( sdtlseqdt0 @ A @ xv ) )
    & ( aUpperBoundOfIn0 @ xv @ xS @ xT )
    & ! [A: $i] :
        ( ( ( ( aElementOf0 @ A @ xT )
            & ! [B: $i] :
                ( ( aElementOf0 @ B @ xS )
               => ( sdtlseqdt0 @ B @ A ) ) )
          | ( aUpperBoundOfIn0 @ A @ xS @ xT ) )
       => ( sdtlseqdt0 @ xv @ A ) )
    & ( aSupremumOfIn0 @ xv @ xS @ xT ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).

thf(13,axiom,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ! [B: $i] :
          ( ( aSubsetOf0 @ B @ A )
        <=> ( ( aSet0 @ B )
            & ! [C: $i] :
                ( ( aElementOf0 @ C @ B )
               => ( aElementOf0 @ C @ A ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).

thf(61,plain,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ! [B: $i] :
          ( ( ( aSubsetOf0 @ B @ A )
           => ( ( aSet0 @ B )
              & ! [C: $i] :
                  ( ( aElementOf0 @ C @ B )
                 => ( aElementOf0 @ C @ A ) ) ) )
          & ( ( ( aSet0 @ B )
              & ! [C: $i] :
                  ( ( aElementOf0 @ C @ B )
                 => ( aElementOf0 @ C @ A ) ) )
           => ( aSubsetOf0 @ B @ A ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).

thf(17,axiom,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ! [B: $i] :
          ( ( aSubsetOf0 @ B @ A )
         => ! [C: $i] :
              ( ( aSupremumOfIn0 @ C @ B @ A )
            <=> ( ( aElementOf0 @ C @ A )
                & ( aUpperBoundOfIn0 @ C @ B @ A )
                & ! [D: $i] :
                    ( ( aUpperBoundOfIn0 @ D @ B @ A )
                   => ( sdtlseqdt0 @ C @ D ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSup) ).

thf(74,plain,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ! [B: $i] :
          ( ( aSubsetOf0 @ B @ A )
         => ! [C: $i] :
              ( ( ( aSupremumOfIn0 @ C @ B @ A )
               => ( ( aElementOf0 @ C @ A )
                  & ( aUpperBoundOfIn0 @ C @ B @ A )
                  & ! [D: $i] :
                      ( ( aUpperBoundOfIn0 @ D @ B @ A )
                     => ( sdtlseqdt0 @ C @ D ) ) ) )
              & ( ( ( aElementOf0 @ C @ A )
                  & ( aUpperBoundOfIn0 @ C @ B @ A )
                  & ! [D: $i] :
                      ( ( aUpperBoundOfIn0 @ D @ B @ A )
                     => ( sdtlseqdt0 @ C @ D ) ) )
               => ( aSupremumOfIn0 @ C @ B @ A ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).

thf(3,axiom,
    ! [A: $i] :
      ( ( aElement0 @ A )
     => $true ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mElmSort) ).

thf(21,plain,
    $true,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(7,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( aElement0 @ A )
        & ( aElement0 @ B )
        & ( aElement0 @ C ) )
     => ( ( ( sdtlseqdt0 @ A @ B )
          & ( sdtlseqdt0 @ B @ C ) )
       => ( sdtlseqdt0 @ A @ C ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTrans) ).

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

thf(9,axiom,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ! [B: $i] :
          ( ( aSubsetOf0 @ B @ A )
         => ! [C: $i] :
              ( ( aUpperBoundOfIn0 @ C @ B @ A )
            <=> ( ( aElementOf0 @ C @ A )
                & ! [D: $i] :
                    ( ( aElementOf0 @ D @ B )
                   => ( sdtlseqdt0 @ D @ C ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefUB) ).

thf(38,plain,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ! [B: $i] :
          ( ( aSubsetOf0 @ B @ A )
         => ! [C: $i] :
              ( ( ( aUpperBoundOfIn0 @ C @ B @ A )
               => ( ( aElementOf0 @ C @ A )
                  & ! [D: $i] :
                      ( ( aElementOf0 @ D @ B )
                     => ( sdtlseqdt0 @ D @ C ) ) ) )
              & ( ( ( aElementOf0 @ C @ A )
                  & ! [D: $i] :
                      ( ( aElementOf0 @ D @ B )
                     => ( sdtlseqdt0 @ D @ C ) ) )
               => ( aUpperBoundOfIn0 @ C @ B @ A ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(11,axiom,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ( ( isEmpty0 @ A )
      <=> ~ ? [B: $i] : ( aElementOf0 @ B @ A ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmpty) ).

thf(55,plain,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ( ( ( isEmpty0 @ A )
         => ~ ? [B: $i] : ( aElementOf0 @ B @ A ) )
        & ( ~ ? [B: $i] : ( aElementOf0 @ B @ A )
         => ( isEmpty0 @ A ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

thf(5,axiom,
    aSet0 @ xT,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__725) ).

thf(23,plain,
    aSet0 @ xT,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(8,axiom,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ! [B: $i] :
          ( ( aSubsetOf0 @ B @ A )
         => ! [C: $i] :
              ( ( aLowerBoundOfIn0 @ C @ B @ A )
            <=> ( ( aElementOf0 @ C @ A )
                & ! [D: $i] :
                    ( ( aElementOf0 @ D @ B )
                   => ( sdtlseqdt0 @ C @ D ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefLB) ).

thf(30,plain,
    ! [A: $i] :
      ( ( aSet0 @ A )
     => ! [B: $i] :
          ( ( aSubsetOf0 @ B @ A )
         => ! [C: $i] :
              ( ( ( aLowerBoundOfIn0 @ C @ B @ A )
               => ( ( aElementOf0 @ C @ A )
                  & ! [D: $i] :
                      ( ( aElementOf0 @ D @ B )
                     => ( sdtlseqdt0 @ C @ D ) ) ) )
              & ( ( ( aElementOf0 @ C @ A )
                  & ! [D: $i] :
                      ( ( aElementOf0 @ D @ B )
                     => ( sdtlseqdt0 @ C @ D ) ) )
               => ( aLowerBoundOfIn0 @ C @ B @ A ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(1,conjecture,
    xu = xv,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

thf(2,negated_conjecture,
    xu != xv,
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(19,plain,
    xu != xv,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(105,plain,
    $false,
    inference(cvc4,[status(thm)],[69,24,46,73,22,71,58,83,61,74,21,28,38,55,23,30,19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LAT381+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.36  % Computer : n003.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % 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 14:00:31 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 0.86/0.80  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.99/0.93  % [INFO] 	 Parsing done (126ms). 
% 1.28/0.93  % [INFO] 	 Running in sequential loop mode. 
% 1.62/1.14  % [INFO] 	 eprover registered as external prover. 
% 1.62/1.15  % [INFO] 	 cvc4 registered as external prover. 
% 1.62/1.15  % [INFO] 	 Scanning for conjecture ... 
% 1.71/1.18  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.71/1.19  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.71/1.20  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.71/1.20  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.71/1.21  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.71/1.21  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.71/1.23  % [INFO] 	 Found a conjecture and 16 axioms. Running axiom selection ... 
% 1.96/1.27  % [INFO] 	 Axiom selection finished. Selected 16 axioms (removed 0 axioms). 
% 2.10/1.28  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.10/1.28  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.10/1.29  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.10/1.29  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.10/1.29  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.10/1.29  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.10/1.30  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.10/1.31  % [INFO] 	 Type checking passed. 
% 2.10/1.31  % [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.95/1.86  % External prover 'cvc4' found a proof!
% 3.95/1.86  % [INFO] 	 Killing All external provers ... 
% 3.95/1.86  % Time passed: 1344ms (effective reasoning time: 924ms)
% 3.95/1.86  % 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.95/1.86  % Axioms used in derivation (16): mDefSup, mDefUB, mTrans, mARefl, mDefLB, mSetSort, mDefInf, m__744, mLessRel, mASymm, mElmSort, mDefSub, m__725_01, m__725, mEOfElem, mDefEmpty
% 3.95/1.86  % No. of inferences in proof: 36
% 3.95/1.87  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1344 ms resp. 924 ms w/o parsing
% 3.95/1.92  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.95/1.92  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------