%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN956+1 : TPTP v9.2.1. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n024.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:10:08 AM UTC 2026 % Result : Theorem 0.14s 0.35s % Output : Proof 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.06 % Problem : SYN956+1 : TPTP v9.2.1. Released v3.1.0. % 0.00/0.07 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.07/0.25 % Computer : n024.cluster.edu % 0.07/0.25 % Model : x86_64 x86_64 % 0.07/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.25 % Memory : 8042.1875MB % 0.07/0.25 % OS : Linux 3.10.0-693.el7.x86_64 % 0.07/0.25 % CPULimit : 300 % 0.07/0.25 % WCLimit : 300 % 0.07/0.25 % DateTime : Tue Jun 2 18:50:00 EDT 2026 % 0.07/0.25 % CPUTime : % 0.07/0.32 %----Proving TF0_NAR, FOF, or CNF % 0.14/0.35 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.14/0.35 % SZS status Theorem % 0.14/0.35 % SZS output start Proof % 0.14/0.35 ( % 0.14/0.35 (declare-sort $$unsorted 0) % 0.14/0.35 (declare-const tptp.a (-> $$unsorted Bool)) % 0.14/0.35 (declare-const tptp.b (-> $$unsorted Bool)) % 0.14/0.35 (define @t1 () (@var "X" $$unsorted)) % 0.14/0.35 (define @t2 () (tptp.b @t1)) % 0.14/0.35 (define @t3 () (@list @t1)) % 0.14/0.35 (define @t4 () (exists @t3 @t2)) % 0.14/0.35 (define @t5 () (tptp.a @t1)) % 0.14/0.35 (define @t6 () (forall @t3 @t5)) % 0.14/0.35 (define @t7 () (=> @t6 @t4)) % 0.14/0.35 (define @t8 () (=> @t5 @t2)) % 0.14/0.35 (define @t9 () (exists @t3 @t8)) % 0.14/0.35 (define @t10 () (=> @t9 @t7)) % 0.14/0.35 (define @t11 () (not @t10)) % 0.14/0.35 (define @t12 () (not @t2)) % 0.14/0.35 (define @t13 () (forall @t3 @t12)) % 0.14/0.35 (define @t14 () (not @t13)) % 0.14/0.35 (define @t15 () (@list @t1)) % 0.14/0.35 (define @t16 () (@var "BOUND_VARIABLE_7432" $$unsorted)) % 0.14/0.35 (define @t17 () (@list @t16)) % 0.14/0.35 (define @t18 () (@var "BOUND_VARIABLE_7427" $$unsorted)) % 0.14/0.35 (define @t19 () (@list @t18)) % 0.14/0.35 (define @t20 () (and @t6 @t13)) % 0.14/0.35 (define @t21 () (forall @t3 (not @t8))) % 0.14/0.35 (define @t22 () (not @t21)) % 0.14/0.35 (define @t23 () (forall (@list @t18) (tptp.a @t18))) % 0.14/0.35 (define @t24 () (@list false)) % 0.14/0.35 (define @t25 () (forall (@list @t16) (not (tptp.b @t16)))) % 0.14/0.35 (define @t26 () (@list true)) % 0.14/0.35 (assume @p1 @t11) % 0.14/0.35 (assume @p2 true) % 0.14/0.35 (step @p3 :rule exists-elim :args ((= @t4 @t14))) % 0.14/0.35 (step @p4 :rule refl :args (@t6)) % 0.14/0.35 (step @p5 :rule cong :premises (@p4 @p3) :args (@t7)) % 0.14/0.35 (step @p6 :rule alpha_equiv :args (@t13 @t15 @t17)) % 0.14/0.35 (step @p7 :rule alpha_equiv :args (@t6 @t15 @t19)) % 0.14/0.35 (step @p8 :rule nary_cong :premises (@p7 @p6) :args (@t20)) % 0.14/0.35 (step @p9 :rule quant-miniscope-and :args ((= (forall @t3 (and @t5 @t12)) @t20))) % 0.14/0.35 (step @p10 :rule trans :premises (@p9 @p8)) % 0.14/0.35 (step @p11 :rule bool-implies-de-morgan :args (@t5 @t2)) % 0.14/0.35 (step @p12 :rule cong :premises (@p11) :args (@t21)) % 0.14/0.35 (step @p13 :rule trans :premises (@p12 @p10)) % 0.14/0.35 (step @p14 :rule cong :premises (@p13) :args (@t22)) % 0.14/0.35 (step @p15 :rule exists-elim :args ((= @t9 @t22))) % 0.14/0.35 (step @p16 :rule trans :premises (@p15 @p14)) % 0.14/0.35 (step @p17 :rule cong :premises (@p16 @p5) :args (@t10)) % 0.14/0.35 (step @p18 :rule cong :premises (@p17) :args (@t11)) % 0.14/0.35 (step @p19 :rule eq_resolve :premises (@p1 @p18)) % 0.14/0.35 (step @p20 :rule not_implies_elim2 :premises (@p19)) % 0.14/0.35 (step @p21 :rule not_implies_elim1 :premises (@p20)) % 0.14/0.35 (step @p22 :rule alpha_equiv :args (@t23 @t19 @t15)) % 0.14/0.35 (step @p23 :rule symm :premises (@p22)) % 0.14/0.35 (step @p24 :rule equiv_elim1 :premises (@p23)) % 0.14/0.35 (step @p25 :rule reordering :premises (@p24) :args ((or @t23 (not @t6)))) % 0.14/0.35 (step @p26 :rule chain_m_resolution :premises (@p25 @p21) :args (@t23 @t24 (@list @t6))) % 0.14/0.35 (step @p27 :rule not_implies_elim1 :premises (@p19)) % 0.14/0.35 (step @p28 :rule not_and :premises (@p27)) % 0.14/0.35 (step @p29 :rule chain_m_resolution :premises (@p28 @p26) :args ((not @t25) @t24 (@list @t23))) % 0.14/0.35 (step @p30 :rule alpha_equiv :args (@t25 @t17 @t15)) % 0.14/0.35 (step @p31 :rule equiv_elim2 :premises (@p30)) % 0.14/0.35 (step @p32 :rule chain_m_resolution :premises (@p31 @p29) :args (@t14 @t26 (@list @t25))) % 0.14/0.35 (step @p33 :rule not_implies_elim2 :premises (@p20)) % 0.14/0.35 (step @p34 :rule not_not_elim :premises (@p33)) % 0.14/0.35 (step @p35 false :rule chain_m_resolution :premises (@p34 @p32) :args (false @t26 (@list @t13))) % 0.14/0.35 ) % 0.14/0.35 % SZS output end Proof % 0.14/0.35 % cvc5 exiting %------------------------------------------------------------------------------