%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET839-2 : 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 : 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 : Wed Jun 3 08:48:47 AM UTC 2026 % Result : Unsatisfiable 0.47s 0.64s % Output : Proof 0.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET839-2 : 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.17/0.34 % Computer : n023.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.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Tue Jun 2 16:15:28 EDT 2026 % 0.17/0.35 % CPUTime : % 0.33/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.33/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.47/0.64 % SZS status Unsatisfiable % 0.47/0.64 % SZS output start Proof % 0.47/0.64 ( % 0.47/0.64 (declare-sort $$unsorted 0) % 0.47/0.64 (declare-const tptp.c_Main_OsubsetI__1 (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.47/0.64 (declare-const tptp.c_in (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.47/0.64 (declare-const tptp.c_lessequals (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.47/0.64 (declare-const tptp.v_S $$unsorted) % 0.47/0.64 (declare-const tptp.c_insert (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.47/0.64 (declare-const tptp.c_emptyset $$unsorted) % 0.47/0.64 (declare-const tptp.tc_set (-> $$unsorted $$unsorted)) % 0.47/0.64 (declare-const tptp.t_a $$unsorted) % 0.47/0.64 (define @t1 () (tptp.tc_set tptp.t_a)) % 0.47/0.64 (define @t2 () (tptp.tc_set @t1)) % 0.47/0.64 (define @t3 () (@var "V_U" $$unsorted)) % 0.47/0.64 (define @t4 () (@var "V_V" $$unsorted)) % 0.47/0.64 (define @t5 () (@var "T_a" $$unsorted)) % 0.47/0.64 (define @t6 () (@var "V_B" $$unsorted)) % 0.47/0.64 (define @t7 () (@var "V_x" $$unsorted)) % 0.47/0.64 (define @t8 () (tptp.tc_set @t5)) % 0.47/0.64 (define @t9 () (@var "V_A" $$unsorted)) % 0.47/0.64 (define @t10 () (tptp.c_lessequals @t9 @t6 @t8)) % 0.47/0.64 (define @t11 () (tptp.c_Main_OsubsetI__1 @t9 @t6 @t5)) % 0.47/0.64 (define @t12 () (@list @t9 @t6 @t5)) % 0.47/0.64 (define @t13 () (not @t10)) % 0.47/0.64 (define @t14 () (not (tptp.c_lessequals @t6 @t9 @t8))) % 0.47/0.64 (define @t15 () (or @t14 @t13 (= @t9 @t6))) % 0.47/0.64 (define @t16 () (@list @t6 @t9 @t5)) % 0.47/0.64 (define @t17 () (forall @t16 @t15)) % 0.47/0.64 (define @t18 () (tptp.c_insert tptp.v_S tptp.c_emptyset @t1)) % 0.47/0.64 (define @t19 () (tptp.c_Main_OsubsetI__1 tptp.v_S @t18 @t1)) % 0.47/0.64 (define @t20 () (tptp.c_insert @t19 tptp.c_emptyset @t1)) % 0.47/0.64 (define @t21 () (@list tptp.v_S @t20 @t1)) % 0.47/0.64 (define @t22 () (tptp.c_lessequals tptp.v_S @t20 @t2)) % 0.47/0.64 (define @t23 () (tptp.c_Main_OsubsetI__1 tptp.v_S @t20 @t1)) % 0.47/0.64 (define @t24 () (not (tptp.c_in @t23 @t20 @t1))) % 0.47/0.64 (define @t25 () (or @t24 @t22)) % 0.47/0.64 (define @t26 () (@list true false)) % 0.47/0.64 (define @t27 () (tptp.c_lessequals @t19 @t23 @t1)) % 0.47/0.64 (define @t28 () (not @t27)) % 0.47/0.64 (define @t29 () (tptp.c_lessequals @t23 @t19 @t1)) % 0.47/0.64 (define @t30 () (not @t29)) % 0.47/0.64 (define @t31 () (or @t30 @t28 (= @t23 @t19))) % 0.47/0.64 (define @t32 () (forall @t16 (or @t14 @t13 (= @t6 @t9)))) % 0.47/0.64 (define @t33 () (= @t19 @t23)) % 0.47/0.64 (define @t34 () (or @t30 @t28 @t33)) % 0.47/0.64 (define @t35 () (tptp.c_in @t23 tptp.v_S @t1)) % 0.47/0.64 (define @t36 () (or @t35 @t22)) % 0.47/0.64 (define @t37 () (tptp.c_lessequals tptp.v_S @t18 @t2)) % 0.47/0.64 (define @t38 () (tptp.c_in @t19 tptp.v_S @t1)) % 0.47/0.64 (define @t39 () (or @t38 @t37)) % 0.47/0.64 (define @t40 () (not @t35)) % 0.47/0.64 (define @t41 () (not @t38)) % 0.47/0.64 (define @t42 () (or @t29 @t41 @t40)) % 0.47/0.64 (define @t43 () (@list false false false)) % 0.47/0.64 (define @t44 () (or @t27 @t40 @t41)) % 0.47/0.64 (assume @p1 (forall (@list @t3) (not (tptp.c_lessequals tptp.v_S (tptp.c_insert @t3 tptp.c_emptyset @t1) @t2)))) % 0.47/0.64 (assume @p2 (forall (@list @t3 @t4) (or (tptp.c_lessequals @t3 @t4 @t1) (not (tptp.c_in @t4 tptp.v_S @t1)) (not (tptp.c_in @t3 tptp.v_S @t1))))) % 0.47/0.64 (assume @p3 (forall (@list @t7 @t6 @t5) (tptp.c_in @t7 (tptp.c_insert @t7 @t6 @t5) @t5))) % 0.47/0.64 (assume @p4 (forall @t12 (or (tptp.c_in @t11 @t9 @t5) @t10))) % 0.47/0.64 (assume @p5 (forall @t12 (or (not (tptp.c_in @t11 @t6 @t5)) @t10))) % 0.47/0.64 (assume @p6 @t17) % 0.47/0.64 (step @p7 :rule evaluate :args ((= true false))) % 0.47/0.64 (step @p8 :rule instantiate :premises (@p5) :args (@t21)) % 0.47/0.64 (step @p9 :rule instantiate :premises (@p1) :args ((@list @t19))) % 0.47/0.64 (step @p10 :rule cnf_or_pos :args (@t25)) % 0.47/0.64 (step @p11 :rule reordering :premises (@p10) :args ((or @t22 @t24 (not @t25)))) % 0.47/0.64 (step @p12 :rule chain_m_resolution :premises (@p11 @p9 @p8) :args (@t24 @t26 (@list @t22 @t25))) % 0.47/0.64 (step @p13 :rule false_intro :premises (@p12)) % 0.47/0.64 (step @p14 :rule refl :args (@t1)) % 0.47/0.64 (step @p15 :rule refl :args (@t20)) % 0.47/0.64 (step @p16 :rule eq-symm :args (@t9 @t6)) % 0.47/0.64 (step @p17 :rule refl :args (@t13)) % 0.47/0.64 (step @p18 :rule refl :args (@t14)) % 0.47/0.64 (step @p19 :rule nary_cong :premises (@p18 @p17 @p16) :args (@t15)) % 0.47/0.64 (step @p20 :rule cong :premises (@p19) :args (@t17)) % 0.47/0.64 (step @p21 :rule eq_resolve :premises (@p6 @p20)) % 0.47/0.64 (step @p22 :rule eq-symm :args (@t23 @t19)) % 0.47/0.64 (step @p23 :rule refl :args (@t28)) % 0.47/0.64 (step @p24 :rule refl :args (@t30)) % 0.47/0.64 (step @p25 :rule nary_cong :premises (@p24 @p23 @p22) :args (@t31)) % 0.47/0.64 (step @p26 :rule refl :args (@t32)) % 0.47/0.64 (step @p27 :rule cong :premises (@p26 @p25) :args ((=> @t32 @t31))) % 0.47/0.64 (assume-push @p61 @t32) % 0.47/0.64 (step @p29 :rule instantiate :premises (@p21) :args ((@list @t23 @t19 tptp.t_a))) % 0.47/0.64 (step-pop @p62 :rule scope :premises (@p29)) % 0.47/0.64 (step @p30 :rule process_scope :premises (@p62) :args (@t31)) % 0.47/0.64 (step @p32 :rule eq_resolve :premises (@p30 @p27)) % 0.47/0.64 (step @p33 :rule implies_elim :premises (@p32)) % 0.47/0.64 (step @p34 :rule chain_m_resolution :premises (@p33 @p21) :args (@t34 (@list false) (@list @t32))) % 0.47/0.64 (step @p35 :rule instantiate :premises (@p2) :args ((@list @t23 @t19))) % 0.47/0.64 (step @p36 :rule instantiate :premises (@p4) :args (@t21)) % 0.47/0.64 (step @p37 :rule cnf_or_pos :args (@t36)) % 0.47/0.64 (step @p38 :rule reordering :premises (@p37) :args ((or @t22 @t35 (not @t36)))) % 0.47/0.64 (step @p39 :rule chain_m_resolution :premises (@p38 @p9 @p36) :args (@t35 @t26 (@list @t22 @t36))) % 0.47/0.64 (step @p40 :rule instantiate :premises (@p4) :args ((@list tptp.v_S @t18 @t1))) % 0.47/0.64 (step @p41 :rule instantiate :premises (@p1) :args ((@list tptp.v_S))) % 0.47/0.64 (step @p42 :rule cnf_or_pos :args (@t39)) % 0.47/0.64 (step @p43 :rule reordering :premises (@p42) :args ((or @t37 @t38 (not @t39)))) % 0.47/0.64 (step @p44 :rule chain_m_resolution :premises (@p43 @p41 @p40) :args (@t38 @t26 (@list @t37 @t39))) % 0.47/0.64 (step @p45 :rule cnf_or_pos :args (@t42)) % 0.47/0.64 (step @p46 :rule reordering :premises (@p45) :args ((or @t41 @t40 @t29 (not @t42)))) % 0.47/0.64 (step @p47 :rule chain_m_resolution :premises (@p46 @p44 @p39 @p35) :args (@t29 @t43 (@list @t38 @t35 @t42))) % 0.47/0.64 (step @p48 :rule instantiate :premises (@p2) :args ((@list @t19 @t23))) % 0.47/0.64 (step @p49 :rule cnf_or_pos :args (@t44)) % 0.47/0.64 (step @p50 :rule reordering :premises (@p49) :args ((or @t41 @t40 @t27 (not @t44)))) % 0.47/0.64 (step @p51 :rule chain_m_resolution :premises (@p50 @p44 @p39 @p48) :args (@t27 @t43 (@list @t38 @t35 @t44))) % 0.47/0.64 (step @p52 :rule cnf_or_pos :args (@t34)) % 0.47/0.64 (step @p53 :rule reordering :premises (@p52) :args ((or @t28 @t30 @t33 (not @t34)))) % 0.47/0.64 (step @p54 :rule chain_m_resolution :premises (@p53 @p51 @p47 @p34) :args (@t33 @t43 (@list @t27 @t29 @t34))) % 0.47/0.64 (step @p55 :rule cong :premises (@p54 @p15 @p14) :args ((tptp.c_in @t19 @t20 @t1))) % 0.47/0.64 (step @p56 :rule instantiate :premises (@p3) :args ((@list @t19 tptp.c_emptyset @t1))) % 0.47/0.64 (step @p57 :rule true_intro :premises (@p56)) % 0.47/0.64 (step @p58 :rule symm :premises (@p57)) % 0.47/0.64 (step @p59 :rule trans :premises (@p58 @p55 @p13)) % 0.47/0.64 (step @p60 false :rule eq_resolve :premises (@p59 @p7)) % 0.47/0.64 ) % 0.47/0.64 % SZS output end Proof % 0.47/0.64 % cvc5 exiting %------------------------------------------------------------------------------