%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SWV367+1 : 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 : n017.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 09:01:17 AM UTC 2026 % Result : Theorem 0.36s 0.61s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWV367+1 : TPTP v9.2.1. Released v3.3.0. % 0.13/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.35 % Computer : n017.cluster.edu % 0.16/0.35 % Model : x86_64 x86_64 % 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.35 % Memory : 8042.1875MB % 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.35 % CPULimit : 300 % 0.16/0.35 % WCLimit : 300 % 0.16/0.35 % DateTime : Tue Jun 2 20:04:31 EDT 2026 % 0.16/0.35 % CPUTime : % 0.28/0.51 %----Proving TF0_NAR, FOF, or CNF % 0.36/0.61 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.36/0.61 % SZS status Theorem % 0.36/0.61 % SZS output start Proof % 0.36/0.61 ( % 0.36/0.61 (declare-sort $$unsorted 0) % 0.36/0.61 (declare-const tptp.phi (-> $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.pi_removemin (-> $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.pi_sharp_removemin (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.pi_find_min (-> $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.pi_remove (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.i (-> $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.removemin_cpq_res (-> $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.insert_pqp (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.ok (-> $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.findmin_pqp_res (-> $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.removemin_pq_res (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.removemin_pq_eff (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.pi_sharp_remove (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.check_cpq (-> $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.remove_pq (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.insert_cpq (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.findmin_pq_res (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.remove_slb (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.issmallestelement_pq (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.strictly_less_than (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.isnonempty_pq (-> $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.findmin_pq_eff (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.contains_pq (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.isnonempty_slb (-> $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.remove_pqp (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.findmin_cpq_eff (-> $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.pi_sharp_find_min (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.create_pq $$unsorted) % 0.36/0.61 (declare-const tptp.lookup_slb (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.bottom $$unsorted) % 0.36/0.61 (declare-const tptp.insert_pq (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.update_slb (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.contains_cpq (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.create_slb $$unsorted) % 0.36/0.61 (declare-const tptp.less_than (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.pair (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.bad $$unsorted) % 0.36/0.61 (declare-const tptp.insert_slb (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.contains_slb (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.pair_in_list (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.remove_cpq (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.findmin_cpq_res (-> $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.succ_cpq (-> $$unsorted $$unsorted Bool)) % 0.36/0.61 (declare-const tptp.removemin_cpq_eff (-> $$unsorted $$unsorted)) % 0.36/0.61 (declare-const tptp.triple (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.36/0.61 (define @t1 () (@var "W" $$unsorted)) % 0.36/0.61 (define @t2 () (@var "U" $$unsorted)) % 0.36/0.61 (define @t3 () (@var "V" $$unsorted)) % 0.36/0.61 (define @t4 () (tptp.less_than @t3 @t1)) % 0.36/0.61 (define @t5 () (tptp.less_than @t2 @t3)) % 0.36/0.61 (define @t6 () (@list @t2 @t3 @t1)) % 0.36/0.61 (define @t7 () (tptp.less_than @t3 @t2)) % 0.36/0.61 (define @t8 () (@list @t2 @t3)) % 0.36/0.61 (define @t9 () (@list @t2)) % 0.36/0.61 (define @t10 () (tptp.insert_pq @t2 @t3)) % 0.36/0.61 (define @t11 () (= @t3 @t1)) % 0.36/0.61 (define @t12 () (tptp.contains_pq @t2 @t1)) % 0.36/0.61 (define @t13 () (tptp.issmallestelement_pq @t2 @t3)) % 0.36/0.61 (define @t14 () (not @t11)) % 0.36/0.61 (define @t15 () (tptp.contains_pq @t2 @t3)) % 0.36/0.61 (define @t16 () (and @t15 @t13)) % 0.36/0.61 (define @t17 () (tptp.pair @t3 @t1)) % 0.36/0.61 (define @t18 () (tptp.insert_slb @t2 @t17)) % 0.36/0.61 (define @t19 () (tptp.contains_slb @t2 @t1)) % 0.36/0.61 (define @t20 () (@var "X" $$unsorted)) % 0.36/0.61 (define @t21 () (tptp.pair @t3 @t20)) % 0.36/0.61 (define @t22 () (tptp.insert_slb @t2 @t21)) % 0.36/0.61 (define @t23 () (@list @t2 @t3 @t1 @t20)) % 0.36/0.61 (define @t24 () (@var "Y" $$unsorted)) % 0.36/0.61 (define @t25 () (@list @t2 @t3 @t1 @t20 @t24)) % 0.36/0.61 (define @t26 () (and @t14 @t19)) % 0.36/0.61 (define @t27 () (tptp.update_slb @t2 @t1)) % 0.36/0.61 (define @t28 () (tptp.update_slb @t22 @t1)) % 0.36/0.61 (define @t29 () (tptp.succ_cpq @t2 @t3)) % 0.36/0.61 (define @t30 () (tptp.triple @t2 tptp.create_slb @t3)) % 0.36/0.61 (define @t31 () (tptp.triple @t2 @t3 @t1)) % 0.36/0.61 (define @t32 () (tptp.triple @t2 (tptp.insert_slb @t3 (tptp.pair @t20 @t24)) @t1)) % 0.36/0.61 (define @t33 () (tptp.check_cpq @t32)) % 0.36/0.61 (define @t34 () (tptp.contains_slb @t3 @t20)) % 0.36/0.61 (define @t35 () (tptp.triple @t2 @t3 tptp.bad)) % 0.36/0.61 (define @t36 () (tptp.remove_cpq @t31 @t20)) % 0.36/0.61 (define @t37 () (tptp.remove_slb @t3 @t20)) % 0.36/0.61 (define @t38 () (tptp.remove_pqp @t2 @t20)) % 0.36/0.61 (define @t39 () (tptp.lookup_slb @t3 @t20)) % 0.36/0.61 (define @t40 () (tptp.findmin_pqp_res @t2)) % 0.36/0.61 (define @t41 () (tptp.update_slb @t3 @t40)) % 0.36/0.61 (define @t42 () (tptp.findmin_cpq_eff @t31)) % 0.36/0.61 (define @t43 () (= @t42 (tptp.triple @t2 @t41 tptp.bad))) % 0.36/0.61 (define @t44 () (tptp.contains_slb @t3 @t40)) % 0.36/0.61 (define @t45 () (not (= @t3 tptp.create_slb))) % 0.36/0.61 (define @t46 () (tptp.lookup_slb @t3 @t40)) % 0.36/0.61 (define @t47 () (tptp.findmin_cpq_res @t2)) % 0.36/0.61 (define @t48 () (tptp.i @t30)) % 0.36/0.61 (define @t49 () (forall @t8 (= @t48 tptp.create_pq))) % 0.36/0.61 (define @t50 () (tptp.i @t2)) % 0.36/0.61 (define @t51 () (@list @t3)) % 0.36/0.61 (define @t52 () (exists @t51 (tptp.pi_sharp_find_min @t50 @t3))) % 0.36/0.61 (define @t53 () (= (tptp.i (tptp.remove_cpq @t30 @t1)) (tptp.remove_pq @t48 @t1))) % 0.36/0.61 (define @t54 () (tptp.contains_pq @t48 @t1)) % 0.36/0.61 (define @t55 () (forall @t6 (=> @t54 @t53))) % 0.36/0.61 (define @t56 () (not @t55)) % 0.36/0.61 (define @t57 () (forall @t6 (or (not @t54) @t53))) % 0.36/0.61 (define @t58 () (@quantifiers_skolemize @t57 2)) % 0.36/0.61 (define @t59 () (@quantifiers_skolemize @t57 1)) % 0.36/0.61 (define @t60 () (@quantifiers_skolemize @t57 0)) % 0.36/0.61 (define @t61 () (tptp.triple @t60 tptp.create_slb @t59)) % 0.36/0.61 (define @t62 () (tptp.i @t61)) % 0.36/0.61 (define @t63 () (tptp.contains_pq @t62 @t58)) % 0.36/0.61 (define @t64 () (not @t63)) % 0.36/0.61 (define @t65 () (or @t64 (= (tptp.i (tptp.remove_cpq @t61 @t58)) (tptp.remove_pq @t62 @t58)))) % 0.36/0.61 (assume @p1 (forall @t6 (=> (and @t5 @t4) (tptp.less_than @t2 @t1)))) % 0.36/0.61 (assume @p2 (forall @t8 (or @t5 @t7))) % 0.36/0.61 (assume @p3 (forall @t9 (tptp.less_than @t2 @t2))) % 0.36/0.61 (assume @p4 (forall @t8 (= (tptp.strictly_less_than @t2 @t3) (and @t5 (not @t7))))) % 0.36/0.61 (assume @p5 (forall @t9 (tptp.less_than tptp.bottom @t2))) % 0.36/0.61 (assume @p6 (not (tptp.isnonempty_pq tptp.create_pq))) % 0.36/0.61 (assume @p7 (forall @t8 (tptp.isnonempty_pq @t10))) % 0.36/0.61 (assume @p8 (forall @t9 (not (tptp.contains_pq tptp.create_pq @t2)))) % 0.36/0.61 (assume @p9 (forall @t6 (= (tptp.contains_pq @t10 @t1) (or @t12 @t11)))) % 0.36/0.61 (assume @p10 (forall @t8 (= @t13 (forall (@list @t1) (=> @t12 @t4))))) % 0.36/0.61 (assume @p11 (forall @t8 (= (tptp.remove_pq @t10 @t3) @t2))) % 0.36/0.61 (assume @p12 (forall @t6 (=> (and @t12 @t14) (= (tptp.remove_pq @t10 @t1) (tptp.insert_pq (tptp.remove_pq @t2 @t1) @t3))))) % 0.36/0.61 (assume @p13 (forall @t8 (=> @t16 (= (tptp.findmin_pq_eff @t2 @t3) @t2)))) % 0.36/0.61 (assume @p14 (forall @t8 (=> @t16 (= (tptp.findmin_pq_res @t2 @t3) @t3)))) % 0.36/0.61 (assume @p15 (forall @t8 (=> @t16 (= (tptp.removemin_pq_eff @t2 @t3) (tptp.remove_pq @t2 @t3))))) % 0.36/0.61 (assume @p16 (forall @t8 (=> @t16 (= (tptp.removemin_pq_res @t2 @t3) @t3)))) % 0.36/0.61 (assume @p17 (forall @t6 (= (tptp.insert_pq @t10 @t1) (tptp.insert_pq (tptp.insert_pq @t2 @t1) @t3)))) % 0.36/0.61 (assume @p18 (not (tptp.isnonempty_slb tptp.create_slb))) % 0.36/0.61 (assume @p19 (forall @t6 (tptp.isnonempty_slb @t18))) % 0.36/0.61 (assume @p20 (forall @t9 (not (tptp.contains_slb tptp.create_slb @t2)))) % 0.36/0.61 (assume @p21 (forall @t23 (= (tptp.contains_slb @t22 @t1) (or @t19 @t11)))) % 0.36/0.61 (assume @p22 (forall @t8 (not (tptp.pair_in_list tptp.create_slb @t2 @t3)))) % 0.36/0.61 (assume @p23 (forall @t25 (= (tptp.pair_in_list @t22 @t1 @t24) (or (tptp.pair_in_list @t2 @t1 @t24) (and @t11 (= @t20 @t24)))))) % 0.36/0.61 (assume @p24 (forall @t6 (= (tptp.remove_slb @t18 @t3) @t2))) % 0.36/0.61 (assume @p25 (forall @t23 (=> @t26 (= (tptp.remove_slb @t22 @t1) (tptp.insert_slb (tptp.remove_slb @t2 @t1) @t21))))) % 0.36/0.61 (assume @p26 (forall @t6 (= (tptp.lookup_slb @t18 @t3) @t1))) % 0.36/0.61 (assume @p27 (forall @t23 (=> @t26 (= (tptp.lookup_slb @t22 @t1) (tptp.lookup_slb @t2 @t1))))) % 0.36/0.61 (assume @p28 (forall @t9 (= (tptp.update_slb tptp.create_slb @t2) tptp.create_slb))) % 0.36/0.61 (assume @p29 (forall @t23 (=> (tptp.strictly_less_than @t20 @t1) (= @t28 (tptp.insert_slb @t27 @t17))))) % 0.36/0.61 (assume @p30 (forall @t23 (=> (tptp.less_than @t1 @t20) (= @t28 (tptp.insert_slb @t27 @t21))))) % 0.36/0.62 (assume @p31 (forall @t9 (tptp.succ_cpq @t2 @t2))) % 0.36/0.62 (assume @p32 (forall @t6 (=> @t29 (tptp.succ_cpq @t2 (tptp.insert_cpq @t3 @t1))))) % 0.36/0.62 (assume @p33 (forall @t6 (=> @t29 (tptp.succ_cpq @t2 (tptp.remove_cpq @t3 @t1))))) % 0.36/0.62 (assume @p34 (forall @t8 (=> @t29 (tptp.succ_cpq @t2 (tptp.findmin_cpq_eff @t3))))) % 0.36/0.62 (assume @p35 (forall @t8 (=> @t29 (tptp.succ_cpq @t2 (tptp.removemin_cpq_eff @t3))))) % 0.36/0.62 (assume @p36 (forall @t8 (tptp.check_cpq @t30))) % 0.36/0.62 (assume @p37 (forall @t25 (=> (tptp.less_than @t24 @t20) (= @t33 (tptp.check_cpq @t31))))) % 0.36/0.62 (assume @p38 (forall @t25 (=> (tptp.strictly_less_than @t20 @t24) (= @t33 false)))) % 0.36/0.62 (assume @p39 (forall @t23 (= (tptp.contains_cpq @t31 @t20) @t34))) % 0.36/0.62 (assume @p40 (forall @t8 (= (tptp.ok @t35) false))) % 0.36/0.62 (assume @p41 (forall @t6 (=> (not (tptp.ok @t31)) (= @t1 tptp.bad)))) % 0.36/0.62 (assume @p42 (forall @t23 (= (tptp.insert_cpq @t31 @t20) (tptp.triple (tptp.insert_pqp @t2 @t20) (tptp.insert_slb @t3 (tptp.pair @t20 tptp.bottom)) @t1)))) % 0.36/0.62 (assume @p43 (forall @t23 (=> (not @t34) (= @t36 @t35)))) % 0.36/0.62 (assume @p44 (forall @t23 (=> (and @t34 (tptp.less_than @t39 @t20)) (= @t36 (tptp.triple @t38 @t37 @t1))))) % 0.36/0.62 (assume @p45 (forall @t23 (=> (and @t34 (tptp.strictly_less_than @t20 @t39)) (= @t36 (tptp.triple @t38 @t37 tptp.bad))))) % 0.36/0.62 (assume @p46 (forall @t8 (= (tptp.findmin_cpq_eff @t30) (tptp.triple @t2 tptp.create_slb tptp.bad)))) % 0.36/0.62 (assume @p47 (forall @t23 (=> (and @t45 (not @t44)) @t43))) % 0.36/0.62 (assume @p48 (forall @t23 (=> (and @t45 @t44 (tptp.strictly_less_than @t40 @t46)) @t43))) % 0.36/0.62 (assume @p49 (forall @t23 (=> (and @t45 @t44 (tptp.less_than @t46 @t40)) (= @t42 (tptp.triple @t2 @t41 @t1))))) % 0.36/0.62 (assume @p50 (forall @t8 (= (tptp.findmin_cpq_res @t30) tptp.bottom))) % 0.36/0.62 (assume @p51 (forall @t23 (=> @t45 (= (tptp.findmin_cpq_res @t31) @t40)))) % 0.36/0.62 (assume @p52 (forall @t9 (= (tptp.removemin_cpq_eff @t2) (tptp.remove_cpq (tptp.findmin_cpq_eff @t2) @t47)))) % 0.36/0.62 (assume @p53 (forall @t9 (= (tptp.removemin_cpq_res @t2) @t47))) % 0.36/0.62 (assume @p54 @t49) % 0.36/0.62 (assume @p55 (forall @t25 (= (tptp.i @t32) (tptp.insert_pq (tptp.i @t31) @t20)))) % 0.36/0.62 (assume @p56 (forall @t8 (= (tptp.pi_sharp_remove @t2 @t3) @t15))) % 0.36/0.62 (assume @p57 (forall @t8 (= (tptp.pi_remove @t2 @t3) (tptp.pi_sharp_remove @t50 @t3)))) % 0.36/0.62 (assume @p58 (forall @t8 (= (tptp.pi_sharp_find_min @t2 @t3) @t16))) % 0.36/0.62 (assume @p59 (forall @t9 (= (tptp.pi_find_min @t2) @t52))) % 0.36/0.62 (assume @p60 (forall @t8 (= (tptp.pi_sharp_removemin @t2 @t3) @t16))) % 0.36/0.62 (assume @p61 (forall @t9 (= (tptp.pi_removemin @t2) @t52))) % 0.36/0.62 (assume @p62 (forall @t9 (= (tptp.phi @t2) (exists @t51 (and @t29 (tptp.ok @t3) (tptp.check_cpq @t3)))))) % 0.36/0.62 (assume @p63 @t56) % 0.36/0.62 (assume @p64 true) % 0.36/0.62 (step @p65 :rule evaluate :args ((= true false))) % 0.36/0.62 (step @p66 :rule instantiate :premises (@p8) :args ((@list @t58))) % 0.36/0.62 (step @p67 :rule false_intro :premises (@p66)) % 0.36/0.62 (step @p68 :rule refl :args (@t58)) % 0.36/0.62 (step @p69 :rule eq-symm :args (@t48 tptp.create_pq)) % 0.36/0.62 (step @p70 :rule cong :premises (@p69) :args (@t49)) % 0.36/0.62 (step @p71 :rule eq_resolve :premises (@p54 @p70)) % 0.36/0.62 (step @p72 :rule instantiate :premises (@p71) :args ((@list @t60 @t59))) % 0.36/0.62 (step @p73 :rule symm :premises (@p72)) % 0.36/0.62 (step @p74 :rule cong :premises (@p73 @p68) :args (@t63)) % 0.36/0.62 (step @p75 :rule bool-impl-elim :args (@t54 @t53)) % 0.36/0.62 (step @p76 :rule cong :premises (@p75) :args (@t55)) % 0.36/0.62 (step @p77 :rule cong :premises (@p76) :args (@t56)) % 0.36/0.62 (step @p78 :rule eq_resolve :premises (@p63 @p77)) % 0.36/0.62 (step @p79 :rule skolemize :premises (@p78)) % 0.36/0.62 (step @p80 :rule bool-double-not-elim :args (@t63)) % 0.36/0.62 (step @p81 :rule refl :args (@t65)) % 0.36/0.62 (step @p82 :rule nary_cong :premises (@p81 @p80) :args ((or @t65 (not @t64)))) % 0.36/0.62 (step @p83 :rule cnf_or_neg :args (@t65 0)) % 0.36/0.62 (step @p84 :rule eq_resolve :premises (@p83 @p82)) % 0.36/0.62 (step @p85 :rule reordering :premises (@p84) :args ((or @t63 @t65))) % 0.36/0.62 (step @p86 :rule chain_m_resolution :premises (@p85 @p79) :args (@t63 (@list true) (@list @t65))) % 0.36/0.62 (step @p87 :rule true_intro :premises (@p86)) % 0.36/0.62 (step @p88 :rule symm :premises (@p87)) % 0.36/0.62 (step @p89 :rule trans :premises (@p88 @p74 @p67)) % 0.36/0.62 (step @p90 false :rule eq_resolve :premises (@p89 @p65)) % 0.36/0.62 ) % 0.36/0.62 % SZS output end Proof % 0.36/0.62 % cvc5 exiting %------------------------------------------------------------------------------