%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SWV008-1 : TPTP v9.2.1. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n012.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:00:19 AM UTC 2026 % Result : Unsatisfiable 0.16s 0.36s % Output : Proof 0.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.06 % Problem : SWV008-1 : TPTP v9.2.1. Released v1.0.0. % 0.00/0.07 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.08/0.25 % Computer : n012.cluster.edu % 0.08/0.25 % Model : x86_64 x86_64 % 0.08/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.25 % Memory : 8042.1875MB % 0.08/0.25 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.25 % CPULimit : 300 % 0.08/0.25 % WCLimit : 300 % 0.08/0.25 % DateTime : Tue Jun 2 19:52:33 EDT 2026 % 0.08/0.25 % CPUTime : % 0.16/0.33 %----Proving TF0_NAR, FOF, or CNF % 0.16/0.34 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.16/0.36 % SZS status Unsatisfiable % 0.16/0.36 % SZS output start Proof % 0.16/0.37 ( % 0.16/0.37 (declare-sort $$unsorted 0) % 0.16/0.37 (declare-const tptp.a (-> $$unsorted $$unsorted)) % 0.16/0.37 (declare-const tptp.one $$unsorted) % 0.16/0.37 (declare-const tptp.n $$unsorted) % 0.16/0.37 (declare-const tptp.l $$unsorted) % 0.16/0.37 (declare-const tptp.less_than (-> $$unsorted $$unsorted Bool)) % 0.16/0.37 (declare-const tptp.predecessor (-> $$unsorted $$unsorted)) % 0.16/0.37 (declare-const tptp.successor (-> $$unsorted $$unsorted)) % 0.16/0.37 (define @t1 () (@var "X" $$unsorted)) % 0.16/0.37 (define @t2 () (tptp.successor @t1)) % 0.16/0.37 (define @t3 () (@list @t1)) % 0.16/0.37 (define @t4 () (tptp.predecessor @t1)) % 0.16/0.37 (define @t5 () (@var "Y" $$unsorted)) % 0.16/0.37 (define @t6 () (= @t1 @t5)) % 0.16/0.37 (define @t7 () (@list @t1 @t5)) % 0.16/0.37 (define @t8 () (@var "Z" $$unsorted)) % 0.16/0.37 (define @t9 () (tptp.less_than @t5 @t8)) % 0.16/0.37 (define @t10 () (tptp.less_than @t1 @t5)) % 0.16/0.37 (define @t11 () (not @t10)) % 0.16/0.37 (define @t12 () (tptp.less_than @t1 @t8)) % 0.16/0.37 (define @t13 () (tptp.less_than @t5 @t1)) % 0.16/0.37 (define @t14 () (not @t6)) % 0.16/0.37 (define @t15 () (tptp.less_than tptp.n tptp.l)) % 0.16/0.37 (define @t16 () (tptp.less_than tptp.one tptp.l)) % 0.16/0.37 (define @t17 () (tptp.predecessor tptp.l)) % 0.16/0.37 (define @t18 () (tptp.a @t17)) % 0.16/0.37 (define @t19 () (tptp.a tptp.l)) % 0.16/0.37 (define @t20 () (tptp.less_than @t19 @t18)) % 0.16/0.37 (define @t21 () (tptp.a (tptp.predecessor tptp.n))) % 0.16/0.37 (define @t22 () (tptp.a @t1)) % 0.16/0.37 (define @t23 () (not (tptp.less_than @t22 @t21))) % 0.16/0.37 (define @t24 () (tptp.less_than tptp.one tptp.n)) % 0.16/0.37 (define @t25 () (not @t24)) % 0.16/0.37 (define @t26 () (tptp.less_than tptp.n @t1)) % 0.16/0.37 (define @t27 () (tptp.less_than @t1 tptp.n)) % 0.16/0.37 (define @t28 () (or @t27 @t26 @t25 @t23)) % 0.16/0.37 (define @t29 () (forall @t3 @t28)) % 0.16/0.37 (define @t30 () (@list tptp.l)) % 0.16/0.37 (define @t31 () (not @t20)) % 0.16/0.37 (define @t32 () (tptp.less_than tptp.l tptp.n)) % 0.16/0.37 (define @t33 () (not @t32)) % 0.16/0.37 (define @t34 () (not @t16)) % 0.16/0.37 (define @t35 () (or @t34 @t33 @t31)) % 0.16/0.37 (define @t36 () (= tptp.n tptp.l)) % 0.16/0.37 (define @t37 () (or @t15 @t32 @t36)) % 0.16/0.37 (define @t38 () (@list true true false)) % 0.16/0.37 (define @t39 () (or @t27 @t26 @t23)) % 0.16/0.37 (define @t40 () (forall @t3 @t39)) % 0.16/0.37 (define @t41 () (or @t25 @t39)) % 0.16/0.37 (define @t42 () (not (tptp.less_than @t19 @t21))) % 0.16/0.37 (define @t43 () (or @t32 @t15 @t42)) % 0.16/0.37 (assume @p1 (forall @t3 (= (tptp.predecessor @t2) @t1))) % 0.16/0.37 (assume @p2 (forall @t3 (= (tptp.successor @t4) @t1))) % 0.16/0.37 (assume @p3 (forall @t7 (or @t6 (not (= @t4 (tptp.predecessor @t5)))))) % 0.16/0.37 (assume @p4 (forall @t7 (or @t6 (not (= @t2 (tptp.successor @t5)))))) % 0.16/0.37 (assume @p5 (forall @t3 (tptp.less_than @t4 @t1))) % 0.16/0.37 (assume @p6 (forall @t3 (tptp.less_than @t1 @t2))) % 0.16/0.37 (assume @p7 (forall (@list @t1 @t8 @t5) (or @t12 @t11 (not @t9)))) % 0.16/0.37 (assume @p8 (forall @t7 (or @t10 @t13 @t6))) % 0.16/0.37 (assume @p9 (forall @t3 (not (tptp.less_than @t1 @t1)))) % 0.16/0.37 (assume @p10 (forall @t7 (or @t11 (not @t13)))) % 0.16/0.37 (assume @p11 (forall (@list @t5 @t8 @t1) (or @t9 @t14 (not @t12)))) % 0.16/0.37 (assume @p12 (forall (@list @t8 @t5 @t1) (or (tptp.less_than @t8 @t5) @t14 (not (tptp.less_than @t8 @t1))))) % 0.16/0.37 (assume @p13 (not @t15)) % 0.16/0.37 (assume @p14 @t16) % 0.16/0.37 (assume @p15 @t20) % 0.16/0.37 (assume @p16 @t29) % 0.16/0.37 (assume @p17 (forall @t3 (or (not (tptp.less_than tptp.one @t1)) (not @t27) (not (tptp.less_than @t22 (tptp.a @t4)))))) % 0.16/0.37 (step @p18 :rule evaluate :args ((= true false))) % 0.16/0.37 (step @p19 :rule true_intro :premises (@p14)) % 0.16/0.37 (step @p20 :rule instantiate :premises (@p8) :args ((@list tptp.n tptp.l))) % 0.16/0.37 (step @p21 :rule instantiate :premises (@p17) :args (@t30)) % 0.16/0.37 (step @p22 :rule cnf_or_pos :args (@t35)) % 0.16/0.37 (step @p23 :rule reordering :premises (@p22) :args ((or @t34 @t31 @t33 (not @t35)))) % 0.16/0.37 (step @p24 :rule chain_m_resolution :premises (@p23 @p14 @p15 @p21) :args (@t33 (@list false false false) (@list @t16 @t20 @t35))) % 0.16/0.37 (step @p25 :rule cnf_or_pos :args (@t37)) % 0.16/0.37 (step @p26 :rule reordering :premises (@p25) :args ((or @t15 @t36 @t32 (not @t37)))) % 0.16/0.37 (step @p27 :rule chain_m_resolution :premises (@p26 @p13 @p24 @p20) :args (@t36 @t38 (@list @t15 @t32 @t37))) % 0.16/0.37 (step @p28 :rule refl :args (tptp.one)) % 0.16/0.37 (step @p29 :rule cong :premises (@p28 @p27) :args (@t24)) % 0.16/0.37 (step @p30 :rule trans :premises (@p29 @p19)) % 0.16/0.37 (step @p31 :rule true_elim :premises (@p30)) % 0.16/0.37 (step @p32 :rule quant-miniscope-or :args ((= (forall @t3 @t41) (or @t25 @t40)))) % 0.16/0.37 (step @p33 :rule aci_norm :args ((= @t28 @t41))) % 0.16/0.37 (step @p34 :rule cong :premises (@p33) :args (@t29)) % 0.16/0.37 (step @p35 :rule trans :premises (@p34 @p32)) % 0.16/0.37 (step @p36 :rule eq_resolve :premises (@p16 @p35)) % 0.16/0.37 (step @p37 :rule chain_m_resolution :premises (@p36 @p31) :args (@t40 (@list false) (@list @t24))) % 0.16/0.37 (step @p38 :rule instantiate :premises (@p37) :args (@t30)) % 0.16/0.37 (step @p39 :rule cnf_or_pos :args (@t43)) % 0.16/0.37 (step @p40 :rule reordering :premises (@p39) :args ((or @t15 @t32 @t42 (not @t43)))) % 0.16/0.37 (step @p41 :rule chain_m_resolution :premises (@p40 @p13 @p24 @p38) :args (@t42 @t38 (@list @t15 @t32 @t43))) % 0.16/0.37 (step @p42 :rule false_intro :premises (@p41)) % 0.16/0.37 (step @p43 :rule symm :premises (@p27)) % 0.16/0.37 (step @p44 :rule cong :premises (@p43) :args (@t17)) % 0.16/0.37 (step @p45 :rule cong :premises (@p44) :args (@t18)) % 0.16/0.37 (step @p46 :rule refl :args (@t19)) % 0.16/0.37 (step @p47 :rule cong :premises (@p46 @p45) :args (@t20)) % 0.16/0.37 (step @p48 :rule true_intro :premises (@p15)) % 0.16/0.37 (step @p49 :rule symm :premises (@p48)) % 0.16/0.37 (step @p50 :rule trans :premises (@p49 @p47 @p42)) % 0.16/0.37 (step @p51 false :rule eq_resolve :premises (@p50 @p18)) % 0.16/0.37 ) % 0.16/0.37 % SZS output end Proof % 0.16/0.37 % cvc5 exiting %------------------------------------------------------------------------------