%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : LAT388+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n023.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 : Thu Aug 31 06:04:39 EDT 2023

% Result   : Theorem 0.36s 0.57s
% Output   : Proof 0.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13  % Problem    : LAT388+4 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.35  % Computer : n023.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Thu Aug 24 06:47:57 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.21/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.36/0.57  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.EX9OqMT9fH/cvc5---1.0.5_7360.p...
% 0.36/0.57  ------- get file name : TPTP file name is LAT388+4
% 0.36/0.57  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_7360.smt2...
% 0.36/0.57  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.36/0.57  % SZS status Theorem for LAT388+4
% 0.36/0.57  % SZS output start Proof for LAT388+4
% 0.36/0.57  (
% 0.36/0.57  (let ((_let_1 (not (exists ((W0 $$unsorted)) (let ((_let_1 (tptp.aElementOf0 W0 tptp.xS))) (or (and _let_1 (or (and _let_1 (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xT) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xT tptp.xS)) (forall ((W1 $$unsorted)) (=> (and (tptp.aElementOf0 W1 tptp.xS) (forall ((W2 $$unsorted)) (=> (tptp.aElementOf0 W2 tptp.xT) (tptp.sdtlseqdt0 W2 W1))) (tptp.aUpperBoundOfIn0 W1 tptp.xT tptp.xS)) (tptp.sdtlseqdt0 W0 W1)))) (tptp.aSupremumOfIn0 W0 tptp.xT tptp.xS))))))) (let ((_let_2 (tptp.aSupremumOfIn0 tptp.xp tptp.xT tptp.xS))) (let ((_let_3 (tptp.sdtlpdtrp0 tptp.xf tptp.xp))) (let ((_let_4 (tptp.szDzozmdt0 tptp.xf))) (let ((_let_5 (and (tptp.aElementOf0 tptp.xp _let_4) (= _let_3 tptp.xp) (tptp.aFixedPointOf0 tptp.xp tptp.xf) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xT) (tptp.sdtlseqdt0 W0 tptp.xp))) (tptp.aUpperBoundOfIn0 tptp.xp tptp.xT tptp.xS) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xS) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xT) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xT tptp.xS)) (tptp.sdtlseqdt0 tptp.xp W0))) _let_2))) (let ((_let_6 (tptp.aElementOf0 tptp.xp tptp.xU))) (let ((_let_7 (tptp.szRzazndt0 tptp.xf))) (let ((_let_8 (forall ((BOUND_VARIABLE_2027 $$unsorted)) (not (tptp.aSupremumOfIn0 BOUND_VARIABLE_2027 tptp.xT tptp.xS))))) (let ((_let_9 (_let_8))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_9) :args (tptp.xp QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.aSupremumOfIn0 BOUND_VARIABLE_2027 tptp.xT tptp.xS) false))))) :args _let_9)) :args ((or (not _let_2) (not _let_8)))) (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) :args (1)) (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))) :args (6)) :args (false false _let_8 false _let_2)) :args ((forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) true)) (forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) true)) (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 W0) (tptp.aElement0 W1))))) (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (= (tptp.isEmpty0 W0) (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0)))))) (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (= (tptp.aSubsetOf0 W1 W0) (and (tptp.aSet0 W1) (forall ((W2 $$unsorted)) (=> (tptp.aElementOf0 W2 W1) (tptp.aElementOf0 W2 W0)))))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (=> (tptp.sdtlseqdt0 W0 W1) true))) (forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) (tptp.sdtlseqdt0 W0 W0))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (=> (and (tptp.sdtlseqdt0 W0 W1) (tptp.sdtlseqdt0 W1 W0)) (= W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1) (tptp.aElement0 W2)) (=> (and (tptp.sdtlseqdt0 W0 W1) (tptp.sdtlseqdt0 W1 W2)) (tptp.sdtlseqdt0 W0 W2)))) (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aSubsetOf0 W1 W0) (forall ((W2 $$unsorted)) (= (tptp.aLowerBoundOfIn0 W2 W1 W0) (and (tptp.aElementOf0 W2 W0) (forall ((W3 $$unsorted)) (=> (tptp.aElementOf0 W3 W1) (tptp.sdtlseqdt0 W2 W3)))))))))) (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aSubsetOf0 W1 W0) (forall ((W2 $$unsorted)) (= (tptp.aUpperBoundOfIn0 W2 W1 W0) (and (tptp.aElementOf0 W2 W0) (forall ((W3 $$unsorted)) (=> (tptp.aElementOf0 W3 W1) (tptp.sdtlseqdt0 W3 W2)))))))))) (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aSubsetOf0 W1 W0) (forall ((W2 $$unsorted)) (= (tptp.aInfimumOfIn0 W2 W1 W0) (and (tptp.aElementOf0 W2 W0) (tptp.aLowerBoundOfIn0 W2 W1 W0) (forall ((W3 $$unsorted)) (=> (tptp.aLowerBoundOfIn0 W3 W1 W0) (tptp.sdtlseqdt0 W3 W2)))))))))) (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aSubsetOf0 W1 W0) (forall ((W2 $$unsorted)) (= (tptp.aSupremumOfIn0 W2 W1 W0) (and (tptp.aElementOf0 W2 W0) (tptp.aUpperBoundOfIn0 W2 W1 W0) (forall ((W3 $$unsorted)) (=> (tptp.aUpperBoundOfIn0 W3 W1 W0) (tptp.sdtlseqdt0 W2 W3)))))))))) (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aSubsetOf0 W1 W0) (forall ((W2 $$unsorted) (W3 $$unsorted)) (=> (and (tptp.aSupremumOfIn0 W2 W1 W0) (tptp.aSupremumOfIn0 W3 W1 W0)) (= W2 W3))))))) (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aSubsetOf0 W1 W0) (forall ((W2 $$unsorted) (W3 $$unsorted)) (=> (and (tptp.aInfimumOfIn0 W2 W1 W0) (tptp.aInfimumOfIn0 W3 W1 W0)) (= W2 W3))))))) (forall ((W0 $$unsorted)) (= (tptp.aCompleteLattice0 W0) (and (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aSubsetOf0 W1 W0) (exists ((W2 $$unsorted)) (and (tptp.aInfimumOfIn0 W2 W1 W0) (exists ((W3 $$unsorted)) (tptp.aSupremumOfIn0 W3 W1 W0))))))))) (forall ((W0 $$unsorted)) (=> (tptp.aFunction0 W0) true)) (forall ((W0 $$unsorted)) (=> (tptp.aFunction0 W0) (tptp.aSet0 (tptp.szDzozmdt0 W0)))) (forall ((W0 $$unsorted)) (=> (tptp.aFunction0 W0) (tptp.aSet0 (tptp.szRzazndt0 W0)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (let ((_let_1 (tptp.szRzazndt0 W0))) (=> (and (tptp.aFunction0 W0) (tptp.aSet0 W1)) (= (tptp.isOn0 W0 W1) (and (= (tptp.szDzozmdt0 W0) _let_1) (= _let_1 W1)))))) (forall ((W0 $$unsorted)) (=> (tptp.aFunction0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 (tptp.szDzozmdt0 W0)) (tptp.aElementOf0 (tptp.sdtlpdtrp0 W0 W1) (tptp.szRzazndt0 W0)))))) (forall ((W0 $$unsorted)) (=> (tptp.aFunction0 W0) (forall ((W1 $$unsorted)) (= (tptp.aFixedPointOf0 W1 W0) (and (tptp.aElementOf0 W1 (tptp.szDzozmdt0 W0)) (= (tptp.sdtlpdtrp0 W0 W1) W1)))))) (forall ((W0 $$unsorted)) (=> (tptp.aFunction0 W0) (= (tptp.isMonotone0 W0) (forall ((W1 $$unsorted) (W2 $$unsorted)) (let ((_let_1 (tptp.szDzozmdt0 W0))) (=> (and (tptp.aElementOf0 W1 _let_1) (tptp.aElementOf0 W2 _let_1)) (=> (tptp.sdtlseqdt0 W1 W2) (tptp.sdtlseqdt0 (tptp.sdtlpdtrp0 W0 W1) (tptp.sdtlpdtrp0 W0 W2))))))))) (and (tptp.aSet0 tptp.xU) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 W0) (tptp.aElementOf0 W1 tptp.xU)))) (tptp.aSubsetOf0 W0 tptp.xU)) (exists ((W1 $$unsorted)) (let ((_let_1 (tptp.aElementOf0 W1 tptp.xU))) (and _let_1 _let_1 (forall ((W2 $$unsorted)) (=> (tptp.aElementOf0 W2 W0) (tptp.sdtlseqdt0 W1 W2))) (tptp.aLowerBoundOfIn0 W1 W0 tptp.xU) (forall ((W2 $$unsorted)) (=> (or (and (tptp.aElementOf0 W2 tptp.xU) (forall ((W3 $$unsorted)) (=> (tptp.aElementOf0 W3 W0) (tptp.sdtlseqdt0 W2 W3)))) (tptp.aLowerBoundOfIn0 W2 W0 tptp.xU)) (tptp.sdtlseqdt0 W2 W1))) (tptp.aInfimumOfIn0 W1 W0 tptp.xU) (exists ((W2 $$unsorted)) (let ((_let_1 (tptp.aElementOf0 W2 tptp.xU))) (and _let_1 _let_1 (forall ((W3 $$unsorted)) (=> (tptp.aElementOf0 W3 W0) (tptp.sdtlseqdt0 W3 W2))) (tptp.aUpperBoundOfIn0 W2 W0 tptp.xU) (forall ((W3 $$unsorted)) (=> (or (and (tptp.aElementOf0 W3 tptp.xU) (forall ((W4 $$unsorted)) (=> (tptp.aElementOf0 W4 W0) (tptp.sdtlseqdt0 W4 W3)))) (tptp.aUpperBoundOfIn0 W3 W0 tptp.xU)) (tptp.sdtlseqdt0 W2 W3))) (tptp.aSupremumOfIn0 W2 W0 tptp.xU))))))))) (tptp.aCompleteLattice0 tptp.xU) (tptp.aFunction0 tptp.xf) (forall ((W0 $$unsorted) (W1 $$unsorted)) (let ((_let_1 (tptp.szDzozmdt0 tptp.xf))) (=> (and (tptp.aElementOf0 W0 _let_1) (tptp.aElementOf0 W1 _let_1)) (=> (tptp.sdtlseqdt0 W0 W1) (tptp.sdtlseqdt0 (tptp.sdtlpdtrp0 tptp.xf W0) (tptp.sdtlpdtrp0 tptp.xf W1)))))) (tptp.isMonotone0 tptp.xf) (= _let_4 _let_7) (= _let_7 tptp.xU) (tptp.isOn0 tptp.xf tptp.xU)) (and (tptp.aSet0 tptp.xS) (forall ((W0 $$unsorted)) (let ((_let_1 (tptp.aElementOf0 W0 tptp.xS))) (let ((_let_2 (tptp.aFixedPointOf0 W0 tptp.xf))) (let ((_let_3 (= (tptp.sdtlpdtrp0 tptp.xf W0) W0))) (let ((_let_4 (tptp.aElementOf0 W0 (tptp.szDzozmdt0 tptp.xf)))) (and (=> _let_1 (and _let_4 _let_3 _let_2)) (=> (or (and _let_4 _let_3) _let_2) _let_1))))))) (= tptp.xS (tptp.cS1142 tptp.xf))) (and (tptp.aSet0 tptp.xT) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xT) (tptp.aElementOf0 W0 tptp.xS))) (tptp.aSubsetOf0 tptp.xT tptp.xS)) (and (tptp.aSet0 tptp.xP) (forall ((W0 $$unsorted)) (let ((_let_1 (tptp.aElementOf0 W0 tptp.xP))) (let ((_let_2 (tptp.aUpperBoundOfIn0 W0 tptp.xT tptp.xU))) (let ((_let_3 (tptp.sdtlseqdt0 (tptp.sdtlpdtrp0 tptp.xf W0) W0))) (let ((_let_4 (tptp.aElementOf0 W0 tptp.xU))) (and (=> _let_1 (and _let_4 _let_3 (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xT) (tptp.sdtlseqdt0 W1 W0))) _let_2)) (=> (and _let_4 _let_3 (or (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xT) (tptp.sdtlseqdt0 W1 W0))) _let_2)) _let_1))))))) (= tptp.xP (tptp.cS1241 tptp.xU tptp.xf tptp.xT))) (and _let_6 _let_6 (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xP) (tptp.sdtlseqdt0 tptp.xp W0))) (tptp.aLowerBoundOfIn0 tptp.xp tptp.xP tptp.xU) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xU) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xP) (tptp.sdtlseqdt0 W0 W1)))) (tptp.aLowerBoundOfIn0 W0 tptp.xP tptp.xU)) (tptp.sdtlseqdt0 W0 tptp.xp))) (tptp.aInfimumOfIn0 tptp.xp tptp.xP tptp.xU)) (and (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xP) (tptp.sdtlseqdt0 (tptp.sdtlpdtrp0 tptp.xf tptp.xp) W0))) (tptp.aLowerBoundOfIn0 _let_3 tptp.xP tptp.xU) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xT) (tptp.sdtlseqdt0 W0 (tptp.sdtlpdtrp0 tptp.xf tptp.xp)))) (tptp.aUpperBoundOfIn0 _let_3 tptp.xT tptp.xU)) _let_5 _let_1 true))))))))))))
% 0.36/0.58  )
% 0.36/0.58  % SZS output end Proof for LAT388+4
% 0.36/0.58  % cvc5---1.0.5 exiting
% 0.36/0.58  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------