%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SWV392+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 : n015.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.37s 0.57s % Output : Proof 0.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWV392+1 : TPTP v9.2.1. Released v3.3.0. % 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n015.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 20:06:34 EDT 2026 % 0.16/0.34 % CPUTime : % 0.26/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.37/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.37/0.57 % SZS status Theorem % 0.37/0.57 % SZS output start Proof % 0.37/0.57 ( % 0.37/0.57 (declare-sort $$unsorted 0) % 0.37/0.57 (declare-const tptp.update_slb (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.57 (declare-const tptp.remove_slb (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.57 (declare-const tptp.pair_in_list (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.37/0.57 (declare-const tptp.contains_slb (-> $$unsorted $$unsorted Bool)) % 0.37/0.57 (declare-const tptp.insert_slb (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.57 (declare-const tptp.pair (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.57 (declare-const tptp.isnonempty_slb (-> $$unsorted Bool)) % 0.37/0.57 (declare-const tptp.lookup_slb (-> $$unsorted $$unsorted $$unsorted)) % 0.37/0.57 (declare-const tptp.create_slb $$unsorted) % 0.37/0.57 (declare-const tptp.bottom $$unsorted) % 0.37/0.57 (declare-const tptp.strictly_less_than (-> $$unsorted $$unsorted Bool)) % 0.37/0.57 (declare-const tptp.less_than (-> $$unsorted $$unsorted Bool)) % 0.37/0.57 (define @t1 () (@var "W" $$unsorted)) % 0.37/0.57 (define @t2 () (@var "U" $$unsorted)) % 0.37/0.57 (define @t3 () (@var "V" $$unsorted)) % 0.37/0.57 (define @t4 () (tptp.less_than @t2 @t3)) % 0.37/0.57 (define @t5 () (@list @t2 @t3 @t1)) % 0.37/0.57 (define @t6 () (tptp.less_than @t3 @t2)) % 0.37/0.57 (define @t7 () (@list @t2 @t3)) % 0.37/0.57 (define @t8 () (@list @t2)) % 0.37/0.57 (define @t9 () (tptp.pair @t3 @t1)) % 0.37/0.57 (define @t10 () (tptp.insert_slb @t2 @t9)) % 0.37/0.57 (define @t11 () (forall @t8 (not (tptp.contains_slb tptp.create_slb @t2)))) % 0.37/0.57 (define @t12 () (= @t3 @t1)) % 0.37/0.57 (define @t13 () (tptp.contains_slb @t2 @t1)) % 0.37/0.57 (define @t14 () (@var "X" $$unsorted)) % 0.37/0.57 (define @t15 () (tptp.pair @t3 @t14)) % 0.37/0.57 (define @t16 () (tptp.insert_slb @t2 @t15)) % 0.37/0.57 (define @t17 () (@list @t2 @t3 @t1 @t14)) % 0.37/0.57 (define @t18 () (tptp.pair_in_list tptp.create_slb @t2 @t3)) % 0.37/0.57 (define @t19 () (not @t18)) % 0.37/0.57 (define @t20 () (@var "Y" $$unsorted)) % 0.37/0.57 (define @t21 () (and (not @t12) @t13)) % 0.37/0.57 (define @t22 () (tptp.update_slb @t2 @t1)) % 0.37/0.57 (define @t23 () (tptp.update_slb @t16 @t1)) % 0.37/0.57 (define @t24 () (= @t2 @t1)) % 0.37/0.57 (define @t25 () (tptp.pair_in_list (tptp.remove_slb tptp.create_slb @t1) @t2 @t3)) % 0.37/0.57 (define @t26 () (or @t25 @t24)) % 0.37/0.57 (define @t27 () (tptp.contains_slb tptp.create_slb @t1)) % 0.37/0.57 (define @t28 () (@list @t1)) % 0.37/0.57 (define @t29 () (forall @t28 (=> @t27 @t26))) % 0.37/0.57 (define @t30 () (=> @t18 @t29)) % 0.37/0.57 (define @t31 () (forall @t7 @t30)) % 0.37/0.57 (define @t32 () (not @t31)) % 0.37/0.57 (define @t33 () (@var "BOUND_VARIABLE_7563" $$unsorted)) % 0.37/0.57 (define @t34 () (= @t2 @t33)) % 0.37/0.57 (define @t35 () (tptp.pair_in_list (tptp.remove_slb tptp.create_slb @t33) @t2 @t3)) % 0.37/0.57 (define @t36 () (not (tptp.contains_slb tptp.create_slb @t33))) % 0.37/0.57 (define @t37 () (or @t19 @t36 @t35 @t34)) % 0.37/0.57 (define @t38 () (or @t36 @t35 @t34)) % 0.37/0.57 (define @t39 () (or @t19 @t38)) % 0.37/0.57 (define @t40 () (@list @t2 @t3 @t33)) % 0.37/0.57 (define @t41 () (forall @t40 @t39)) % 0.37/0.57 (define @t42 () (@list @t33)) % 0.37/0.57 (define @t43 () (forall @t42 @t39)) % 0.37/0.57 (define @t44 () (forall @t42 @t38)) % 0.37/0.57 (define @t45 () (or @t19 @t44)) % 0.37/0.57 (define @t46 () (not @t27)) % 0.37/0.57 (define @t47 () (or @t46 @t25 @t24)) % 0.37/0.57 (define @t48 () (forall @t28 @t47)) % 0.37/0.57 (define @t49 () (forall @t40 @t37)) % 0.37/0.57 (define @t50 () (@quantifiers_skolemize @t49 2)) % 0.37/0.57 (define @t51 () (tptp.contains_slb tptp.create_slb @t50)) % 0.37/0.57 (define @t52 () (@quantifiers_skolemize @t49 0)) % 0.37/0.57 (define @t53 () (@quantifiers_skolemize @t49 1)) % 0.37/0.57 (define @t54 () (not @t51)) % 0.37/0.57 (define @t55 () (or (not (tptp.pair_in_list tptp.create_slb @t52 @t53)) @t54 (tptp.pair_in_list (tptp.remove_slb tptp.create_slb @t50) @t52 @t53) (= @t52 @t50))) % 0.37/0.57 (assume @p1 (forall @t5 (=> (and @t4 (tptp.less_than @t3 @t1)) (tptp.less_than @t2 @t1)))) % 0.37/0.57 (assume @p2 (forall @t7 (or @t4 @t6))) % 0.37/0.57 (assume @p3 (forall @t8 (tptp.less_than @t2 @t2))) % 0.37/0.57 (assume @p4 (forall @t7 (= (tptp.strictly_less_than @t2 @t3) (and @t4 (not @t6))))) % 0.37/0.57 (assume @p5 (forall @t8 (tptp.less_than tptp.bottom @t2))) % 0.37/0.57 (assume @p6 (not (tptp.isnonempty_slb tptp.create_slb))) % 0.37/0.57 (assume @p7 (forall @t5 (tptp.isnonempty_slb @t10))) % 0.37/0.57 (assume @p8 @t11) % 0.37/0.57 (assume @p9 (forall @t17 (= (tptp.contains_slb @t16 @t1) (or @t13 @t12)))) % 0.37/0.57 (assume @p10 (forall @t7 @t19)) % 0.37/0.57 (assume @p11 (forall (@list @t2 @t3 @t1 @t14 @t20) (= (tptp.pair_in_list @t16 @t1 @t20) (or (tptp.pair_in_list @t2 @t1 @t20) (and @t12 (= @t14 @t20)))))) % 0.37/0.57 (assume @p12 (forall @t5 (= (tptp.remove_slb @t10 @t3) @t2))) % 0.37/0.57 (assume @p13 (forall @t17 (=> @t21 (= (tptp.remove_slb @t16 @t1) (tptp.insert_slb (tptp.remove_slb @t2 @t1) @t15))))) % 0.37/0.57 (assume @p14 (forall @t5 (= (tptp.lookup_slb @t10 @t3) @t1))) % 0.37/0.57 (assume @p15 (forall @t17 (=> @t21 (= (tptp.lookup_slb @t16 @t1) (tptp.lookup_slb @t2 @t1))))) % 0.37/0.57 (assume @p16 (forall @t8 (= (tptp.update_slb tptp.create_slb @t2) tptp.create_slb))) % 0.37/0.57 (assume @p17 (forall @t17 (=> (tptp.strictly_less_than @t14 @t1) (= @t23 (tptp.insert_slb @t22 @t9))))) % 0.37/0.57 (assume @p18 (forall @t17 (=> (tptp.less_than @t1 @t14) (= @t23 (tptp.insert_slb @t22 @t15))))) % 0.37/0.57 (assume @p19 @t32) % 0.37/0.57 (assume @p20 true) % 0.37/0.57 (step @p21 :rule aci_norm :args ((= @t39 @t37))) % 0.37/0.57 (step @p22 :rule cong :premises (@p21) :args (@t41)) % 0.37/0.57 (step @p23 :rule quant-merge-prenex :args ((= (forall @t7 @t43) @t41))) % 0.37/0.57 (step @p24 :rule alpha_equiv :args (@t44 (@list @t33) (@list @t1))) % 0.37/0.57 (step @p25 :rule refl :args (@t19)) % 0.37/0.57 (step @p26 :rule nary_cong :premises (@p25 @p24) :args (@t45)) % 0.37/0.57 (step @p27 :rule quant-miniscope-or :args ((= @t43 @t45))) % 0.37/0.57 (step @p28 :rule trans :premises (@p27 @p26)) % 0.37/0.57 (step @p29 :rule symm :premises (@p28)) % 0.37/0.57 (step @p30 :rule cong :premises (@p29) :args ((forall @t7 (or @t19 @t48)))) % 0.37/0.57 (step @p31 :rule trans :premises (@p30 @p23)) % 0.37/0.57 (step @p32 :rule trans :premises (@p31 @p22)) % 0.37/0.57 (step @p33 :rule bool-impl-elim :args (@t18 @t48)) % 0.37/0.57 (step @p34 :rule cong :premises (@p33) :args ((forall @t7 (=> @t18 @t48)))) % 0.37/0.57 (step @p35 :rule trans :premises (@p34 @p32)) % 0.37/0.57 (step @p36 :rule aci_norm :args ((= (or @t46 @t26) @t47))) % 0.37/0.57 (step @p37 :rule bool-impl-elim :args (@t27 @t26)) % 0.37/0.57 (step @p38 :rule trans :premises (@p37 @p36)) % 0.37/0.57 (step @p39 :rule cong :premises (@p38) :args (@t29)) % 0.37/0.57 (step @p40 :rule refl :args (@t18)) % 0.37/0.57 (step @p41 :rule cong :premises (@p40 @p39) :args (@t30)) % 0.37/0.57 (step @p42 :rule cong :premises (@p41) :args (@t31)) % 0.37/0.57 (step @p43 :rule trans :premises (@p42 @p35)) % 0.37/0.57 (step @p44 :rule cong :premises (@p43) :args (@t32)) % 0.37/0.57 (step @p45 :rule eq_resolve :premises (@p19 @p44)) % 0.37/0.57 (step @p46 :rule skolemize :premises (@p45)) % 0.37/0.57 (step @p47 :rule bool-double-not-elim :args (@t51)) % 0.37/0.57 (step @p48 :rule refl :args (@t55)) % 0.37/0.57 (step @p49 :rule nary_cong :premises (@p48 @p47) :args ((or @t55 (not @t54)))) % 0.37/0.57 (step @p50 :rule cnf_or_neg :args (@t55 1)) % 0.37/0.57 (step @p51 :rule eq_resolve :premises (@p50 @p49)) % 0.37/0.57 (step @p52 :rule reordering :premises (@p51) :args ((or @t51 @t55))) % 0.37/0.57 (step @p53 :rule chain_m_resolution :premises (@p52 @p46) :args (@t51 (@list true) (@list @t55))) % 0.37/0.57 (assume-push @p60 @t11) % 0.37/0.57 (step @p55 :rule instantiate :premises (@p8) :args ((@list @t50))) % 0.37/0.57 (step-pop @p61 :rule scope :premises (@p55)) % 0.37/0.57 (step @p56 :rule process_scope :premises (@p61) :args (@t54)) % 0.37/0.57 (step @p58 :rule implies_elim :premises (@p56)) % 0.37/0.57 (step @p59 false :rule chain_m_resolution :premises (@p58 @p53 @p8) :args (false (@list false false) (@list @t51 @t11))) % 0.37/0.57 ) % 0.37/0.57 % SZS output end Proof % 0.37/0.57 % cvc5 exiting %------------------------------------------------------------------------------