%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SWX186+1 : TPTP v9.3.0. Released v9.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:07:18 AM UTC 2026 % Result : Theorem 0.36s 0.56s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX186+1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n006.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue Jun 2 23:04:19 EDT 2026 % 0.17/0.34 % CPUTime : % 0.27/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.36/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.36/0.56 % SZS status Theorem % 0.36/0.56 % SZS output start Proof % 0.36/0.56 ( % 0.36/0.56 (declare-sort $$unsorted 0) % 0.36/0.56 (declare-const tptp.drop (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.z $$unsorted) % 0.36/0.56 (declare-const tptp.proj1S (-> $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.nil $$unsorted) % 0.36/0.56 (declare-const tptp.tail (-> $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.head (-> $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.s (-> $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.cons (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.56 (define @t1 () (@var "X" $$unsorted)) % 0.36/0.56 (define @t2 () (@var "X2" $$unsorted)) % 0.36/0.56 (define @t3 () (tptp.cons @t1 @t2)) % 0.36/0.56 (define @t4 () (@list @t1 @t2)) % 0.36/0.56 (define @t5 () (not (= tptp.nil @t3))) % 0.36/0.56 (define @t6 () (forall @t4 @t5)) % 0.36/0.56 (define @t7 () (tptp.s @t1)) % 0.36/0.56 (define @t8 () (@list @t1)) % 0.36/0.56 (define @t9 () (@var "Z" $$unsorted)) % 0.36/0.56 (define @t10 () (tptp.s @t9)) % 0.36/0.56 (define @t11 () (tptp.drop @t10 tptp.nil)) % 0.36/0.56 (define @t12 () (forall (@list @t9) (= @t11 tptp.nil))) % 0.36/0.56 (define @t13 () (@var "X3" $$unsorted)) % 0.36/0.56 (define @t14 () (@var "Y" $$unsorted)) % 0.36/0.56 (define @t15 () (tptp.drop tptp.z @t14)) % 0.36/0.56 (define @t16 () (forall (@list @t14) (= @t15 @t14))) % 0.36/0.56 (define @t17 () (@var "Ys" $$unsorted)) % 0.36/0.56 (define @t18 () (@var "Xs" $$unsorted)) % 0.36/0.56 (define @t19 () (= @t18 @t17)) % 0.36/0.56 (define @t20 () (@var "N" $$unsorted)) % 0.36/0.56 (define @t21 () (= (tptp.drop @t20 @t18) (tptp.drop @t20 @t17))) % 0.36/0.56 (define @t22 () (=> @t21 @t19)) % 0.36/0.56 (define @t23 () (not @t22)) % 0.36/0.56 (define @t24 () (@list @t20 @t18 @t17)) % 0.36/0.56 (define @t25 () (exists @t24 @t23)) % 0.36/0.56 (define @t26 () (not @t25)) % 0.36/0.56 (define @t27 () (forall @t24 (or (not @t21) @t19))) % 0.36/0.56 (define @t28 () (forall @t24 (not @t23))) % 0.36/0.56 (define @t29 () (not @t28)) % 0.36/0.56 (define @t30 () (@const 0 $$unsorted)) % 0.36/0.56 (define @t31 () (tptp.cons @t30 tptp.nil)) % 0.36/0.56 (define @t32 () (not (= @t31 tptp.nil))) % 0.36/0.56 (define @t33 () (forall @t4 (not (= @t3 tptp.nil)))) % 0.36/0.56 (define @t34 () (= tptp.nil @t31)) % 0.36/0.56 (define @t35 () (tptp.s tptp.z)) % 0.36/0.56 (define @t36 () (= (tptp.drop @t35 tptp.nil) (tptp.drop @t35 @t31))) % 0.36/0.56 (define @t37 () (not @t36)) % 0.36/0.56 (define @t38 () (or @t37 @t34)) % 0.36/0.56 (define @t39 () (not @t38)) % 0.36/0.56 (define @t40 () (@list true false)) % 0.36/0.56 (assume @p1 (forall @t4 (= (tptp.head @t3) @t1))) % 0.36/0.56 (assume @p2 (forall @t4 (= (tptp.tail @t3) @t2))) % 0.36/0.56 (assume @p3 @t6) % 0.36/0.56 (assume @p4 (forall @t8 (= (tptp.proj1S @t7) @t1))) % 0.36/0.56 (assume @p5 (forall @t8 (not (= @t7 tptp.z)))) % 0.36/0.56 (assume @p6 @t12) % 0.36/0.56 (assume @p7 (forall (@list @t9 @t2 @t13) (= (tptp.drop @t10 (tptp.cons @t2 @t13)) (tptp.drop @t9 @t13)))) % 0.36/0.56 (assume @p8 @t16) % 0.36/0.56 (assume @p9 @t26) % 0.36/0.56 (assume @p10 true) % 0.36/0.56 (step @p11 :rule bool-double-not-elim :args (@t27)) % 0.36/0.56 (step @p12 :rule bool-impl-elim :args (@t21 @t19)) % 0.36/0.56 (step @p13 :rule cong :premises (@p12) :args ((forall @t24 @t22))) % 0.36/0.56 (step @p14 :rule bool-double-not-elim :args (@t22)) % 0.36/0.56 (step @p15 :rule cong :premises (@p14) :args (@t28)) % 0.36/0.56 (step @p16 :rule trans :premises (@p15 @p13)) % 0.36/0.56 (step @p17 :rule cong :premises (@p16) :args (@t29)) % 0.36/0.56 (step @p18 :rule exists-elim :args ((= @t25 @t29))) % 0.36/0.56 (step @p19 :rule trans :premises (@p18 @p17)) % 0.36/0.56 (step @p20 :rule cong :premises (@p19) :args (@t26)) % 0.36/0.56 (step @p21 :rule trans :premises (@p20 @p11)) % 0.36/0.56 (step @p22 :rule eq_resolve :premises (@p9 @p21)) % 0.36/0.56 (step @p23 :rule instantiate :premises (@p7) :args ((@list tptp.z @t30 tptp.nil))) % 0.36/0.56 (step @p24 :rule symm :premises (@p23)) % 0.36/0.56 (step @p25 :rule eq-symm :args (@t15 @t14)) % 0.36/0.56 (step @p26 :rule cong :premises (@p25) :args (@t16)) % 0.36/0.56 (step @p27 :rule eq_resolve :premises (@p8 @p26)) % 0.36/0.56 (step @p28 :rule instantiate :premises (@p27) :args ((@list tptp.nil))) % 0.36/0.56 (step @p29 :rule eq-symm :args (@t11 tptp.nil)) % 0.36/0.56 (step @p30 :rule cong :premises (@p29) :args (@t12)) % 0.36/0.56 (step @p31 :rule eq_resolve :premises (@p6 @p30)) % 0.36/0.56 (step @p32 :rule instantiate :premises (@p31) :args ((@list tptp.z))) % 0.36/0.56 (step @p33 :rule symm :premises (@p32)) % 0.36/0.56 (step @p34 :rule trans :premises (@p33 @p28 @p24)) % 0.36/0.56 (step @p35 :rule eq-symm :args (tptp.nil @t3)) % 0.36/0.56 (step @p36 :rule cong :premises (@p35) :args (@t5)) % 0.36/0.56 (step @p37 :rule cong :premises (@p36) :args (@t6)) % 0.36/0.56 (step @p38 :rule eq_resolve :premises (@p3 @p37)) % 0.36/0.56 (step @p39 :rule eq-symm :args (@t31 tptp.nil)) % 0.36/0.56 (step @p40 :rule cong :premises (@p39) :args (@t32)) % 0.36/0.56 (step @p41 :rule refl :args (@t33)) % 0.36/0.56 (step @p42 :rule cong :premises (@p41 @p40) :args ((=> @t33 @t32))) % 0.36/0.56 (assume-push @p59 @t33) % 0.36/0.56 (step @p44 :rule instantiate :premises (@p38) :args ((@list @t30 tptp.nil))) % 0.36/0.56 (step-pop @p60 :rule scope :premises (@p44)) % 0.36/0.56 (step @p45 :rule process_scope :premises (@p60) :args (@t32)) % 0.36/0.56 (step @p47 :rule eq_resolve :premises (@p45 @p42)) % 0.36/0.56 (step @p48 :rule implies_elim :premises (@p47)) % 0.36/0.56 (step @p49 :rule chain_m_resolution :premises (@p48 @p38) :args ((not @t34) (@list false) (@list @t33))) % 0.36/0.56 (step @p50 :rule cnf_or_pos :args (@t38)) % 0.36/0.56 (step @p51 :rule reordering :premises (@p50) :args ((or @t34 @t37 @t39))) % 0.36/0.56 (step @p52 :rule chain_m_resolution :premises (@p51 @p49 @p34) :args (@t39 @t40 (@list @t34 @t36))) % 0.36/0.56 (assume-push @p61 @t27) % 0.36/0.56 (step @p54 :rule instantiate :premises (@p22) :args ((@list @t35 tptp.nil @t31))) % 0.36/0.56 (step-pop @p62 :rule scope :premises (@p54)) % 0.36/0.56 (step @p55 :rule process_scope :premises (@p62) :args (@t38)) % 0.36/0.56 (step @p57 :rule implies_elim :premises (@p55)) % 0.36/0.56 (step @p58 false :rule chain_m_resolution :premises (@p57 @p52 @p22) :args (false @t40 (@list @t38 @t27))) % 0.36/0.56 ) % 0.36/0.56 % SZS output end Proof % 0.36/0.56 % cvc5 exiting %------------------------------------------------------------------------------