%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN000_1 : TPTP v9.2.1. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n007.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:44 AM UTC 2026 % Result : Theorem 0.38s 0.56s % Output : Proof 0.38s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN000_1 : TPTP v9.2.1. Released v5.0.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n007.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 23:14:56 EDT 2026 % 0.16/0.34 % CPUTime : % 0.26/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.38/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.38/0.56 % SZS status Theorem % 0.38/0.56 % SZS output start Proof % 0.38/0.56 ( % 0.38/0.56 (declare-sort tptp.new 0) % 0.38/0.56 (declare-sort $$unsorted 0) % 0.38/0.56 (declare-const tptp.h $$unsorted) % 0.38/0.56 (declare-const tptp.newp (-> tptp.new $$unsorted Bool)) % 0.38/0.56 (declare-const tptp.newf (-> tptp.new $$unsorted tptp.new)) % 0.38/0.56 (declare-const tptp.newc tptp.new) % 0.38/0.56 (declare-const |tptp.'A proposition'| Bool) % 0.38/0.56 (declare-const tptp.ia1 Bool) % 0.38/0.56 (declare-const |tptp.'A predicate'| (-> $$unsorted Bool)) % 0.38/0.56 (declare-const tptp.ia2 Bool) % 0.38/0.56 (declare-const |tptp.'A constant'| $$unsorted) % 0.38/0.56 (declare-const tptp.ia3 Bool) % 0.38/0.56 (declare-const |tptp.'A function'| (-> $$unsorted $$unsorted)) % 0.38/0.56 (declare-const tptp.s (-> $$unsorted Bool)) % 0.38/0.56 (declare-const tptp.a $$unsorted) % 0.38/0.56 (declare-const tptp.r0 Bool) % 0.38/0.56 (declare-const tptp.r (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.38/0.56 (declare-const tptp.q0 Bool) % 0.38/0.56 (declare-const |tptp.'A _'quoted __ escape_''| $$unsorted) % 0.38/0.56 (declare-const tptp.p0 Bool) % 0.38/0.56 (declare-const tptp.q (-> $$unsorted $$unsorted Bool)) % 0.38/0.56 (declare-const tptp.s0 Bool) % 0.38/0.56 (declare-const tptp.b $$unsorted) % 0.38/0.56 (declare-const tptp.f (-> $$unsorted $$unsorted)) % 0.38/0.56 (declare-const tptp.g (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.38/0.56 (declare-const tptp.p (-> $$unsorted Bool)) % 0.38/0.56 (define @t1 () (tptp.f (tptp.f (tptp.f tptp.b)))) % 0.38/0.56 (define @t2 () (not (tptp.s @t1))) % 0.38/0.56 (define @t3 () (@var "Z" $$unsorted)) % 0.38/0.56 (define @t4 () (@var "Y" $$unsorted)) % 0.38/0.56 (define @t5 () (tptp.f @t4)) % 0.38/0.56 (define @t6 () (@var "X" $$unsorted)) % 0.38/0.56 (define @t7 () (tptp.g @t6 @t5 @t3)) % 0.38/0.56 (define @t8 () (tptp.r @t6 @t5 @t7)) % 0.38/0.56 (define @t9 () (@list @t4 @t3)) % 0.38/0.56 (define @t10 () (not (tptp.q @t6 tptp.a))) % 0.38/0.56 (define @t11 () (tptp.p @t6)) % 0.38/0.56 (define @t12 () (@list @t6)) % 0.38/0.56 (define @t13 () (tptp.p tptp.h)) % 0.38/0.56 (define @t14 () (exists @t12 @t11)) % 0.38/0.56 (define @t15 () (not @t14)) % 0.38/0.56 (define @t16 () (forall @t12 (not @t11))) % 0.38/0.56 (assume @p1 (=> (and tptp.p0 (not tptp.q0)) (or tptp.r0 (not tptp.s0)))) % 0.38/0.56 (assume @p2 (forall @t12 (=> (or @t11 @t10) (exists @t9 (and @t8 @t2))))) % 0.38/0.56 (assume @p3 (exists (@list @t4) (forall (@list @t6 @t3) (or (= @t5 @t7) (not (= @t1 tptp.a)) (= @t6 @t5))))) % 0.38/0.56 (assume @p4 (or true false)) % 0.38/0.56 (assume @p5 (or |tptp.'A proposition'| (|tptp.'A predicate'| tptp.a) (tptp.p |tptp.'A constant'|) (tptp.p (|tptp.'A function'| tptp.a)) (tptp.p |tptp.'A _'quoted __ escape_''|))) % 0.38/0.56 (assume @p6 (forall @t12 (= (=> @t10 @t11) (exists @t9 (xor @t8 @t2))))) % 0.38/0.56 (assume @p7 (forall (@list (@var "X" tptp.new)) (tptp.newp (tptp.newf tptp.newc tptp.a) tptp.a))) % 0.38/0.56 (assume @p8 @t13) % 0.38/0.56 (assume @p9 @t15) % 0.38/0.56 (assume @p10 tptp.ia1) % 0.38/0.56 (assume @p11 tptp.ia2) % 0.38/0.56 (assume @p12 tptp.ia3) % 0.38/0.56 (assume @p13 true) % 0.38/0.56 (step @p14 :rule bool-double-not-elim :args (@t16)) % 0.38/0.56 (step @p15 :rule exists-elim :args ((= @t14 (not @t16)))) % 0.38/0.56 (step @p16 :rule cong :premises (@p15) :args (@t15)) % 0.38/0.56 (step @p17 :rule trans :premises (@p16 @p14)) % 0.38/0.56 (step @p18 :rule eq_resolve :premises (@p9 @p17)) % 0.38/0.56 (assume-push @p25 @t16) % 0.38/0.56 (step @p20 :rule instantiate :premises (@p18) :args ((@list tptp.h))) % 0.38/0.56 (step-pop @p26 :rule scope :premises (@p20)) % 0.38/0.56 (step @p21 :rule process_scope :premises (@p26) :args ((not @t13))) % 0.38/0.56 (step @p23 :rule implies_elim :premises (@p21)) % 0.38/0.56 (step @p24 false :rule chain_m_resolution :premises (@p23 @p18 @p8) :args (false (@list false false) (@list @t16 @t13))) % 0.38/0.56 ) % 0.38/0.56 % SZS output end Proof % 0.38/0.56 % cvc5 exiting %------------------------------------------------------------------------------