%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET925+1 : TPTP v9.2.1. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 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 : Wed Jun 3 08:48:59 AM UTC 2026 % Result : Theorem 0.31s 0.54s % Output : Proof 0.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET925+1 : TPTP v9.2.1. Released v3.2.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n003.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 16:17:44 EDT 2026 % 0.16/0.34 % CPUTime : % 0.31/0.48 %----Proving TF0_NAR, FOF, or CNF % 0.31/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.31/0.54 % SZS status Theorem % 0.31/0.54 % SZS output start Proof % 0.31/0.54 ( % 0.31/0.54 (declare-sort $$unsorted 0) % 0.31/0.54 (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted)) % 0.31/0.54 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.31/0.54 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.31/0.54 (declare-const tptp.empty_set $$unsorted) % 0.31/0.54 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.31/0.54 (define @t1 () (@var "A" $$unsorted)) % 0.31/0.54 (define @t2 () (@var "B" $$unsorted)) % 0.31/0.54 (define @t3 () (tptp.in @t1 @t2)) % 0.31/0.54 (define @t4 () (@list @t1 @t2)) % 0.31/0.54 (define @t5 () (tptp.empty @t1)) % 0.31/0.54 (define @t6 () (@list @t1)) % 0.31/0.54 (define @t7 () (tptp.set_difference (tptp.singleton @t1) @t2)) % 0.31/0.54 (define @t8 () (= @t7 tptp.empty_set)) % 0.31/0.54 (define @t9 () (forall @t4 (= @t8 @t3))) % 0.31/0.54 (define @t10 () (not @t9)) % 0.31/0.54 (assume @p1 (forall @t4 (=> @t3 (not (tptp.in @t2 @t1))))) % 0.31/0.54 (assume @p2 (tptp.empty tptp.empty_set)) % 0.31/0.54 (assume @p3 (exists @t6 @t5)) % 0.31/0.54 (assume @p4 (exists @t6 (not @t5))) % 0.31/0.54 (assume @p5 @t10) % 0.31/0.54 (assume @p6 @t9) % 0.31/0.54 (assume @p7 true) % 0.31/0.54 (step @p8 :rule eq-symm :args (@t7 tptp.empty_set)) % 0.31/0.54 (step @p9 :rule refl :args (@t3)) % 0.31/0.54 (step @p10 :rule cong :premises (@p9 @p8) :args ((= @t3 @t8))) % 0.31/0.54 (step @p11 :rule eq-symm :args (@t8 @t3)) % 0.31/0.54 (step @p12 :rule trans :premises (@p11 @p10)) % 0.31/0.54 (step @p13 :rule cong :premises (@p12) :args (@t9)) % 0.31/0.54 (step @p14 :rule cong :premises (@p13) :args (@t10)) % 0.31/0.54 (step @p15 :rule eq_resolve :premises (@p5 @p14)) % 0.31/0.54 (step @p16 :rule eq_resolve :premises (@p6 @p13)) % 0.31/0.54 (step @p17 false :rule chain_m_resolution :premises (@p16 @p15) :args (false (@list true) (@list (forall @t4 (= @t3 (= tptp.empty_set @t7)))))) % 0.31/0.54 ) % 0.31/0.54 % SZS output end Proof % 0.31/0.54 % cvc5 exiting %------------------------------------------------------------------------------