TSTP Solution File: LAT388+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : LAT388+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n011.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.20s 0.53s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT388+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : do_cvc5 %s %d
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 04:49:07 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.53 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.GrVFBrAPff/cvc5---1.0.5_26130.p...
% 0.20/0.53 ------- get file name : TPTP file name is LAT388+1
% 0.20/0.53 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_26130.smt2...
% 0.20/0.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.53 % SZS status Theorem for LAT388+1
% 0.20/0.53 % SZS output start Proof for LAT388+1
% 0.20/0.53 (
% 0.20/0.53 (let ((_let_1 (not (exists ((W0 $$unsorted)) (tptp.aSupremumOfIn0 W0 tptp.xT tptp.xS))))) (let ((_let_2 (tptp.aSupremumOfIn0 tptp.xp tptp.xT tptp.xS))) (let ((_let_3 (and (tptp.aFixedPointOf0 tptp.xp tptp.xf) _let_2))) (let ((_let_4 (tptp.sdtlpdtrp0 tptp.xf tptp.xp))) (let ((_let_5 (forall ((W0 $$unsorted)) (not (tptp.aSupremumOfIn0 W0 tptp.xT tptp.xS))))) (let ((_let_6 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_6 :args (tptp.xp QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.aSupremumOfIn0 W0 tptp.xT tptp.xS) false))))) :args (_let_5))) _let_6 (AND_ELIM (ASSUME :args (_let_3)) :args (1)) :args (false false _let_5 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.aCompleteLattice0 tptp.xU) (tptp.aFunction0 tptp.xf) (tptp.isMonotone0 tptp.xf) (tptp.isOn0 tptp.xf tptp.xU)) (= tptp.xS (tptp.cS1142 tptp.xf)) (tptp.aSubsetOf0 tptp.xT tptp.xS) (= tptp.xP (tptp.cS1241 tptp.xU tptp.xf tptp.xT)) (tptp.aInfimumOfIn0 tptp.xp tptp.xP tptp.xU) (and (tptp.aLowerBoundOfIn0 _let_4 tptp.xP tptp.xU) (tptp.aUpperBoundOfIn0 _let_4 tptp.xT tptp.xU)) _let_3 _let_1 true)))))))))
% 0.20/0.54 )
% 0.20/0.54 % SZS output end Proof for LAT388+1
% 0.20/0.54 % cvc5---1.0.5 exiting
% 0.20/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------