TSTP Solution File: LAT388+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : LAT388+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n019.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:14 EDT 2023
% Result : Theorem 4.58s 2.15s
% Output : Refutation 4.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 57
% Syntax : Number of formulae : 90 ( 16 unt; 26 typ; 0 def)
% Number of atoms : 256 ( 19 equ; 0 cnn)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 690 ( 5 ~; 0 |; 73 &; 493 @)
% ( 10 <=>; 109 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 36 ( 36 >; 0 *; 0 +; 0 <<)
% Number of symbols : 29 ( 26 usr; 8 con; 0-3 aty)
% Number of variables : 123 ( 0 ^; 111 !; 12 ?; 123 :)
% 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(aCompleteLattice0_type,type,
aCompleteLattice0: $i > $o ).
thf(aFunction0_type,type,
aFunction0: $i > $o ).
thf(isOn0_type,type,
isOn0: $i > $i > $o ).
thf(szDzozmdt0_type,type,
szDzozmdt0: $i > $i ).
thf(szRzazndt0_type,type,
szRzazndt0: $i > $i ).
thf(aFixedPointOf0_type,type,
aFixedPointOf0: $i > $i > $o ).
thf(sdtlpdtrp0_type,type,
sdtlpdtrp0: $i > $i > $i ).
thf(isMonotone0_type,type,
isMonotone0: $i > $o ).
thf(xT_type,type,
xT: $i ).
thf(xS_type,type,
xS: $i ).
thf(aElement0_type,type,
aElement0: $i > $o ).
thf(xp_type,type,
xp: $i ).
thf(xP_type,type,
xP: $i ).
thf(xU_type,type,
xU: $i ).
thf(xf_type,type,
xf: $i ).
thf(cS1142_type,type,
cS1142: $i > $i ).
thf(cS1241_type,type,
cS1241: $i > $i > $i > $i ).
thf(22,axiom,
! [A: $i] :
( ( aSet0 @ A )
=> ! [B: $i] :
( ( aElementOf0 @ B @ A )
=> ( aElement0 @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
thf(115,plain,
! [A: $i] :
( ( aSet0 @ A )
=> ! [B: $i] :
( ( aElementOf0 @ B @ A )
=> ( aElement0 @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[22]) ).
thf(8,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/sandbox/benchmark/theBenchmark.p',mTrans) ).
thf(56,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)],[8]) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ( ( aFunction0 @ A )
& ( aSet0 @ B ) )
=> ( ( isOn0 @ A @ B )
<=> ( ( ( szDzozmdt0 @ A )
= ( szRzazndt0 @ A ) )
& ( ( szRzazndt0 @ A )
= B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDom) ).
thf(37,plain,
! [A: $i,B: $i] :
( ( ( aFunction0 @ A )
& ( aSet0 @ B ) )
=> ( ( ( isOn0 @ A @ B )
=> ( ( ( szDzozmdt0 @ A )
= ( szRzazndt0 @ A ) )
& ( ( szRzazndt0 @ A )
= B ) ) )
& ( ( ( ( szDzozmdt0 @ A )
= ( szRzazndt0 @ A ) )
& ( ( szRzazndt0 @ A )
= B ) )
=> ( isOn0 @ A @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(27,axiom,
! [A: $i] :
( ( aCompleteLattice0 @ A )
<=> ( ( aSet0 @ A )
& ! [B: $i] :
( ( aSubsetOf0 @ B @ A )
=> ? [C: $i] :
( ( aInfimumOfIn0 @ C @ B @ A )
& ? [D: $i] : ( aSupremumOfIn0 @ D @ B @ A ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefCLat) ).
thf(125,plain,
! [A: $i] :
( ( ( aCompleteLattice0 @ A )
=> ( ( aSet0 @ A )
& ! [B: $i] :
( ( aSubsetOf0 @ B @ A )
=> ? [C: $i] :
( ( aInfimumOfIn0 @ C @ B @ A )
& ? [D: $i] : ( aSupremumOfIn0 @ D @ B @ A ) ) ) ) )
& ( ( ( aSet0 @ A )
& ! [B: $i] :
( ( aSubsetOf0 @ B @ A )
=> ? [C: $i] :
( ( aInfimumOfIn0 @ C @ B @ A )
& ? [D: $i] : ( aSupremumOfIn0 @ D @ B @ A ) ) ) )
=> ( aCompleteLattice0 @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[27]) ).
thf(17,axiom,
! [A: $i] :
( ( aFunction0 @ A )
=> ( ( isMonotone0 @ A )
<=> ! [B: $i,C: $i] :
( ( ( aElementOf0 @ B @ ( szDzozmdt0 @ A ) )
& ( aElementOf0 @ C @ ( szDzozmdt0 @ A ) ) )
=> ( ( sdtlseqdt0 @ B @ C )
=> ( sdtlseqdt0 @ ( sdtlpdtrp0 @ A @ B ) @ ( sdtlpdtrp0 @ A @ C ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefMonot) ).
thf(89,plain,
! [A: $i] :
( ( aFunction0 @ A )
=> ( ( ( isMonotone0 @ A )
=> ! [B: $i,C: $i] :
( ( ( aElementOf0 @ B @ ( szDzozmdt0 @ A ) )
& ( aElementOf0 @ C @ ( szDzozmdt0 @ A ) ) )
=> ( ( sdtlseqdt0 @ B @ C )
=> ( sdtlseqdt0 @ ( sdtlpdtrp0 @ A @ B ) @ ( sdtlpdtrp0 @ A @ C ) ) ) ) )
& ( ! [B: $i,C: $i] :
( ( ( aElementOf0 @ B @ ( szDzozmdt0 @ A ) )
& ( aElementOf0 @ C @ ( szDzozmdt0 @ A ) ) )
=> ( ( sdtlseqdt0 @ B @ C )
=> ( sdtlseqdt0 @ ( sdtlpdtrp0 @ A @ B ) @ ( sdtlpdtrp0 @ A @ C ) ) ) )
=> ( isMonotone0 @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).
thf(23,axiom,
! [A: $i] :
( ( aElement0 @ A )
=> ( sdtlseqdt0 @ A @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mARefl) ).
thf(117,plain,
! [A: $i] :
( ( aElement0 @ A )
=> ( sdtlseqdt0 @ A @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[23]) ).
thf(31,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/sandbox/benchmark/theBenchmark.p',mDefSup) ).
thf(141,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)],[31]) ).
thf(28,axiom,
aSubsetOf0 @ xT @ xS,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1173) ).
thf(134,plain,
aSubsetOf0 @ xT @ xS,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[28]) ).
thf(6,axiom,
! [A: $i] :
( ( aSet0 @ A )
=> ! [B: $i] :
( ( aSubsetOf0 @ B @ A )
=> ! [C: $i,D: $i] :
( ( ( aInfimumOfIn0 @ C @ B @ A )
& ( aInfimumOfIn0 @ D @ B @ A ) )
=> ( C = D ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mInfUn) ).
thf(45,plain,
! [A: $i] :
( ( aSet0 @ A )
=> ! [B: $i] :
( ( aSubsetOf0 @ B @ A )
=> ! [C: $i,D: $i] :
( ( ( aInfimumOfIn0 @ C @ B @ A )
& ( aInfimumOfIn0 @ D @ B @ A ) )
=> ( C = D ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(26,axiom,
( xP
= ( cS1241 @ xU @ xf @ xT ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1244) ).
thf(123,plain,
( xP
= ( cS1241 @ xU @ xf @ xT ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[26]) ).
thf(11,axiom,
! [A: $i] :
( ( aFunction0 @ A )
=> ( aSet0 @ ( szRzazndt0 @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mRanSort) ).
thf(67,plain,
! [A: $i] :
( ( aFunction0 @ A )
=> ( aSet0 @ ( szRzazndt0 @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(16,axiom,
! [A: $i] :
( ( aFunction0 @ A )
=> ( aSet0 @ ( szDzozmdt0 @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDomSort) ).
thf(87,plain,
! [A: $i] :
( ( aFunction0 @ A )
=> ( aSet0 @ ( szDzozmdt0 @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(21,axiom,
! [A: $i] :
( ( aSet0 @ A )
=> $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSetSort) ).
thf(114,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[21]) ).
thf(4,axiom,
! [A: $i] :
( ( aFunction0 @ A )
=> $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mConMap) ).
thf(36,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(12,axiom,
! [A: $i,B: $i] :
( ( ( aElement0 @ A )
& ( aElement0 @ B ) )
=> ( ( sdtlseqdt0 @ A @ B )
=> $true ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessRel) ).
thf(69,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(30,axiom,
( ( aLowerBoundOfIn0 @ ( sdtlpdtrp0 @ xf @ xp ) @ xP @ xU )
& ( aUpperBoundOfIn0 @ ( sdtlpdtrp0 @ xf @ xp ) @ xT @ xU ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1299) ).
thf(138,plain,
( ( aLowerBoundOfIn0 @ ( sdtlpdtrp0 @ xf @ xp ) @ xP @ xU )
& ( aUpperBoundOfIn0 @ ( sdtlpdtrp0 @ xf @ xp ) @ xT @ xU ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[30]) ).
thf(20,axiom,
! [A: $i] :
( ( aSet0 @ A )
=> ! [B: $i] :
( ( aSubsetOf0 @ B @ A )
<=> ( ( aSet0 @ B )
& ! [C: $i] :
( ( aElementOf0 @ C @ B )
=> ( aElementOf0 @ C @ A ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
thf(106,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)],[20]) ).
thf(25,axiom,
( xS
= ( cS1142 @ xf ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1144) ).
thf(121,plain,
( xS
= ( cS1142 @ xf ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[25]) ).
thf(15,axiom,
! [A: $i] :
( ( aSet0 @ A )
=> ( ( isEmpty0 @ A )
<=> ~ ? [B: $i] : ( aElementOf0 @ B @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmpty) ).
thf(84,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)],[15]) ).
thf(13,axiom,
( ( aCompleteLattice0 @ xU )
& ( aFunction0 @ xf )
& ( isMonotone0 @ xf )
& ( isOn0 @ xf @ xU ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1123) ).
thf(70,plain,
( ( aCompleteLattice0 @ xU )
& ( aFunction0 @ xf )
& ( isMonotone0 @ xf )
& ( isOn0 @ xf @ xU ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(1,conjecture,
? [A: $i] : ( aSupremumOfIn0 @ A @ xT @ xS ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
thf(2,negated_conjecture,
~ ? [A: $i] : ( aSupremumOfIn0 @ A @ xT @ xS ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(33,plain,
~ ? [A: $i] : ( aSupremumOfIn0 @ A @ xT @ xS ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(19,axiom,
! [A: $i,B: $i] :
( ( ( aElement0 @ A )
& ( aElement0 @ B ) )
=> ( ( ( sdtlseqdt0 @ A @ B )
& ( sdtlseqdt0 @ B @ A ) )
=> ( A = B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mASymm) ).
thf(103,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)],[19]) ).
thf(10,axiom,
aInfimumOfIn0 @ xp @ xP @ xU,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1261) ).
thf(66,plain,
aInfimumOfIn0 @ xp @ xP @ xU,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(29,axiom,
( ( aFixedPointOf0 @ xp @ xf )
& ( aSupremumOfIn0 @ xp @ xT @ xS ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1330) ).
thf(135,plain,
( ( aFixedPointOf0 @ xp @ xf )
& ( aSupremumOfIn0 @ xp @ xT @ xS ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[29]) ).
thf(3,axiom,
! [A: $i] :
( ( aElement0 @ A )
=> $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mElmSort) ).
thf(35,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(7,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/sandbox/benchmark/theBenchmark.p',mDefUB) ).
thf(48,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)],[7]) ).
thf(32,axiom,
! [A: $i] :
( ( aSet0 @ A )
=> ! [B: $i] :
( ( aSubsetOf0 @ B @ A )
=> ! [C: $i,D: $i] :
( ( ( aSupremumOfIn0 @ C @ B @ A )
& ( aSupremumOfIn0 @ D @ B @ A ) )
=> ( C = D ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSupUn) ).
thf(150,plain,
! [A: $i] :
( ( aSet0 @ A )
=> ! [B: $i] :
( ( aSubsetOf0 @ B @ A )
=> ! [C: $i,D: $i] :
( ( ( aSupremumOfIn0 @ C @ B @ A )
& ( aSupremumOfIn0 @ D @ B @ A ) )
=> ( C = D ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[32]) ).
thf(18,axiom,
! [A: $i] :
( ( aFunction0 @ A )
=> ! [B: $i] :
( ( aFixedPointOf0 @ B @ A )
<=> ( ( aElementOf0 @ B @ ( szDzozmdt0 @ A ) )
& ( ( sdtlpdtrp0 @ A @ B )
= B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefFix) ).
thf(95,plain,
! [A: $i] :
( ( aFunction0 @ A )
=> ! [B: $i] :
( ( ( aFixedPointOf0 @ B @ A )
=> ( ( aElementOf0 @ B @ ( szDzozmdt0 @ A ) )
& ( ( sdtlpdtrp0 @ A @ B )
= B ) ) )
& ( ( ( aElementOf0 @ B @ ( szDzozmdt0 @ A ) )
& ( ( sdtlpdtrp0 @ A @ B )
= B ) )
=> ( aFixedPointOf0 @ B @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).
thf(14,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/sandbox/benchmark/theBenchmark.p',mDefInf) ).
thf(75,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)],[14]) ).
thf(24,axiom,
! [A: $i] :
( ( aFunction0 @ A )
=> ! [B: $i] :
( ( aElementOf0 @ B @ ( szDzozmdt0 @ A ) )
=> ( aElementOf0 @ ( sdtlpdtrp0 @ A @ B ) @ ( szRzazndt0 @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mImgSort) ).
thf(119,plain,
! [A: $i] :
( ( aFunction0 @ A )
=> ! [B: $i] :
( ( aElementOf0 @ B @ ( szDzozmdt0 @ A ) )
=> ( aElementOf0 @ ( sdtlpdtrp0 @ A @ B ) @ ( szRzazndt0 @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[24]) ).
thf(9,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/sandbox/benchmark/theBenchmark.p',mDefLB) ).
thf(58,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)],[9]) ).
thf(153,plain,
$false,
inference(cvc4,[status(thm)],[115,56,37,125,89,117,141,134,45,123,67,87,114,36,69,138,106,121,84,70,33,103,66,135,35,48,150,95,75,119,58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT388+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : run_Leo-III %s %d
% 0.15/0.37 % Computer : n019.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu May 18 14:01:13 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.98/0.92 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.31/1.07 % [INFO] Parsing done (150ms).
% 1.31/1.08 % [INFO] Running in sequential loop mode.
% 1.79/1.28 % [INFO] eprover registered as external prover.
% 1.79/1.28 % [INFO] cvc4 registered as external prover.
% 1.79/1.28 % [INFO] Scanning for conjecture ...
% 2.01/1.32 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.01/1.32 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.01/1.33 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.01/1.34 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.01/1.34 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.01/1.34 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.01/1.35 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.01/1.36 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.01/1.36 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.01/1.36 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.19/1.38 % [INFO] Found a conjecture and 30 axioms. Running axiom selection ...
% 2.19/1.42 % [INFO] Axiom selection finished. Selected 30 axioms (removed 0 axioms).
% 2.19/1.43 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.19/1.43 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.19/1.43 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.19/1.44 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.19/1.44 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.19/1.44 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.19/1.44 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.19/1.44 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.19/1.45 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.19/1.45 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.19/1.45 % [INFO] Problem is first-order (TPTP FOF).
% 2.19/1.46 % [INFO] Type checking passed.
% 2.50/1.46 % [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 ...
% 4.58/2.14 % External prover 'cvc4' found a proof!
% 4.58/2.14 % [INFO] Killing All external provers ...
% 4.58/2.14 % Time passed: 1610ms (effective reasoning time: 1063ms)
% 4.58/2.14 % 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)>
% 4.58/2.15 % Axioms used in derivation (30): mDefSup, mDefLB, mInfUn, mSetSort, mImgSort, mDefInf, mConMap, mLessRel, m__1261, mASymm, mElmSort, mDefSub, mSupUn, m__1244, mDefUB, mTrans, mDefFix, m__1144, m__1299, mARefl, mDefDom, mEOfElem, mDefEmpty, mDefCLat, m__1330, mRanSort, m__1123, mDefMonot, mDomSort, m__1173
% 4.58/2.15 % No. of inferences in proof: 64
% 4.58/2.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1610 ms resp. 1063 ms w/o parsing
% 4.58/2.19 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.58/2.19 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------