%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET840-2 : 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 : n029.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.37s 0.62s % Output : Proof 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET840-2 : TPTP v9.2.1. Released v3.2.0. % 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n029.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:14:47 EDT 2026 % 0.16/0.34 % CPUTime : % 0.27/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.27/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.37/0.62 % SZS status Unsatisfiable % 0.37/0.62 % SZS output start Proof % 0.45/0.63 ( % 0.45/0.63 (declare-sort $$unsorted 0) % 0.45/0.63 (declare-const tptp.c_lessequals (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.45/0.63 (declare-const tptp.c_Union (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.v_S $$unsorted) % 0.45/0.63 (declare-const tptp.c_Main_OsubsetI__1 (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.c_insert (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.c_in (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.45/0.63 (declare-const tptp.c_emptyset $$unsorted) % 0.45/0.63 (declare-const tptp.tc_set (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.t_b $$unsorted) % 0.45/0.63 (define @t1 () (tptp.tc_set tptp.t_b)) % 0.45/0.63 (define @t2 () (tptp.tc_set @t1)) % 0.45/0.63 (define @t3 () (@var "V_U" $$unsorted)) % 0.45/0.63 (define @t4 () (@list @t3)) % 0.45/0.63 (define @t5 () (tptp.c_Union tptp.v_S tptp.t_b)) % 0.45/0.63 (define @t6 () (@var "T_a" $$unsorted)) % 0.45/0.63 (define @t7 () (@var "V_C" $$unsorted)) % 0.45/0.63 (define @t8 () (@var "V_A" $$unsorted)) % 0.45/0.63 (define @t9 () (tptp.tc_set @t6)) % 0.45/0.63 (define @t10 () (@var "V_X" $$unsorted)) % 0.45/0.63 (define @t11 () (@var "V_B" $$unsorted)) % 0.45/0.63 (define @t12 () (@var "V_b" $$unsorted)) % 0.45/0.63 (define @t13 () (@var "V_a" $$unsorted)) % 0.45/0.63 (define @t14 () (@var "V_x" $$unsorted)) % 0.45/0.63 (define @t15 () (tptp.c_lessequals @t8 @t11 @t9)) % 0.45/0.63 (define @t16 () (tptp.c_Main_OsubsetI__1 @t8 @t11 @t6)) % 0.45/0.63 (define @t17 () (@list @t8 @t11 @t6)) % 0.45/0.63 (define @t18 () (forall (@list @t11 @t8 @t6) (or (not (tptp.c_lessequals @t11 @t8 @t9)) (not @t15) (= @t8 @t11)))) % 0.45/0.63 (define @t19 () (tptp.c_insert @t5 tptp.c_emptyset @t1)) % 0.45/0.63 (define @t20 () (@list tptp.v_S @t19 @t1)) % 0.45/0.63 (define @t21 () (tptp.c_lessequals tptp.v_S @t19 @t2)) % 0.45/0.63 (define @t22 () (tptp.c_Main_OsubsetI__1 tptp.v_S @t19 @t1)) % 0.45/0.63 (define @t23 () (tptp.c_in @t22 tptp.v_S @t1)) % 0.45/0.63 (define @t24 () (or @t23 @t21)) % 0.45/0.63 (define @t25 () (@list true false)) % 0.45/0.63 (define @t26 () (tptp.c_Main_OsubsetI__1 @t22 @t5 tptp.t_b)) % 0.45/0.63 (define @t27 () (@list @t22 @t5 tptp.t_b)) % 0.45/0.63 (define @t28 () (tptp.c_lessequals @t22 @t5 @t1)) % 0.45/0.63 (define @t29 () (not @t28)) % 0.45/0.63 (define @t30 () (tptp.c_lessequals @t5 @t22 @t1)) % 0.45/0.63 (define @t31 () (not @t30)) % 0.45/0.63 (define @t32 () (or @t31 @t29 (= @t22 @t5))) % 0.45/0.63 (define @t33 () (= @t5 @t22)) % 0.45/0.63 (define @t34 () (or @t31 @t29 @t33)) % 0.45/0.63 (define @t35 () (tptp.c_in @t22 @t19 @t1)) % 0.45/0.63 (define @t36 () (not @t35)) % 0.45/0.63 (define @t37 () (or @t36 @t21)) % 0.45/0.63 (define @t38 () (not @t33)) % 0.45/0.63 (define @t39 () (tptp.c_in @t5 @t19 @t1)) % 0.45/0.63 (define @t40 () (not @t39)) % 0.45/0.63 (define @t41 () (and @t36 @t33 @t39)) % 0.45/0.63 (define @t42 () (not @t23)) % 0.45/0.63 (define @t43 () (or @t30 @t42)) % 0.45/0.63 (define @t44 () (tptp.c_in @t26 @t22 tptp.t_b)) % 0.45/0.63 (define @t45 () (or @t44 @t28)) % 0.45/0.63 (define @t46 () (tptp.c_in @t26 @t5 tptp.t_b)) % 0.45/0.63 (define @t47 () (not @t46)) % 0.45/0.63 (define @t48 () (or @t47 @t28)) % 0.45/0.63 (define @t49 () (not @t44)) % 0.45/0.63 (define @t50 () (or @t49 @t42 @t46)) % 0.45/0.63 (assume @p1 (forall @t4 (not (tptp.c_lessequals tptp.v_S (tptp.c_insert @t3 tptp.c_emptyset @t1) @t2)))) % 0.45/0.63 (assume @p2 (forall @t4 (or (tptp.c_lessequals @t5 @t3 @t1) (not (tptp.c_in @t3 tptp.v_S @t1))))) % 0.45/0.63 (assume @p3 (forall (@list @t8 @t10 @t6 @t7) (or (not (tptp.c_in @t8 @t10 @t6)) (not (tptp.c_in @t10 @t7 @t9)) (tptp.c_in @t8 (tptp.c_Union @t7 @t6) @t6)))) % 0.45/0.63 (assume @p4 (forall (@list @t13 @t11 @t6 @t12) (or (not (tptp.c_in @t13 @t11 @t6)) (tptp.c_in @t13 (tptp.c_insert @t12 @t11 @t6) @t6)))) % 0.45/0.63 (assume @p5 (forall (@list @t14 @t11 @t6) (tptp.c_in @t14 (tptp.c_insert @t14 @t11 @t6) @t6))) % 0.45/0.63 (assume @p6 (forall (@list @t13 @t12 @t8 @t6) (or (not (tptp.c_in @t13 (tptp.c_insert @t12 @t8 @t6) @t6)) (tptp.c_in @t13 @t8 @t6) (= @t13 @t12)))) % 0.45/0.63 (assume @p7 (forall @t17 (or (tptp.c_in @t16 @t8 @t6) @t15))) % 0.45/0.63 (assume @p8 (forall @t17 (or (not (tptp.c_in @t16 @t11 @t6)) @t15))) % 0.45/0.63 (assume @p9 @t18) % 0.45/0.63 (step @p10 :rule instantiate :premises (@p7) :args (@t20)) % 0.45/0.63 (step @p11 :rule instantiate :premises (@p1) :args ((@list @t5))) % 0.45/0.63 (step @p12 :rule cnf_or_pos :args (@t24)) % 0.45/0.63 (step @p13 :rule reordering :premises (@p12) :args ((or @t21 @t23 (not @t24)))) % 0.45/0.63 (step @p14 :rule chain_m_resolution :premises (@p13 @p11 @p10) :args (@t23 @t25 (@list @t21 @t24))) % 0.45/0.63 (step @p15 :rule instantiate :premises (@p3) :args ((@list @t26 @t22 tptp.t_b tptp.v_S))) % 0.45/0.63 (step @p16 :rule instantiate :premises (@p7) :args (@t27)) % 0.45/0.63 (step @p17 :rule eq-symm :args (@t22 @t5)) % 0.45/0.63 (step @p18 :rule refl :args (@t29)) % 0.45/0.63 (step @p19 :rule refl :args (@t31)) % 0.45/0.63 (step @p20 :rule nary_cong :premises (@p19 @p18 @p17) :args (@t32)) % 0.45/0.63 (step @p21 :rule refl :args (@t18)) % 0.45/0.63 (step @p22 :rule cong :premises (@p21 @p20) :args ((=> @t18 @t32))) % 0.45/0.63 (assume-push @p86 @t18) % 0.45/0.63 (step @p24 :rule instantiate :premises (@p9) :args ((@list @t5 @t22 tptp.t_b))) % 0.45/0.63 (step-pop @p87 :rule scope :premises (@p24)) % 0.45/0.63 (step @p25 :rule process_scope :premises (@p87) :args (@t32)) % 0.45/0.63 (step @p27 :rule eq_resolve :premises (@p25 @p22)) % 0.45/0.63 (step @p28 :rule implies_elim :premises (@p27)) % 0.45/0.63 (step @p29 :rule chain_m_resolution :premises (@p28 @p9) :args (@t34 (@list false) (@list @t18))) % 0.45/0.63 (step @p30 :rule instantiate :premises (@p5) :args ((@list @t5 tptp.c_emptyset @t1))) % 0.45/0.63 (step @p31 :rule instantiate :premises (@p8) :args (@t20)) % 0.45/0.63 (step @p32 :rule cnf_or_pos :args (@t37)) % 0.45/0.63 (step @p33 :rule reordering :premises (@p32) :args ((or @t21 @t36 (not @t37)))) % 0.45/0.63 (step @p34 :rule chain_m_resolution :premises (@p33 @p11 @p31) :args (@t36 @t25 (@list @t21 @t37))) % 0.45/0.63 (step @p35 :rule refl :args (@t38)) % 0.45/0.63 (step @p36 :rule bool-double-not-elim :args (@t35)) % 0.45/0.63 (step @p37 :rule refl :args (@t40)) % 0.45/0.63 (step @p38 :rule nary_cong :premises (@p37 @p36 @p35) :args ((or @t40 (not @t36) @t38))) % 0.45/0.63 (assume-push @p88 @t36) % 0.45/0.63 (assume-push @p89 @t33) % 0.45/0.63 (assume-push @p90 @t39) % 0.45/0.63 (step @p42 :rule evaluate :args ((= true false))) % 0.45/0.63 (step @p43 :rule false_intro :premises (@p34)) % 0.45/0.63 (step @p44 :rule refl :args (@t1)) % 0.45/0.63 (step @p45 :rule refl :args (@t19)) % 0.45/0.63 (step @p46 :rule cong :premises (@p89 @p45 @p44) :args (@t39)) % 0.45/0.63 (step @p47 :rule true_intro :premises (@p30)) % 0.45/0.63 (step @p48 :rule symm :premises (@p47)) % 0.45/0.63 (step @p49 :rule trans :premises (@p48 @p46 @p43)) % 0.45/0.63 (step @p50 false :rule eq_resolve :premises (@p49 @p42)) % 0.45/0.63 (step-pop @p91 :rule scope :premises (@p50)) % 0.45/0.63 (step-pop @p92 :rule scope :premises (@p91)) % 0.45/0.63 (step-pop @p93 :rule scope :premises (@p92)) % 0.45/0.63 (step @p51 :rule process_scope :premises (@p93) :args (false)) % 0.45/0.63 (assume-push @p94 @t39) % 0.45/0.63 (assume-push @p95 @t36) % 0.45/0.63 (assume-push @p96 @t33) % 0.45/0.63 (step @p58 :rule and_intro :premises (@p34 @p96 @p30)) % 0.45/0.63 (step-pop @p97 :rule scope :premises (@p58)) % 0.45/0.63 (step-pop @p98 :rule scope :premises (@p97)) % 0.45/0.63 (step-pop @p99 :rule scope :premises (@p98)) % 0.45/0.63 (step @p59 :rule process_scope :premises (@p99) :args (@t41)) % 0.45/0.63 (step @p63 :rule implies_elim :premises (@p59)) % 0.45/0.63 (step @p64 :rule resolution :premises (@p63 @p51) :args (true @t41)) % 0.45/0.63 (step @p65 :rule not_and :premises (@p64)) % 0.45/0.63 (step @p66 :rule eq_resolve :premises (@p65 @p38)) % 0.45/0.63 (step @p67 :rule reordering :premises (@p66) :args ((or @t35 @t40 @t38))) % 0.45/0.63 (step @p68 :rule chain_m_resolution :premises (@p67 @p34 @p30) :args (@t38 @t25 (@list @t35 @t39))) % 0.45/0.63 (step @p69 :rule instantiate :premises (@p2) :args ((@list @t22))) % 0.45/0.63 (step @p70 :rule cnf_or_pos :args (@t43)) % 0.45/0.63 (step @p71 :rule reordering :premises (@p70) :args ((or @t42 @t30 (not @t43)))) % 0.45/0.63 (step @p72 :rule chain_m_resolution :premises (@p71 @p14 @p69) :args (@t30 (@list false false) (@list @t23 @t43))) % 0.45/0.63 (step @p73 :rule cnf_or_pos :args (@t34)) % 0.45/0.63 (step @p74 :rule reordering :premises (@p73) :args ((or @t31 @t29 @t33 (not @t34)))) % 0.45/0.63 (step @p75 :rule chain_m_resolution :premises (@p74 @p72 @p68 @p29) :args (@t29 (@list false true false) (@list @t30 @t33 @t34))) % 0.45/0.63 (step @p76 :rule cnf_or_pos :args (@t45)) % 0.45/0.63 (step @p77 :rule reordering :premises (@p76) :args ((or @t28 @t44 (not @t45)))) % 0.45/0.63 (step @p78 :rule chain_m_resolution :premises (@p77 @p75 @p16) :args (@t44 @t25 (@list @t28 @t45))) % 0.45/0.63 (step @p79 :rule instantiate :premises (@p8) :args (@t27)) % 0.45/0.63 (step @p80 :rule cnf_or_pos :args (@t48)) % 0.45/0.63 (step @p81 :rule reordering :premises (@p80) :args ((or @t28 @t47 (not @t48)))) % 0.45/0.63 (step @p82 :rule chain_m_resolution :premises (@p81 @p75 @p79) :args (@t47 @t25 (@list @t28 @t48))) % 0.45/0.63 (step @p83 :rule cnf_or_pos :args (@t50)) % 0.45/0.63 (step @p84 :rule reordering :premises (@p83) :args ((or @t42 @t46 @t49 (not @t50)))) % 0.45/0.63 (step @p85 false :rule chain_m_resolution :premises (@p84 @p82 @p78 @p15 @p14) :args (false (@list true false false false) (@list @t46 @t44 @t50 @t23))) % 0.45/0.63 ) % 0.45/0.63 % SZS output end Proof % 0.45/0.63 % cvc5 exiting %------------------------------------------------------------------------------