%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU158+2 : TPTP v9.2.1. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n011.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:50:46 AM UTC 2026 % Result : Theorem 0.39s 0.60s % Output : Proof 0.39s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU158+2 : TPTP v9.2.1. Released v3.3.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.18/0.34 % Computer : n011.cluster.edu % 0.18/0.34 % Model : x86_64 x86_64 % 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.34 % Memory : 8042.1875MB % 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.34 % CPULimit : 300 % 0.18/0.34 % WCLimit : 300 % 0.18/0.34 % DateTime : Tue Jun 2 16:32:35 EDT 2026 % 0.18/0.35 % CPUTime : % 0.28/0.52 %----Proving TF0_NAR, FOF, or CNF % 0.39/0.60 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.39/0.60 % SZS status Theorem % 0.39/0.60 % SZS output start Proof % 0.39/0.60 ( % 0.39/0.60 (declare-sort $$unsorted 0) % 0.39/0.60 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.39/0.60 (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool)) % 0.39/0.60 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.39/0.60 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.39/0.60 (declare-const tptp.proper_subset (-> $$unsorted $$unsorted Bool)) % 0.39/0.60 (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.39/0.60 (declare-const tptp.powerset (-> $$unsorted $$unsorted)) % 0.39/0.60 (declare-const tptp.ordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.39/0.60 (declare-const tptp.union (-> $$unsorted $$unsorted)) % 0.39/0.60 (declare-const tptp.set_intersection2 (-> $$unsorted $$unsorted $$unsorted)) % 0.39/0.60 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.39/0.60 (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted)) % 0.39/0.60 (declare-const tptp.empty_set $$unsorted) % 0.39/0.60 (declare-const tptp.cartesian_product2 (-> $$unsorted $$unsorted $$unsorted)) % 0.39/0.60 (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted)) % 0.39/0.60 (define @t1 () (@var "A" $$unsorted)) % 0.39/0.60 (define @t2 () (@var "B" $$unsorted)) % 0.39/0.60 (define @t3 () (not (tptp.in @t2 @t1))) % 0.39/0.60 (define @t4 () (tptp.in @t1 @t2)) % 0.39/0.60 (define @t5 () (@list @t1 @t2)) % 0.39/0.60 (define @t6 () (tptp.proper_subset @t2 @t1)) % 0.39/0.60 (define @t7 () (tptp.proper_subset @t1 @t2)) % 0.39/0.60 (define @t8 () (tptp.unordered_pair @t1 @t2)) % 0.39/0.60 (define @t9 () (tptp.set_union2 @t2 @t1)) % 0.39/0.60 (define @t10 () (tptp.set_union2 @t1 @t2)) % 0.39/0.60 (define @t11 () (tptp.set_intersection2 @t1 @t2)) % 0.39/0.60 (define @t12 () (tptp.subset @t1 @t2)) % 0.39/0.60 (define @t13 () (= @t1 @t2)) % 0.39/0.60 (define @t14 () (@var "C" $$unsorted)) % 0.39/0.60 (define @t15 () (tptp.in @t14 @t2)) % 0.39/0.60 (define @t16 () (@list @t14)) % 0.39/0.60 (define @t17 () (tptp.singleton @t1)) % 0.39/0.60 (define @t18 () (= @t1 tptp.empty_set)) % 0.39/0.60 (define @t19 () (@list @t1)) % 0.39/0.60 (define @t20 () (@var "D" $$unsorted)) % 0.39/0.60 (define @t21 () (tptp.in @t20 @t14)) % 0.39/0.60 (define @t22 () (@list @t20)) % 0.39/0.60 (define @t23 () (@list @t1 @t2 @t14)) % 0.39/0.60 (define @t24 () (tptp.in @t20 @t2)) % 0.39/0.60 (define @t25 () (tptp.in @t20 @t1)) % 0.39/0.60 (define @t26 () (@var "F" $$unsorted)) % 0.39/0.60 (define @t27 () (@var "E" $$unsorted)) % 0.39/0.60 (define @t28 () (tptp.in @t14 @t1)) % 0.39/0.60 (define @t29 () (tptp.set_difference @t1 @t2)) % 0.39/0.60 (define @t30 () (tptp.ordered_pair @t1 @t2)) % 0.39/0.60 (define @t31 () (tptp.disjoint @t1 @t2)) % 0.39/0.60 (define @t32 () (not @t13)) % 0.39/0.60 (define @t33 () (tptp.empty @t1)) % 0.39/0.60 (define @t34 () (not @t33)) % 0.39/0.60 (define @t35 () (tptp.disjoint @t17 @t2)) % 0.39/0.60 (define @t36 () (tptp.subset @t17 @t2)) % 0.39/0.60 (define @t37 () (forall @t5 (= @t36 @t4))) % 0.39/0.60 (define @t38 () (tptp.singleton @t2)) % 0.39/0.60 (define @t39 () (@list @t1 @t2 @t14 @t20)) % 0.39/0.60 (define @t40 () (= @t1 @t14)) % 0.39/0.60 (define @t41 () (tptp.set_intersection2 @t2 @t14)) % 0.39/0.60 (define @t42 () (tptp.subset @t1 @t14)) % 0.39/0.60 (define @t43 () (not @t37)) % 0.39/0.60 (define @t44 () (tptp.set_union2 @t1 (tptp.set_difference @t2 @t1))) % 0.39/0.60 (define @t45 () (and @t28 @t15)) % 0.39/0.60 (define @t46 () (not @t31)) % 0.39/0.60 (define @t47 () (tptp.in @t14 @t11)) % 0.39/0.60 (define @t48 () (tptp.empty @t2)) % 0.39/0.60 (define @t49 () (= @t17 (tptp.unordered_pair @t2 @t14))) % 0.39/0.60 (assume @p1 (forall @t5 (=> @t4 @t3))) % 0.39/0.60 (assume @p2 (forall @t5 (=> @t7 (not @t6)))) % 0.39/0.60 (assume @p3 (forall @t5 (= @t8 (tptp.unordered_pair @t2 @t1)))) % 0.39/0.60 (assume @p4 (forall @t5 (= @t10 @t9))) % 0.39/0.60 (assume @p5 (forall @t5 (= @t11 (tptp.set_intersection2 @t2 @t1)))) % 0.39/0.60 (assume @p6 (forall @t5 (= @t13 (and @t12 (tptp.subset @t2 @t1))))) % 0.39/0.60 (assume @p7 (forall @t5 (= (= @t2 @t17) (forall @t16 (= @t15 (= @t14 @t1)))))) % 0.39/0.60 (assume @p8 (forall @t19 (= @t18 (forall (@list @t2) @t3)))) % 0.39/0.60 (assume @p9 (forall @t5 (= (= @t2 (tptp.powerset @t1)) (forall @t16 (= @t15 (tptp.subset @t14 @t1)))))) % 0.39/0.60 (assume @p10 (forall @t23 (= (= @t14 @t8) (forall @t22 (= @t21 (or (= @t20 @t1) (= @t20 @t2))))))) % 0.39/0.60 (assume @p11 (forall @t23 (= (= @t14 @t10) (forall @t22 (= @t21 (or @t25 @t24)))))) % 0.39/0.60 (assume @p12 (forall @t23 (= (= @t14 (tptp.cartesian_product2 @t1 @t2)) (forall @t22 (= @t21 (exists (@list @t27 @t26) (and (tptp.in @t27 @t1) (tptp.in @t26 @t2) (= @t20 (tptp.ordered_pair @t27 @t26))))))))) % 0.39/0.60 (assume @p13 (forall @t5 (= @t12 (forall @t16 (=> @t28 @t15))))) % 0.39/0.60 (assume @p14 (forall @t23 (= (= @t14 @t11) (forall @t22 (= @t21 (and @t25 @t24)))))) % 0.39/0.60 (assume @p15 (forall @t5 (= (= @t2 (tptp.union @t1)) (forall @t16 (= @t15 (exists @t22 (and (tptp.in @t14 @t20) @t25))))))) % 0.39/0.60 (assume @p16 (forall @t23 (= (= @t14 @t29) (forall @t22 (= @t21 (and @t25 (not @t24))))))) % 0.39/0.60 (assume @p17 (forall @t5 (= @t30 (tptp.unordered_pair @t8 @t17)))) % 0.39/0.60 (assume @p18 (forall @t5 (= @t31 (= @t11 tptp.empty_set)))) % 0.39/0.60 (assume @p19 (forall @t5 (= @t7 (and @t12 @t32)))) % 0.39/0.60 (assume @p20 true) % 0.39/0.60 (assume @p21 (tptp.empty tptp.empty_set)) % 0.39/0.60 (assume @p22 (forall @t5 (not (tptp.empty @t30)))) % 0.39/0.60 (assume @p23 (forall @t5 (=> @t34 (not (tptp.empty @t10))))) % 0.39/0.60 (assume @p24 (forall @t5 (=> @t34 (not (tptp.empty @t9))))) % 0.39/0.60 (assume @p25 (forall @t5 (= (tptp.set_union2 @t1 @t1) @t1))) % 0.39/0.60 (assume @p26 (forall @t5 (= (tptp.set_intersection2 @t1 @t1) @t1))) % 0.39/0.60 (assume @p27 (forall @t5 (not (tptp.proper_subset @t1 @t1)))) % 0.39/0.60 (assume @p28 (forall @t19 (not (= @t17 tptp.empty_set)))) % 0.39/0.60 (assume @p29 (forall @t5 (=> @t4 (= (tptp.set_union2 @t17 @t2) @t2)))) % 0.39/0.60 (assume @p30 (forall @t5 (not (and @t35 @t4)))) % 0.39/0.60 (assume @p31 (forall @t5 (=> (not @t4) @t35))) % 0.39/0.60 (assume @p32 @t37) % 0.39/0.60 (assume @p33 (forall @t5 (= (= @t29 tptp.empty_set) @t12))) % 0.39/0.60 (assume @p34 (forall @t23 (=> @t12 (or @t28 (tptp.subset @t1 (tptp.set_difference @t2 (tptp.singleton @t14))))))) % 0.39/0.60 (assume @p35 (forall @t5 (= (tptp.subset @t1 @t38) (or @t18 (= @t1 @t38))))) % 0.39/0.60 (assume @p36 (forall @t5 (=> @t4 (tptp.subset @t1 (tptp.union @t2))))) % 0.39/0.60 (assume @p37 (forall @t39 (= (tptp.in @t30 (tptp.cartesian_product2 @t14 @t20)) (and (tptp.in @t1 @t14) (tptp.in @t2 @t20))))) % 0.39/0.60 (assume @p38 (exists @t19 @t33)) % 0.39/0.60 (assume @p39 (exists @t19 @t34)) % 0.39/0.60 (assume @p40 (forall @t5 (tptp.subset @t1 @t1))) % 0.39/0.60 (assume @p41 (forall @t5 (=> @t31 (tptp.disjoint @t2 @t1)))) % 0.39/0.60 (assume @p42 (forall @t39 (not (and (= @t8 (tptp.unordered_pair @t14 @t20)) (not @t40) (not (= @t1 @t20)))))) % 0.39/0.60 (assume @p43 (forall @t5 (=> @t12 (= @t10 @t2)))) % 0.39/0.60 (assume @p44 (forall @t5 (tptp.subset @t11 @t1))) % 0.39/0.60 (assume @p45 (forall @t23 (=> (and @t12 @t42) (tptp.subset @t1 @t41)))) % 0.39/0.60 (assume @p46 (forall @t19 (= (tptp.set_union2 @t1 tptp.empty_set) @t1))) % 0.39/0.60 (assume @p47 (forall @t23 (=> (and @t12 (tptp.subset @t2 @t14)) @t42))) % 0.39/0.60 (assume @p48 (= (tptp.powerset tptp.empty_set) (tptp.singleton tptp.empty_set))) % 0.39/0.60 (assume @p49 (forall @t23 (=> @t12 (tptp.subset (tptp.set_intersection2 @t1 @t14) @t41)))) % 0.39/0.60 (assume @p50 (forall @t5 (=> @t12 (= @t11 @t1)))) % 0.39/0.60 (assume @p51 (forall @t19 (= (tptp.set_intersection2 @t1 tptp.empty_set) tptp.empty_set))) % 0.39/0.60 (assume @p52 (forall @t5 (=> (forall @t16 (= @t28 @t15)) @t13))) % 0.39/0.60 (assume @p53 (forall @t19 (tptp.subset tptp.empty_set @t1))) % 0.39/0.60 (assume @p54 (forall @t23 (=> @t12 (tptp.subset (tptp.set_difference @t1 @t14) (tptp.set_difference @t2 @t14))))) % 0.39/0.60 (assume @p55 (forall @t39 (=> (= @t30 (tptp.ordered_pair @t14 @t20)) (and @t40 (= @t2 @t20))))) % 0.39/0.60 (assume @p56 (forall @t5 (tptp.subset @t29 @t1))) % 0.39/0.60 (assume @p57 @t43) % 0.39/0.60 (assume @p58 (forall @t5 (= @t44 @t10))) % 0.39/0.60 (assume @p59 (forall @t19 (= (tptp.set_difference @t1 tptp.empty_set) @t1))) % 0.39/0.60 (assume @p60 (forall @t5 (and (not (and @t46 (forall @t16 (not @t45)))) (not (and (exists @t16 @t45) @t31))))) % 0.39/0.60 (assume @p61 (forall @t19 (=> (tptp.subset @t1 tptp.empty_set) @t18))) % 0.39/0.60 (assume @p62 (forall @t5 (= (tptp.set_difference @t10 @t2) @t29))) % 0.39/0.60 (assume @p63 (forall @t5 (=> @t12 (= @t2 @t44)))) % 0.39/0.60 (assume @p64 (forall @t5 (= (tptp.set_difference @t1 @t29) @t11))) % 0.39/0.60 (assume @p65 (forall @t19 (= (tptp.set_difference tptp.empty_set @t1) tptp.empty_set))) % 0.39/0.60 (assume @p66 (forall @t5 (and (not (and @t46 (forall @t16 (not @t47)))) (not (and (exists @t16 @t47) @t31))))) % 0.39/0.60 (assume @p67 (forall @t5 (not (and @t12 @t6)))) % 0.39/0.60 (assume @p68 (forall @t23 (=> (and @t12 (tptp.disjoint @t2 @t14)) (tptp.disjoint @t1 @t14)))) % 0.39/0.60 (assume @p69 (forall @t19 (= (tptp.unordered_pair @t1 @t1) @t17))) % 0.39/0.60 (assume @p70 (forall @t19 (=> @t33 @t18))) % 0.39/0.60 (assume @p71 (forall @t5 (=> (tptp.subset @t17 @t38) @t13))) % 0.39/0.60 (assume @p72 (forall @t5 (not (and @t4 @t48)))) % 0.39/0.60 (assume @p73 (forall @t5 (tptp.subset @t1 @t10))) % 0.39/0.60 (assume @p74 (forall @t5 (= @t31 (= @t29 @t1)))) % 0.39/0.60 (assume @p75 (forall @t5 (not (and @t33 @t32 @t48)))) % 0.39/0.60 (assume @p76 (forall @t23 (=> (and @t12 (tptp.subset @t14 @t2)) (tptp.subset (tptp.set_union2 @t1 @t14) @t2)))) % 0.39/0.60 (assume @p77 (forall @t23 (=> @t49 @t13))) % 0.39/0.60 (assume @p78 (forall @t23 (=> @t49 (= @t2 @t14)))) % 0.39/0.60 (step @p79 :rule eq-symm :args (@t36 @t4)) % 0.39/0.60 (step @p80 :rule cong :premises (@p79) :args (@t37)) % 0.39/0.60 (step @p81 :rule eq_resolve :premises (@p32 @p80)) % 0.39/0.60 (step @p82 :rule cong :premises (@p80) :args (@t43)) % 0.39/0.60 (step @p83 :rule eq_resolve :premises (@p57 @p82)) % 0.39/0.60 (step @p84 false :rule chain_m_resolution :premises (@p83 @p81) :args (false (@list false) (@list (forall @t5 (= @t4 @t36))))) % 0.39/0.60 ) % 0.39/0.60 % SZS output end Proof % 0.39/0.60 % cvc5 exiting %------------------------------------------------------------------------------