%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN986+1.000 : TPTP v9.2.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n010.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:12 AM UTC 2026 % Result : Theorem 0.37s 0.57s % Output : Proof 0.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SYN986+1.000 : TPTP v9.2.1. Released v4.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 : n010.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:50:25 EDT 2026 % 0.17/0.35 % CPUTime : % 0.26/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.37/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.37/0.57 % SZS status Theorem % 0.37/0.57 % SZS output start Proof % 0.37/0.57 ( % 0.37/0.57 (declare-sort $$unsorted 0) % 0.37/0.57 (declare-const tptp.r (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.37/0.57 (declare-const tptp.zero $$unsorted) % 0.37/0.57 (declare-const tptp.succ (-> $$unsorted $$unsorted)) % 0.37/0.57 (define @t1 () (@var "Y" $$unsorted)) % 0.37/0.57 (define @t2 () (@var "Z1" $$unsorted)) % 0.37/0.57 (define @t3 () (@var "X" $$unsorted)) % 0.37/0.57 (define @t4 () (@var "Z" $$unsorted)) % 0.37/0.57 (define @t5 () (@var "Z0" $$unsorted)) % 0.37/0.57 (define @t6 () (tptp.r tptp.zero tptp.zero @t5)) % 0.37/0.57 (define @t7 () (@list @t5)) % 0.37/0.57 (define @t8 () (exists @t7 @t6)) % 0.37/0.57 (define @t9 () (not @t8)) % 0.37/0.57 (define @t10 () (forall @t7 (not @t6))) % 0.37/0.57 (define @t11 () (tptp.succ tptp.zero)) % 0.37/0.57 (define @t12 () (tptp.r tptp.zero tptp.zero @t11)) % 0.37/0.57 (assume @p1 (forall (@list @t1) (tptp.r @t1 tptp.zero (tptp.succ @t1)))) % 0.37/0.57 (assume @p2 (forall (@list @t1 @t3 @t4 @t2) (=> (tptp.r @t1 @t3 @t4) (=> (tptp.r @t4 @t3 @t2) (tptp.r @t1 (tptp.succ @t3) @t2))))) % 0.37/0.57 (assume @p3 @t9) % 0.37/0.57 (assume @p4 true) % 0.37/0.57 (step @p5 :rule bool-double-not-elim :args (@t10)) % 0.37/0.57 (step @p6 :rule exists-elim :args ((= @t8 (not @t10)))) % 0.37/0.57 (step @p7 :rule cong :premises (@p6) :args (@t9)) % 0.37/0.57 (step @p8 :rule trans :premises (@p7 @p5)) % 0.37/0.57 (step @p9 :rule eq_resolve :premises (@p3 @p8)) % 0.37/0.57 (step @p10 :rule instantiate :premises (@p1) :args ((@list tptp.zero))) % 0.37/0.57 (assume-push @p17 @t10) % 0.37/0.57 (step @p12 :rule instantiate :premises (@p9) :args ((@list @t11))) % 0.37/0.57 (step-pop @p18 :rule scope :premises (@p12)) % 0.37/0.57 (step @p13 :rule process_scope :premises (@p18) :args ((not @t12))) % 0.37/0.57 (step @p15 :rule implies_elim :premises (@p13)) % 0.37/0.57 (step @p16 false :rule chain_m_resolution :premises (@p15 @p10 @p9) :args (false (@list false false) (@list @t12 @t10))) % 0.37/0.57 ) % 0.37/0.57 % SZS output end Proof % 0.37/0.57 % cvc5 exiting %------------------------------------------------------------------------------