%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN396+1 : TPTP v9.2.1. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n002.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:08:47 AM UTC 2026 % Result : Theorem 0.32s 0.56s % Output : Proof 0.32s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SYN396+1 : TPTP v9.2.1. Released v2.0.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.35 % Computer : n002.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Tue Jun 2 23:26:33 EDT 2026 % 0.17/0.35 % CPUTime : % 0.32/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.32/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.32/0.56 % SZS status Theorem % 0.32/0.56 % SZS output start Proof % 0.32/0.56 ( % 0.32/0.56 (declare-sort $$unsorted 0) % 0.32/0.56 (declare-const tptp.f (-> $$unsorted Bool)) % 0.32/0.56 (define @t1 () (@var "Y" $$unsorted)) % 0.32/0.56 (define @t2 () (tptp.f @t1)) % 0.32/0.56 (define @t3 () (not @t2)) % 0.32/0.56 (define @t4 () (@list @t1)) % 0.32/0.56 (define @t5 () (exists @t4 @t3)) % 0.32/0.56 (define @t6 () (@var "X" $$unsorted)) % 0.32/0.56 (define @t7 () (forall (@list @t6) (tptp.f @t6))) % 0.32/0.56 (define @t8 () (not @t7)) % 0.32/0.56 (define @t9 () (= @t8 @t5)) % 0.32/0.56 (define @t10 () (not @t9)) % 0.32/0.56 (define @t11 () (forall @t4 @t2)) % 0.32/0.56 (define @t12 () (forall @t4 (not @t3))) % 0.32/0.56 (define @t13 () (not @t12)) % 0.32/0.56 (assume @p1 @t10) % 0.32/0.56 (assume @p2 true) % 0.32/0.56 (step @p3 :rule alpha_equiv :args (@t7 (@list @t6) (@list @t1))) % 0.32/0.56 (step @p4 :rule equiv_elim2 :premises (@p3)) % 0.32/0.56 (step @p5 :rule bool-double-not-elim :args (@t11)) % 0.32/0.56 (step @p6 :rule bool-double-not-elim :args (@t7)) % 0.32/0.56 (step @p7 :rule nary_cong :premises (@p6 @p5) :args ((or (not @t8) (not (not @t11))))) % 0.32/0.56 (step @p8 :rule bool-double-not-elim :args (@t2)) % 0.32/0.56 (step @p9 :rule cong :premises (@p8) :args (@t12)) % 0.32/0.56 (step @p10 :rule cong :premises (@p9) :args (@t13)) % 0.32/0.56 (step @p11 :rule exists-elim :args ((= @t5 @t13))) % 0.32/0.56 (step @p12 :rule trans :premises (@p11 @p10)) % 0.32/0.56 (step @p13 :rule refl :args (@t8)) % 0.32/0.56 (step @p14 :rule cong :premises (@p13 @p12) :args (@t9)) % 0.32/0.56 (step @p15 :rule cong :premises (@p14) :args (@t10)) % 0.32/0.56 (step @p16 :rule eq_resolve :premises (@p1 @p15)) % 0.32/0.56 (step @p17 :rule not_equiv_elim2 :premises (@p16)) % 0.32/0.56 (step @p18 :rule eq_resolve :premises (@p17 @p7)) % 0.32/0.56 (step @p19 :rule chain_m_resolution :premises (@p18 @p4) :args (@t7 (@list true) (@list @t11))) % 0.32/0.56 (step @p20 :rule equiv_elim1 :premises (@p3)) % 0.32/0.56 (step @p21 :rule chain_m_resolution :premises (@p20 @p19) :args (@t11 (@list false) (@list @t7))) % 0.32/0.56 (step @p22 :rule not_equiv_elim1 :premises (@p16)) % 0.32/0.56 (step @p23 false :rule chain_m_resolution :premises (@p22 @p21 @p19) :args (false (@list false false) (@list @t11 @t7))) % 0.32/0.56 ) % 0.32/0.56 % SZS output end Proof % 0.32/0.56 % cvc5 exiting %------------------------------------------------------------------------------