%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SWV390+1 : TPTP v9.2.1. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n006.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:20 AM UTC 2026 % Result : Theorem 0.40s 0.62s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : SWV390+1 : TPTP v9.2.1. Released v3.3.0. % 0.13/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.18/0.35 % Computer : n006.cluster.edu % 0.18/0.35 % Model : x86_64 x86_64 % 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.35 % Memory : 8042.1875MB % 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.35 % CPULimit : 300 % 0.18/0.35 % WCLimit : 300 % 0.18/0.35 % DateTime : Tue Jun 2 20:06:19 EDT 2026 % 0.18/0.35 % CPUTime : % 0.33/0.51 %----Proving TF0_NAR, FOF, or CNF % 0.40/0.62 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.40/0.62 % SZS status Theorem % 0.40/0.62 % SZS output start Proof % 0.40/0.62 ( % 0.40/0.62 (declare-sort $$unsorted 0) % 0.40/0.62 (declare-const tptp.findmin_cpq_res (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.check_cpq (-> $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.triple (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.removemin_cpq_eff (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.findmin_cpq_eff (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.remove_cpq (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.insert_pqp (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.insert_cpq (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.less_than (-> $$unsorted $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.strictly_less_than (-> $$unsorted $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.findmin_pqp_res (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.bottom $$unsorted) % 0.40/0.62 (declare-const tptp.create_slb $$unsorted) % 0.40/0.62 (declare-const tptp.lookup_slb (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.isnonempty_slb (-> $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.removemin_cpq_res (-> $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.remove_pqp (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.contains_cpq (-> $$unsorted $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.pair (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.insert_slb (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.ok (-> $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.contains_slb (-> $$unsorted $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.succ_cpq (-> $$unsorted $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.pair_in_list (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.bad $$unsorted) % 0.40/0.62 (declare-const tptp.remove_slb (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.update_slb (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (define @t1 () (@var "W" $$unsorted)) % 0.40/0.62 (define @t2 () (@var "U" $$unsorted)) % 0.40/0.62 (define @t3 () (@var "V" $$unsorted)) % 0.40/0.62 (define @t4 () (tptp.less_than @t2 @t3)) % 0.40/0.62 (define @t5 () (@list @t2 @t3 @t1)) % 0.40/0.62 (define @t6 () (tptp.less_than @t3 @t2)) % 0.40/0.62 (define @t7 () (@list @t2 @t3)) % 0.40/0.62 (define @t8 () (@list @t2)) % 0.40/0.62 (define @t9 () (tptp.pair @t3 @t1)) % 0.40/0.62 (define @t10 () (tptp.insert_slb @t2 @t9)) % 0.40/0.62 (define @t11 () (= @t3 @t1)) % 0.40/0.62 (define @t12 () (tptp.contains_slb @t2 @t1)) % 0.40/0.62 (define @t13 () (@var "X" $$unsorted)) % 0.40/0.62 (define @t14 () (tptp.pair @t3 @t13)) % 0.40/0.62 (define @t15 () (tptp.insert_slb @t2 @t14)) % 0.40/0.62 (define @t16 () (@list @t2 @t3 @t1 @t13)) % 0.40/0.62 (define @t17 () (@var "Y" $$unsorted)) % 0.40/0.62 (define @t18 () (@list @t2 @t3 @t1 @t13 @t17)) % 0.40/0.62 (define @t19 () (and (not @t11) @t12)) % 0.40/0.62 (define @t20 () (tptp.update_slb @t2 @t1)) % 0.40/0.62 (define @t21 () (tptp.update_slb @t15 @t1)) % 0.40/0.62 (define @t22 () (tptp.succ_cpq @t2 @t3)) % 0.40/0.62 (define @t23 () (tptp.triple @t2 tptp.create_slb @t3)) % 0.40/0.62 (define @t24 () (tptp.triple @t2 @t3 @t1)) % 0.40/0.62 (define @t25 () (tptp.check_cpq @t24)) % 0.40/0.62 (define @t26 () (tptp.check_cpq (tptp.triple @t2 (tptp.insert_slb @t3 (tptp.pair @t13 @t17)) @t1))) % 0.40/0.62 (define @t27 () (= @t26 @t25)) % 0.40/0.62 (define @t28 () (tptp.less_than @t17 @t13)) % 0.40/0.62 (define @t29 () (forall @t18 (=> @t28 @t27))) % 0.40/0.62 (define @t30 () (tptp.contains_slb @t3 @t13)) % 0.40/0.62 (define @t31 () (tptp.triple @t2 @t3 tptp.bad)) % 0.40/0.62 (define @t32 () (tptp.insert_cpq @t24 @t13)) % 0.40/0.62 (define @t33 () (tptp.remove_cpq @t24 @t13)) % 0.40/0.62 (define @t34 () (tptp.remove_slb @t3 @t13)) % 0.40/0.62 (define @t35 () (tptp.remove_pqp @t2 @t13)) % 0.40/0.62 (define @t36 () (tptp.lookup_slb @t3 @t13)) % 0.40/0.62 (define @t37 () (tptp.findmin_pqp_res @t2)) % 0.40/0.62 (define @t38 () (tptp.update_slb @t3 @t37)) % 0.40/0.62 (define @t39 () (tptp.findmin_cpq_eff @t24)) % 0.40/0.62 (define @t40 () (= @t39 (tptp.triple @t2 @t38 tptp.bad))) % 0.40/0.62 (define @t41 () (tptp.contains_slb @t3 @t37)) % 0.40/0.62 (define @t42 () (not (= @t3 tptp.create_slb))) % 0.40/0.62 (define @t43 () (tptp.lookup_slb @t3 @t37)) % 0.40/0.62 (define @t44 () (tptp.findmin_cpq_res @t2)) % 0.40/0.62 (define @t45 () (tptp.pair_in_list @t3 @t13 @t17)) % 0.40/0.62 (define @t46 () (@list @t13 @t17)) % 0.40/0.62 (define @t47 () (forall @t46 (=> @t45 @t28))) % 0.40/0.62 (define @t48 () (= @t25 @t47)) % 0.40/0.62 (define @t49 () (forall @t5 @t48)) % 0.40/0.62 (define @t50 () (forall (@list @t13) (not (tptp.check_cpq @t32)))) % 0.40/0.62 (define @t51 () (not @t25)) % 0.40/0.62 (define @t52 () (forall @t5 (=> @t51 @t50))) % 0.40/0.62 (define @t53 () (not @t52)) % 0.40/0.62 (define @t54 () (@var "BOUND_VARIABLE_7784" $$unsorted)) % 0.40/0.62 (define @t55 () (not (tptp.check_cpq (tptp.insert_cpq @t24 @t54)))) % 0.40/0.62 (define @t56 () (or @t25 @t55)) % 0.40/0.62 (define @t57 () (forall (@list @t2 @t3 @t1 @t54) @t56)) % 0.40/0.62 (define @t58 () (@list @t54)) % 0.40/0.62 (define @t59 () (forall @t58 @t56)) % 0.40/0.62 (define @t60 () (forall @t58 @t55)) % 0.40/0.62 (define @t61 () (or @t25 @t60)) % 0.40/0.62 (define @t62 () (@quantifiers_skolemize @t57 3)) % 0.40/0.62 (define @t63 () (@quantifiers_skolemize @t57 2)) % 0.40/0.62 (define @t64 () (@quantifiers_skolemize @t57 1)) % 0.40/0.62 (define @t65 () (@quantifiers_skolemize @t57 0)) % 0.40/0.62 (define @t66 () (tptp.triple @t65 @t64 @t63)) % 0.40/0.62 (define @t67 () (tptp.check_cpq (tptp.insert_cpq @t66 @t62))) % 0.40/0.62 (define @t68 () (not @t67)) % 0.40/0.62 (define @t69 () (tptp.check_cpq @t66)) % 0.40/0.62 (define @t70 () (or @t69 @t68)) % 0.40/0.62 (define @t71 () (@list true)) % 0.40/0.62 (define @t72 () (@list @t70)) % 0.40/0.62 (define @t73 () (tptp.insert_pqp @t65 @t62)) % 0.40/0.62 (define @t74 () (tptp.check_cpq (tptp.triple @t73 (tptp.insert_slb @t64 (tptp.pair @t62 tptp.bottom)) @t63))) % 0.40/0.62 (define @t75 () (tptp.check_cpq (tptp.triple @t73 @t64 @t63))) % 0.40/0.62 (define @t76 () (= @t74 @t75)) % 0.40/0.62 (define @t77 () (tptp.less_than tptp.bottom @t62)) % 0.40/0.62 (define @t78 () (not @t77)) % 0.40/0.62 (define @t79 () (or @t78 @t76)) % 0.40/0.62 (define @t80 () (forall @t46 (or (not (tptp.pair_in_list @t64 @t13 @t17)) @t28))) % 0.40/0.62 (define @t81 () (forall @t5 (= @t25 (forall @t46 (or (not @t45) @t28))))) % 0.40/0.62 (define @t82 () (= @t75 @t80)) % 0.40/0.62 (define @t83 () (= @t80 @t75)) % 0.40/0.62 (define @t84 () (= @t69 @t80)) % 0.40/0.62 (define @t85 () (not @t80)) % 0.40/0.62 (define @t86 () (@list true false)) % 0.40/0.62 (define @t87 () (not @t75)) % 0.40/0.62 (assume @p1 (forall @t5 (=> (and @t4 (tptp.less_than @t3 @t1)) (tptp.less_than @t2 @t1)))) % 0.40/0.62 (assume @p2 (forall @t7 (or @t4 @t6))) % 0.40/0.62 (assume @p3 (forall @t8 (tptp.less_than @t2 @t2))) % 0.40/0.62 (assume @p4 (forall @t7 (= (tptp.strictly_less_than @t2 @t3) (and @t4 (not @t6))))) % 0.40/0.62 (assume @p5 (forall @t8 (tptp.less_than tptp.bottom @t2))) % 0.40/0.62 (assume @p6 (not (tptp.isnonempty_slb tptp.create_slb))) % 0.40/0.62 (assume @p7 (forall @t5 (tptp.isnonempty_slb @t10))) % 0.40/0.62 (assume @p8 (forall @t8 (not (tptp.contains_slb tptp.create_slb @t2)))) % 0.40/0.62 (assume @p9 (forall @t16 (= (tptp.contains_slb @t15 @t1) (or @t12 @t11)))) % 0.40/0.62 (assume @p10 (forall @t7 (not (tptp.pair_in_list tptp.create_slb @t2 @t3)))) % 0.40/0.62 (assume @p11 (forall @t18 (= (tptp.pair_in_list @t15 @t1 @t17) (or (tptp.pair_in_list @t2 @t1 @t17) (and @t11 (= @t13 @t17)))))) % 0.40/0.62 (assume @p12 (forall @t5 (= (tptp.remove_slb @t10 @t3) @t2))) % 0.40/0.62 (assume @p13 (forall @t16 (=> @t19 (= (tptp.remove_slb @t15 @t1) (tptp.insert_slb (tptp.remove_slb @t2 @t1) @t14))))) % 0.40/0.62 (assume @p14 (forall @t5 (= (tptp.lookup_slb @t10 @t3) @t1))) % 0.40/0.62 (assume @p15 (forall @t16 (=> @t19 (= (tptp.lookup_slb @t15 @t1) (tptp.lookup_slb @t2 @t1))))) % 0.40/0.62 (assume @p16 (forall @t8 (= (tptp.update_slb tptp.create_slb @t2) tptp.create_slb))) % 0.40/0.62 (assume @p17 (forall @t16 (=> (tptp.strictly_less_than @t13 @t1) (= @t21 (tptp.insert_slb @t20 @t9))))) % 0.40/0.62 (assume @p18 (forall @t16 (=> (tptp.less_than @t1 @t13) (= @t21 (tptp.insert_slb @t20 @t14))))) % 0.40/0.62 (assume @p19 (forall @t8 (tptp.succ_cpq @t2 @t2))) % 0.40/0.62 (assume @p20 (forall @t5 (=> @t22 (tptp.succ_cpq @t2 (tptp.insert_cpq @t3 @t1))))) % 0.40/0.62 (assume @p21 (forall @t5 (=> @t22 (tptp.succ_cpq @t2 (tptp.remove_cpq @t3 @t1))))) % 0.40/0.62 (assume @p22 (forall @t7 (=> @t22 (tptp.succ_cpq @t2 (tptp.findmin_cpq_eff @t3))))) % 0.40/0.62 (assume @p23 (forall @t7 (=> @t22 (tptp.succ_cpq @t2 (tptp.removemin_cpq_eff @t3))))) % 0.40/0.62 (assume @p24 (forall @t7 (tptp.check_cpq @t23))) % 0.40/0.62 (assume @p25 @t29) % 0.40/0.62 (assume @p26 (forall @t18 (=> (tptp.strictly_less_than @t13 @t17) (= @t26 false)))) % 0.40/0.62 (assume @p27 (forall @t16 (= (tptp.contains_cpq @t24 @t13) @t30))) % 0.40/0.62 (assume @p28 (forall @t7 (= (tptp.ok @t31) false))) % 0.40/0.62 (assume @p29 (forall @t5 (=> (not (tptp.ok @t24)) (= @t1 tptp.bad)))) % 0.40/0.62 (assume @p30 (forall @t16 (= @t32 (tptp.triple (tptp.insert_pqp @t2 @t13) (tptp.insert_slb @t3 (tptp.pair @t13 tptp.bottom)) @t1)))) % 0.40/0.62 (assume @p31 (forall @t16 (=> (not @t30) (= @t33 @t31)))) % 0.40/0.62 (assume @p32 (forall @t16 (=> (and @t30 (tptp.less_than @t36 @t13)) (= @t33 (tptp.triple @t35 @t34 @t1))))) % 0.40/0.62 (assume @p33 (forall @t16 (=> (and @t30 (tptp.strictly_less_than @t13 @t36)) (= @t33 (tptp.triple @t35 @t34 tptp.bad))))) % 0.40/0.62 (assume @p34 (forall @t7 (= (tptp.findmin_cpq_eff @t23) (tptp.triple @t2 tptp.create_slb tptp.bad)))) % 0.40/0.62 (assume @p35 (forall @t16 (=> (and @t42 (not @t41)) @t40))) % 0.40/0.62 (assume @p36 (forall @t16 (=> (and @t42 @t41 (tptp.strictly_less_than @t37 @t43)) @t40))) % 0.40/0.62 (assume @p37 (forall @t16 (=> (and @t42 @t41 (tptp.less_than @t43 @t37)) (= @t39 (tptp.triple @t2 @t38 @t1))))) % 0.40/0.62 (assume @p38 (forall @t7 (= (tptp.findmin_cpq_res @t23) tptp.bottom))) % 0.40/0.62 (assume @p39 (forall @t16 (=> @t42 (= (tptp.findmin_cpq_res @t24) @t37)))) % 0.40/0.62 (assume @p40 (forall @t8 (= (tptp.removemin_cpq_eff @t2) (tptp.remove_cpq (tptp.findmin_cpq_eff @t2) @t44)))) % 0.40/0.62 (assume @p41 (forall @t8 (= (tptp.removemin_cpq_res @t2) @t44))) % 0.40/0.62 (assume @p42 @t49) % 0.40/0.62 (assume @p43 @t53) % 0.40/0.62 (assume @p44 true) % 0.40/0.62 (step @p45 :rule quant-merge-prenex :args ((= (forall @t5 @t59) @t57))) % 0.40/0.62 (step @p46 :rule alpha_equiv :args (@t60 (@list @t54) (@list @t13))) % 0.40/0.62 (step @p47 :rule refl :args (@t25)) % 0.40/0.62 (step @p48 :rule nary_cong :premises (@p47 @p46) :args (@t61)) % 0.40/0.62 (step @p49 :rule quant-miniscope-or :args ((= @t59 @t61))) % 0.40/0.62 (step @p50 :rule trans :premises (@p49 @p48)) % 0.40/0.62 (step @p51 :rule symm :premises (@p50)) % 0.40/0.62 (step @p52 :rule cong :premises (@p51) :args ((forall @t5 (or @t25 @t50)))) % 0.40/0.62 (step @p53 :rule trans :premises (@p52 @p45)) % 0.40/0.62 (step @p54 :rule refl :args (@t50)) % 0.40/0.62 (step @p55 :rule bool-double-not-elim :args (@t25)) % 0.40/0.62 (step @p56 :rule nary_cong :premises (@p55 @p54) :args ((or (not @t51) @t50))) % 0.40/0.62 (step @p57 :rule bool-impl-elim :args (@t51 @t50)) % 0.40/0.62 (step @p58 :rule trans :premises (@p57 @p56)) % 0.40/0.62 (step @p59 :rule cong :premises (@p58) :args (@t52)) % 0.40/0.62 (step @p60 :rule trans :premises (@p59 @p53)) % 0.40/0.62 (step @p61 :rule cong :premises (@p60) :args (@t53)) % 0.40/0.62 (step @p62 :rule eq_resolve :premises (@p43 @p61)) % 0.40/0.62 (step @p63 :rule skolemize :premises (@p62)) % 0.40/0.62 (step @p64 :rule bool-double-not-elim :args (@t67)) % 0.40/0.62 (step @p65 :rule refl :args (@t70)) % 0.40/0.62 (step @p66 :rule nary_cong :premises (@p65 @p64) :args ((or @t70 (not @t68)))) % 0.40/0.62 (step @p67 :rule cnf_or_neg :args (@t70 1)) % 0.40/0.62 (step @p68 :rule eq_resolve :premises (@p67 @p66)) % 0.40/0.62 (step @p69 :rule reordering :premises (@p68) :args ((or @t67 @t70))) % 0.40/0.62 (step @p70 :rule chain_m_resolution :premises (@p69 @p63) :args (@t67 @t71 @t72)) % 0.40/0.62 (step @p71 :rule true_intro :premises (@p70)) % 0.40/0.62 (step @p72 :rule instantiate :premises (@p30) :args ((@list @t65 @t64 @t63 @t62))) % 0.40/0.62 (step @p73 :rule symm :premises (@p72)) % 0.40/0.62 (step @p74 :rule cong :premises (@p73) :args (@t74)) % 0.40/0.62 (step @p75 :rule trans :premises (@p74 @p71)) % 0.40/0.62 (step @p76 :rule true_elim :premises (@p75)) % 0.40/0.62 (step @p77 :rule bool-impl-elim :args (@t28 @t27)) % 0.40/0.62 (step @p78 :rule cong :premises (@p77) :args (@t29)) % 0.40/0.62 (step @p79 :rule eq_resolve :premises (@p25 @p78)) % 0.40/0.62 (step @p80 :rule instantiate :premises (@p79) :args ((@list @t73 @t64 @t63 @t62 tptp.bottom))) % 0.40/0.62 (step @p81 :rule instantiate :premises (@p5) :args ((@list @t62))) % 0.40/0.62 (step @p82 :rule cnf_or_pos :args (@t79)) % 0.40/0.62 (step @p83 :rule reordering :premises (@p82) :args ((or @t78 @t76 (not @t79)))) % 0.40/0.62 (step @p84 :rule chain_m_resolution :premises (@p83 @p81 @p80) :args (@t76 (@list false false) (@list @t77 @t79))) % 0.40/0.62 (step @p85 :rule bool-impl-elim :args (@t45 @t28)) % 0.40/0.62 (step @p86 :rule cong :premises (@p85) :args (@t47)) % 0.40/0.62 (step @p87 :rule refl :args (@t25)) % 0.40/0.62 (step @p88 :rule cong :premises (@p87 @p86) :args (@t48)) % 0.40/0.62 (step @p89 :rule cong :premises (@p88) :args (@t49)) % 0.40/0.62 (step @p90 :rule eq_resolve :premises (@p42 @p89)) % 0.40/0.62 (step @p91 :rule eq-symm :args (@t75 @t80)) % 0.40/0.62 (step @p92 :rule refl :args (@t81)) % 0.40/0.62 (step @p93 :rule cong :premises (@p92 @p91) :args ((=> @t81 @t82))) % 0.40/0.62 (assume-push @p113 @t81) % 0.40/0.62 (step @p95 :rule instantiate :premises (@p90) :args ((@list @t73 @t64 @t63))) % 0.40/0.62 (step-pop @p114 :rule scope :premises (@p95)) % 0.40/0.62 (step @p96 :rule process_scope :premises (@p114) :args (@t82)) % 0.40/0.62 (step @p98 :rule eq_resolve :premises (@p96 @p93)) % 0.40/0.62 (step @p99 :rule implies_elim :premises (@p98)) % 0.40/0.62 (step @p100 :rule chain_m_resolution :premises (@p99 @p90) :args (@t83 (@list false) (@list @t81))) % 0.40/0.62 (step @p101 :rule instantiate :premises (@p90) :args ((@list @t65 @t64 @t63))) % 0.40/0.62 (step @p102 :rule cnf_or_neg :args (@t70 0)) % 0.40/0.62 (step @p103 :rule chain_m_resolution :premises (@p102 @p63) :args ((not @t69) @t71 @t72)) % 0.40/0.62 (step @p104 :rule cnf_equiv_pos2 :args (@t84)) % 0.40/0.62 (step @p105 :rule reordering :premises (@p104) :args ((or @t69 @t85 (not @t84)))) % 0.40/0.62 (step @p106 :rule chain_m_resolution :premises (@p105 @p103 @p101) :args (@t85 @t86 (@list @t69 @t84))) % 0.40/0.62 (step @p107 :rule cnf_equiv_pos2 :args (@t83)) % 0.40/0.62 (step @p108 :rule reordering :premises (@p107) :args ((or @t80 @t87 (not @t83)))) % 0.40/0.62 (step @p109 :rule chain_m_resolution :premises (@p108 @p106 @p100) :args (@t87 @t86 (@list @t80 @t83))) % 0.40/0.62 (step @p110 :rule cnf_equiv_pos1 :args (@t76)) % 0.40/0.62 (step @p111 :rule reordering :premises (@p110) :args ((or @t75 (not @t74) (not @t76)))) % 0.40/0.62 (step @p112 false :rule chain_m_resolution :premises (@p111 @p109 @p84 @p76) :args (false (@list true false false) (@list @t75 @t76 @t74))) % 0.40/0.62 ) % 0.40/0.62 % SZS output end Proof % 0.40/0.62 % cvc5 exiting %------------------------------------------------------------------------------