%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LAT388+1 : TPTP v9.2.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n013.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 : Wed Jun 3 08:30:36 AM UTC 2026 % Result : Theorem 0.36s 0.58s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : LAT388+1 : TPTP v9.2.1. Released v4.0.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n013.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue Jun 2 07:01:15 EDT 2026 % 0.16/0.34 % CPUTime : % 0.27/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.36/0.58 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.36/0.58 % SZS status Theorem % 0.36/0.58 % SZS output start Proof % 0.36/0.58 ( % 0.36/0.58 (declare-sort $$unsorted 0) % 0.36/0.58 (declare-const tptp.xp $$unsorted) % 0.36/0.58 (declare-const tptp.xT $$unsorted) % 0.36/0.58 (declare-const tptp.cS1142 (-> $$unsorted $$unsorted)) % 0.36/0.58 (declare-const tptp.isMonotone0 (-> $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.xS $$unsorted) % 0.36/0.58 (declare-const tptp.aFixedPointOf0 (-> $$unsorted $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.xU $$unsorted) % 0.36/0.58 (declare-const tptp.sdtlpdtrp0 (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.58 (declare-const tptp.isOn0 (-> $$unsorted $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.cS1241 (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.36/0.58 (declare-const tptp.szRzazndt0 (-> $$unsorted $$unsorted)) % 0.36/0.58 (declare-const tptp.aElementOf0 (-> $$unsorted $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.aCompleteLattice0 (-> $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.isEmpty0 (-> $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.xf $$unsorted) % 0.36/0.58 (declare-const tptp.aSubsetOf0 (-> $$unsorted $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.xP $$unsorted) % 0.36/0.58 (declare-const tptp.sdtlseqdt0 (-> $$unsorted $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.aLowerBoundOfIn0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.aSupremumOfIn0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.aUpperBoundOfIn0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.aInfimumOfIn0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.aFunction0 (-> $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.aSet0 (-> $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.aElement0 (-> $$unsorted Bool)) % 0.36/0.58 (declare-const tptp.szDzozmdt0 (-> $$unsorted $$unsorted)) % 0.36/0.58 (define @t1 () (@var "W0" $$unsorted)) % 0.36/0.58 (define @t2 () (tptp.aSet0 @t1)) % 0.36/0.58 (define @t3 () (@list @t1)) % 0.36/0.58 (define @t4 () (tptp.aElement0 @t1)) % 0.36/0.58 (define @t5 () (@var "W1" $$unsorted)) % 0.36/0.58 (define @t6 () (tptp.aElement0 @t5)) % 0.36/0.58 (define @t7 () (tptp.aElementOf0 @t5 @t1)) % 0.36/0.58 (define @t8 () (@list @t5)) % 0.36/0.58 (define @t9 () (@var "W2" $$unsorted)) % 0.36/0.58 (define @t10 () (tptp.aElementOf0 @t9 @t1)) % 0.36/0.58 (define @t11 () (@list @t9)) % 0.36/0.58 (define @t12 () (tptp.aSet0 @t5)) % 0.36/0.58 (define @t13 () (tptp.aSubsetOf0 @t5 @t1)) % 0.36/0.58 (define @t14 () (tptp.sdtlseqdt0 @t1 @t5)) % 0.36/0.58 (define @t15 () (and @t4 @t6)) % 0.36/0.58 (define @t16 () (@list @t1 @t5)) % 0.36/0.58 (define @t17 () (tptp.sdtlseqdt0 @t5 @t9)) % 0.36/0.58 (define @t18 () (@var "W3" $$unsorted)) % 0.36/0.58 (define @t19 () (tptp.sdtlseqdt0 @t9 @t18)) % 0.36/0.58 (define @t20 () (tptp.aElementOf0 @t18 @t5)) % 0.36/0.58 (define @t21 () (@list @t18)) % 0.36/0.58 (define @t22 () (tptp.aLowerBoundOfIn0 @t9 @t5 @t1)) % 0.36/0.58 (define @t23 () (tptp.sdtlseqdt0 @t18 @t9)) % 0.36/0.58 (define @t24 () (tptp.aUpperBoundOfIn0 @t9 @t5 @t1)) % 0.36/0.58 (define @t25 () (tptp.aInfimumOfIn0 @t9 @t5 @t1)) % 0.36/0.58 (define @t26 () (tptp.aSupremumOfIn0 @t9 @t5 @t1)) % 0.36/0.58 (define @t27 () (= @t9 @t18)) % 0.36/0.58 (define @t28 () (tptp.aSupremumOfIn0 @t18 @t5 @t1)) % 0.36/0.58 (define @t29 () (@list @t9 @t18)) % 0.36/0.58 (define @t30 () (tptp.aFunction0 @t1)) % 0.36/0.58 (define @t31 () (tptp.szDzozmdt0 @t1)) % 0.36/0.58 (define @t32 () (tptp.szRzazndt0 @t1)) % 0.36/0.58 (define @t33 () (tptp.sdtlpdtrp0 @t1 @t5)) % 0.36/0.58 (define @t34 () (tptp.aElementOf0 @t5 @t31)) % 0.36/0.58 (define @t35 () (tptp.sdtlpdtrp0 tptp.xf tptp.xp)) % 0.36/0.58 (define @t36 () (tptp.aSupremumOfIn0 tptp.xp tptp.xT tptp.xS)) % 0.36/0.58 (define @t37 () (tptp.aSupremumOfIn0 @t1 tptp.xT tptp.xS)) % 0.36/0.58 (define @t38 () (exists @t3 @t37)) % 0.36/0.58 (define @t39 () (not @t38)) % 0.36/0.58 (define @t40 () (forall @t3 (not @t37))) % 0.36/0.58 (assume @p1 (forall @t3 (=> @t2 true))) % 0.36/0.58 (assume @p2 (forall @t3 (=> @t4 true))) % 0.36/0.58 (assume @p3 (forall @t3 (=> @t2 (forall @t8 (=> @t7 @t6))))) % 0.36/0.58 (assume @p4 (forall @t3 (=> @t2 (= (tptp.isEmpty0 @t1) (not (exists @t8 @t7)))))) % 0.36/0.58 (assume @p5 (forall @t3 (=> @t2 (forall @t8 (= @t13 (and @t12 (forall @t11 (=> (tptp.aElementOf0 @t9 @t5) @t10)))))))) % 0.36/0.58 (assume @p6 (forall @t16 (=> @t15 (=> @t14 true)))) % 0.36/0.58 (assume @p7 (forall @t3 (=> @t4 (tptp.sdtlseqdt0 @t1 @t1)))) % 0.36/0.58 (assume @p8 (forall @t16 (=> @t15 (=> (and @t14 (tptp.sdtlseqdt0 @t5 @t1)) (= @t1 @t5))))) % 0.36/0.58 (assume @p9 (forall (@list @t1 @t5 @t9) (=> (and @t4 @t6 (tptp.aElement0 @t9)) (=> (and @t14 @t17) (tptp.sdtlseqdt0 @t1 @t9))))) % 0.36/0.58 (assume @p10 (forall @t3 (=> @t2 (forall @t8 (=> @t13 (forall @t11 (= @t22 (and @t10 (forall @t21 (=> @t20 @t19)))))))))) % 0.36/0.58 (assume @p11 (forall @t3 (=> @t2 (forall @t8 (=> @t13 (forall @t11 (= @t24 (and @t10 (forall @t21 (=> @t20 @t23)))))))))) % 0.36/0.58 (assume @p12 (forall @t3 (=> @t2 (forall @t8 (=> @t13 (forall @t11 (= @t25 (and @t10 @t22 (forall @t21 (=> (tptp.aLowerBoundOfIn0 @t18 @t5 @t1) @t23)))))))))) % 0.36/0.58 (assume @p13 (forall @t3 (=> @t2 (forall @t8 (=> @t13 (forall @t11 (= @t26 (and @t10 @t24 (forall @t21 (=> (tptp.aUpperBoundOfIn0 @t18 @t5 @t1) @t19)))))))))) % 0.36/0.58 (assume @p14 (forall @t3 (=> @t2 (forall @t8 (=> @t13 (forall @t29 (=> (and @t26 @t28) @t27))))))) % 0.36/0.58 (assume @p15 (forall @t3 (=> @t2 (forall @t8 (=> @t13 (forall @t29 (=> (and @t25 (tptp.aInfimumOfIn0 @t18 @t5 @t1)) @t27))))))) % 0.36/0.58 (assume @p16 (forall @t3 (= (tptp.aCompleteLattice0 @t1) (and @t2 (forall @t8 (=> @t13 (exists @t11 (and @t25 (exists @t21 @t28))))))))) % 0.36/0.58 (assume @p17 (forall @t3 (=> @t30 true))) % 0.36/0.58 (assume @p18 (forall @t3 (=> @t30 (tptp.aSet0 @t31)))) % 0.36/0.58 (assume @p19 (forall @t3 (=> @t30 (tptp.aSet0 @t32)))) % 0.36/0.58 (assume @p20 (forall @t16 (=> (and @t30 @t12) (= (tptp.isOn0 @t1 @t5) (and (= @t31 @t32) (= @t32 @t5)))))) % 0.36/0.58 (assume @p21 (forall @t3 (=> @t30 (forall @t8 (=> @t34 (tptp.aElementOf0 @t33 @t32)))))) % 0.36/0.58 (assume @p22 (forall @t3 (=> @t30 (forall @t8 (= (tptp.aFixedPointOf0 @t5 @t1) (and @t34 (= @t33 @t5))))))) % 0.36/0.58 (assume @p23 (forall @t3 (=> @t30 (= (tptp.isMonotone0 @t1) (forall (@list @t5 @t9) (=> (and @t34 (tptp.aElementOf0 @t9 @t31)) (=> @t17 (tptp.sdtlseqdt0 @t33 (tptp.sdtlpdtrp0 @t1 @t9))))))))) % 0.36/0.58 (assume @p24 (and (tptp.aCompleteLattice0 tptp.xU) (tptp.aFunction0 tptp.xf) (tptp.isMonotone0 tptp.xf) (tptp.isOn0 tptp.xf tptp.xU))) % 0.36/0.58 (assume @p25 (= tptp.xS (tptp.cS1142 tptp.xf))) % 0.36/0.58 (assume @p26 (tptp.aSubsetOf0 tptp.xT tptp.xS)) % 0.36/0.58 (assume @p27 (= tptp.xP (tptp.cS1241 tptp.xU tptp.xf tptp.xT))) % 0.36/0.58 (assume @p28 (tptp.aInfimumOfIn0 tptp.xp tptp.xP tptp.xU)) % 0.36/0.58 (assume @p29 (and (tptp.aLowerBoundOfIn0 @t35 tptp.xP tptp.xU) (tptp.aUpperBoundOfIn0 @t35 tptp.xT tptp.xU))) % 0.36/0.58 (assume @p30 (and (tptp.aFixedPointOf0 tptp.xp tptp.xf) @t36)) % 0.36/0.58 (assume @p31 @t39) % 0.36/0.58 (assume @p32 true) % 0.36/0.58 (step @p33 :rule and_elim :premises (@p30) :args (1)) % 0.36/0.58 (step @p34 :rule bool-double-not-elim :args (@t40)) % 0.36/0.58 (step @p35 :rule exists-elim :args ((= @t38 (not @t40)))) % 0.36/0.58 (step @p36 :rule cong :premises (@p35) :args (@t39)) % 0.36/0.58 (step @p37 :rule trans :premises (@p36 @p34)) % 0.36/0.58 (step @p38 :rule eq_resolve :premises (@p31 @p37)) % 0.36/0.58 (assume-push @p45 @t40) % 0.36/0.58 (step @p40 :rule instantiate :premises (@p38) :args ((@list tptp.xp))) % 0.36/0.58 (step-pop @p46 :rule scope :premises (@p40)) % 0.36/0.58 (step @p41 :rule process_scope :premises (@p46) :args ((not @t36))) % 0.36/0.58 (step @p43 :rule implies_elim :premises (@p41)) % 0.36/0.58 (step @p44 false :rule chain_m_resolution :premises (@p43 @p38 @p33) :args (false (@list false false) (@list @t40 @t36))) % 0.36/0.58 ) % 0.36/0.58 % SZS output end Proof % 0.36/0.59 % cvc5 exiting %------------------------------------------------------------------------------