%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SWW400-1 : TPTP v9.2.1. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n023.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:04:52 AM UTC 2026 % Result : Unsatisfiable 0.45s 0.63s % Output : Proof 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWW400-1 : TPTP v9.2.1. Released v5.2.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 : n023.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 21:56:58 EDT 2026 % 0.16/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.45/0.63 % SZS status Unsatisfiable % 0.45/0.63 % SZS output start Proof % 0.45/0.64 ( % 0.45/0.64 (declare-sort $$unsorted 0) % 0.45/0.64 (declare-const tptp.emp $$unsorted) % 0.45/0.64 (declare-const tptp.x2 $$unsorted) % 0.45/0.64 (declare-const tptp.heap (-> $$unsorted Bool)) % 0.45/0.64 (declare-const tptp.next (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.64 (declare-const tptp.x1 $$unsorted) % 0.45/0.64 (declare-const tptp.lseg (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.64 (declare-const tptp.nil $$unsorted) % 0.45/0.64 (declare-const tptp.sep (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.64 (define @t1 () (@var "Sigma" $$unsorted)) % 0.45/0.64 (define @t2 () (@var "S" $$unsorted)) % 0.45/0.64 (define @t3 () (@var "T" $$unsorted)) % 0.45/0.64 (define @t4 () (forall (@list @t2 @t3 @t1) (= (tptp.sep @t2 (tptp.sep @t3 @t1)) (tptp.sep @t3 (tptp.sep @t2 @t1))))) % 0.45/0.64 (define @t5 () (@var "X" $$unsorted)) % 0.45/0.64 (define @t6 () (tptp.sep (tptp.lseg @t5 @t5) @t1)) % 0.45/0.64 (define @t7 () (forall (@list @t5 @t1) (= @t6 @t1))) % 0.45/0.64 (define @t8 () (@var "Y" $$unsorted)) % 0.45/0.64 (define @t9 () (@list @t8 @t1)) % 0.45/0.64 (define @t10 () (@var "Z" $$unsorted)) % 0.45/0.64 (define @t11 () (tptp.next @t5 @t8)) % 0.45/0.64 (define @t12 () (@list @t5 @t8 @t10 @t1)) % 0.45/0.64 (define @t13 () (= @t5 @t10)) % 0.45/0.64 (define @t14 () (tptp.lseg @t5 @t10)) % 0.45/0.64 (define @t15 () (tptp.sep @t14 @t1)) % 0.45/0.64 (define @t16 () (= @t5 @t8)) % 0.45/0.64 (define @t17 () (tptp.lseg @t5 @t8)) % 0.45/0.64 (define @t18 () (tptp.lseg @t8 @t10)) % 0.45/0.64 (define @t19 () (forall @t12 (or (not (tptp.heap (tptp.sep @t11 (tptp.sep @t18 @t1)))) @t16 (tptp.heap @t15)))) % 0.45/0.64 (define @t20 () (@var "W" $$unsorted)) % 0.45/0.64 (define @t21 () (tptp.sep (tptp.next @t10 @t20) @t1)) % 0.45/0.64 (define @t22 () (@list @t5 @t8 @t10 @t20 @t1)) % 0.45/0.64 (define @t23 () (tptp.sep (tptp.lseg @t10 @t20) @t1)) % 0.45/0.64 (define @t24 () (= tptp.nil tptp.x2)) % 0.45/0.64 (define @t25 () (tptp.lseg tptp.x1 tptp.x2)) % 0.45/0.64 (define @t26 () (tptp.sep @t25 tptp.emp)) % 0.45/0.64 (define @t27 () (tptp.next tptp.x2 tptp.nil)) % 0.45/0.64 (define @t28 () (tptp.heap (tptp.sep (tptp.lseg tptp.x1 tptp.nil) tptp.emp))) % 0.45/0.64 (define @t29 () (tptp.lseg tptp.x2 tptp.nil)) % 0.45/0.64 (define @t30 () (tptp.sep @t25 (tptp.sep @t29 tptp.emp))) % 0.45/0.64 (define @t31 () (not (tptp.heap @t30))) % 0.45/0.64 (define @t32 () (or @t31 @t28)) % 0.45/0.64 (define @t33 () (tptp.sep @t29 @t26)) % 0.45/0.64 (define @t34 () (= @t30 @t33)) % 0.45/0.64 (define @t35 () (@list false)) % 0.45/0.64 (define @t36 () (tptp.heap @t33)) % 0.45/0.64 (define @t37 () (tptp.lseg tptp.nil tptp.nil)) % 0.45/0.64 (define @t38 () (tptp.sep @t37 @t26)) % 0.45/0.64 (define @t39 () (tptp.sep @t27 @t38)) % 0.45/0.64 (define @t40 () (tptp.heap @t39)) % 0.45/0.64 (define @t41 () (not @t40)) % 0.45/0.64 (define @t42 () (or @t41 (= tptp.x2 tptp.nil) @t36)) % 0.45/0.64 (define @t43 () (or @t41 @t24 @t36)) % 0.45/0.64 (define @t44 () (tptp.sep @t37 tptp.emp)) % 0.45/0.64 (define @t45 () (tptp.sep @t37 @t44)) % 0.45/0.64 (assume @p1 @t4) % 0.45/0.64 (assume @p2 @t7) % 0.45/0.64 (assume @p3 (forall @t9 (not (tptp.heap (tptp.sep (tptp.next tptp.nil @t8) @t1))))) % 0.45/0.64 (assume @p4 (forall @t9 (or (not (tptp.heap (tptp.sep (tptp.lseg tptp.nil @t8) @t1))) (= @t8 tptp.nil)))) % 0.45/0.64 (assume @p5 (forall @t12 (not (tptp.heap (tptp.sep @t11 (tptp.sep (tptp.next @t5 @t10) @t1)))))) % 0.45/0.64 (assume @p6 (forall @t12 (or (not (tptp.heap (tptp.sep @t11 @t15))) @t13))) % 0.45/0.64 (assume @p7 (forall @t12 (or (not (tptp.heap (tptp.sep @t17 @t15))) @t16 @t13))) % 0.45/0.64 (assume @p8 @t19) % 0.45/0.64 (assume @p9 (forall (@list @t5 @t8 @t1) (or (not (tptp.heap (tptp.sep @t17 (tptp.sep (tptp.lseg @t8 tptp.nil) @t1)))) (tptp.heap (tptp.sep (tptp.lseg @t5 tptp.nil) @t1))))) % 0.45/0.64 (assume @p10 (forall @t22 (or (not (tptp.heap (tptp.sep @t17 (tptp.sep @t18 @t21)))) (tptp.heap (tptp.sep @t14 @t21))))) % 0.45/0.64 (assume @p11 (forall @t22 (or (not (tptp.heap (tptp.sep @t17 (tptp.sep @t18 @t23)))) (= @t10 @t20) (tptp.heap (tptp.sep @t14 @t23))))) % 0.45/0.64 (assume @p12 (not (= tptp.nil tptp.x1))) % 0.45/0.64 (assume @p13 (not @t24)) % 0.45/0.64 (assume @p14 (tptp.heap (tptp.sep @t27 @t26))) % 0.45/0.64 (assume @p15 (not @t28)) % 0.45/0.64 (step @p16 :rule evaluate :args ((= true false))) % 0.45/0.64 (step @p17 :rule instantiate :premises (@p9) :args ((@list tptp.x1 tptp.x2 tptp.emp))) % 0.45/0.64 (step @p18 :rule cnf_or_pos :args (@t32)) % 0.45/0.64 (step @p19 :rule reordering :premises (@p18) :args ((or @t28 @t31 (not @t32)))) % 0.45/0.64 (step @p20 :rule chain_m_resolution :premises (@p19 @p15 @p17) :args (@t31 (@list true false) (@list @t28 @t32))) % 0.45/0.64 (step @p21 :rule false_intro :premises (@p20)) % 0.45/0.64 (step @p22 :rule eq-symm :args (@t30 @t33)) % 0.45/0.64 (step @p23 :rule refl :args (@t4)) % 0.45/0.64 (step @p24 :rule cong :premises (@p23 @p22) :args ((=> @t4 @t34))) % 0.45/0.64 (assume-push @p74 @t4) % 0.45/0.64 (step @p26 :rule instantiate :premises (@p1) :args ((@list @t25 @t29 tptp.emp))) % 0.45/0.64 (step-pop @p75 :rule scope :premises (@p26)) % 0.45/0.64 (step @p27 :rule process_scope :premises (@p75) :args (@t34)) % 0.45/0.64 (step @p29 :rule eq_resolve :premises (@p27 @p24)) % 0.45/0.64 (step @p30 :rule implies_elim :premises (@p29)) % 0.45/0.64 (step @p31 :rule chain_m_resolution :premises (@p30 @p1) :args ((= @t33 @t30) @t35 (@list @t4))) % 0.45/0.64 (step @p32 :rule cong :premises (@p31) :args (@t36)) % 0.45/0.64 (step @p33 :rule refl :args (@t36)) % 0.45/0.64 (step @p34 :rule eq-symm :args (tptp.x2 tptp.nil)) % 0.45/0.64 (step @p35 :rule refl :args (@t41)) % 0.45/0.64 (step @p36 :rule nary_cong :premises (@p35 @p34 @p33) :args (@t42)) % 0.45/0.64 (step @p37 :rule refl :args (@t19)) % 0.45/0.64 (step @p38 :rule cong :premises (@p37 @p36) :args ((=> @t19 @t42))) % 0.45/0.64 (assume-push @p76 @t19) % 0.45/0.64 (step @p40 :rule instantiate :premises (@p8) :args ((@list tptp.x2 tptp.nil tptp.nil @t26))) % 0.45/0.64 (step-pop @p77 :rule scope :premises (@p40)) % 0.45/0.64 (step @p41 :rule process_scope :premises (@p77) :args (@t42)) % 0.45/0.64 (step @p43 :rule eq_resolve :premises (@p41 @p38)) % 0.45/0.64 (step @p44 :rule implies_elim :premises (@p43)) % 0.45/0.64 (step @p45 :rule chain_m_resolution :premises (@p44 @p8) :args (@t43 @t35 (@list @t19))) % 0.45/0.64 (step @p46 :rule true_intro :premises (@p14)) % 0.45/0.64 (step @p47 :rule eq-symm :args (@t6 @t1)) % 0.45/0.64 (step @p48 :rule cong :premises (@p47) :args (@t7)) % 0.45/0.64 (step @p49 :rule eq_resolve :premises (@p2 @p48)) % 0.45/0.64 (step @p50 :rule instantiate :premises (@p49) :args ((@list tptp.nil tptp.emp))) % 0.45/0.64 (step @p51 :rule symm :premises (@p50)) % 0.45/0.64 (step @p52 :rule refl :args (@t37)) % 0.45/0.64 (step @p53 :rule cong :premises (@p52 @p51) :args (@t45)) % 0.45/0.64 (step @p54 :rule trans :premises (@p53 @p51)) % 0.45/0.64 (step @p55 :rule refl :args (@t25)) % 0.45/0.64 (step @p56 :rule cong :premises (@p55 @p54) :args ((tptp.sep @t25 @t45))) % 0.45/0.64 (step @p57 :rule instantiate :premises (@p1) :args ((@list @t25 @t37 @t44))) % 0.45/0.64 (step @p58 :rule symm :premises (@p57)) % 0.45/0.64 (step @p59 :rule cong :premises (@p55 @p50) :args (@t26)) % 0.45/0.64 (step @p60 :rule cong :premises (@p52 @p59) :args (@t38)) % 0.45/0.64 (step @p61 :rule trans :premises (@p60 @p58 @p56)) % 0.45/0.64 (step @p62 :rule refl :args (@t27)) % 0.45/0.64 (step @p63 :rule cong :premises (@p62 @p61) :args (@t39)) % 0.45/0.64 (step @p64 :rule cong :premises (@p63) :args (@t40)) % 0.45/0.64 (step @p65 :rule trans :premises (@p64 @p46)) % 0.45/0.64 (step @p66 :rule true_elim :premises (@p65)) % 0.45/0.64 (step @p67 :rule cnf_or_pos :args (@t43)) % 0.45/0.64 (step @p68 :rule reordering :premises (@p67) :args ((or @t24 @t41 @t36 (not @t43)))) % 0.45/0.64 (step @p69 :rule chain_m_resolution :premises (@p68 @p13 @p66 @p45) :args (@t36 (@list true false false) (@list @t24 @t40 @t43))) % 0.45/0.64 (step @p70 :rule true_intro :premises (@p69)) % 0.45/0.64 (step @p71 :rule symm :premises (@p70)) % 0.45/0.64 (step @p72 :rule trans :premises (@p71 @p32 @p21)) % 0.45/0.64 (step @p73 false :rule eq_resolve :premises (@p72 @p16)) % 0.45/0.64 ) % 0.45/0.64 % SZS output end Proof % 0.45/0.64 % cvc5 exiting %------------------------------------------------------------------------------