%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET940+1 : TPTP v9.2.1. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n022.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:49:02 AM UTC 2026 % Result : Theorem 0.30s 0.55s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET940+1 : TPTP v9.2.1. Released v3.2.0. % 0.13/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n022.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue Jun 2 16:18:23 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.55 % SZS status Theorem % 0.30/0.55 % SZS output start Proof % 0.30/0.55 ( % 0.30/0.55 (declare-sort $$unsorted 0) % 0.30/0.55 (declare-const tptp.union (-> $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (define @t1 () (@var "B" $$unsorted)) % 0.30/0.55 (define @t2 () (@var "A" $$unsorted)) % 0.30/0.55 (define @t3 () (tptp.set_union2 @t2 @t1)) % 0.30/0.55 (define @t4 () (tptp.empty @t2)) % 0.30/0.55 (define @t5 () (not @t4)) % 0.30/0.55 (define @t6 () (@list @t2 @t1)) % 0.30/0.55 (define @t7 () (tptp.set_union2 @t1 @t2)) % 0.30/0.55 (define @t8 () (tptp.unordered_pair @t2 @t1)) % 0.30/0.55 (define @t9 () (@list @t2)) % 0.30/0.55 (define @t10 () (tptp.union @t8)) % 0.30/0.55 (define @t11 () (forall @t6 (= @t10 @t3))) % 0.30/0.55 (define @t12 () (not @t11)) % 0.30/0.55 (assume @p1 (forall @t6 (=> @t5 (not (tptp.empty @t3))))) % 0.30/0.55 (assume @p2 (forall @t6 (=> @t5 (not (tptp.empty @t7))))) % 0.30/0.55 (assume @p3 (forall @t6 (= @t8 (tptp.unordered_pair @t1 @t2)))) % 0.30/0.55 (assume @p4 (forall @t6 (= @t3 @t7))) % 0.30/0.55 (assume @p5 (forall @t6 (= (tptp.set_union2 @t2 @t2) @t2))) % 0.30/0.55 (assume @p6 (exists @t9 @t4)) % 0.30/0.55 (assume @p7 (exists @t9 @t5)) % 0.30/0.55 (assume @p8 @t12) % 0.30/0.55 (assume @p9 @t11) % 0.30/0.55 (assume @p10 true) % 0.30/0.55 (step @p11 :rule eq-symm :args (@t10 @t3)) % 0.30/0.55 (step @p12 :rule cong :premises (@p11) :args (@t11)) % 0.30/0.55 (step @p13 :rule cong :premises (@p12) :args (@t12)) % 0.30/0.55 (step @p14 :rule eq_resolve :premises (@p8 @p13)) % 0.30/0.55 (step @p15 :rule eq_resolve :premises (@p9 @p12)) % 0.30/0.55 (step @p16 false :rule chain_m_resolution :premises (@p15 @p14) :args (false (@list true) (@list (forall @t6 (= @t3 @t10))))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.30/0.55 % cvc5 exiting %------------------------------------------------------------------------------