%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN000^1 : TPTP v9.2.1. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n028.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.30s 0.55s % Output : Proof 0.30s % 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 v3.7.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 : n028.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:15:50 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.49 %----Proving TH0 % 0.30/0.55 --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 90s... % 0.30/0.55 % SZS status Theorem % 0.30/0.55 % SZS output start Proof % 0.30/0.55 ( % 0.30/0.55 (declare-sort tptp.new 0) % 0.30/0.55 (declare-sort $$unsorted 0) % 0.30/0.55 (declare-const tptp.ia3 Bool) % 0.30/0.55 (declare-const tptp.ia2 Bool) % 0.30/0.55 (declare-const tptp.ia1 Bool) % 0.30/0.55 (declare-const tptp.newp (-> tptp.new $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.l2 (-> (-> $$unsorted (-> $$unsorted $$unsorted) $$unsorted) Bool)) % 0.30/0.55 (declare-const |tptp.'A proposition'| Bool) % 0.30/0.55 (declare-const |tptp.'A predicate'| (-> $$unsorted Bool)) % 0.30/0.55 (declare-const |tptp.'A constant'| $$unsorted) % 0.30/0.55 (declare-const |tptp.'A function'| (-> $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.h $$unsorted) % 0.30/0.55 (declare-const tptp.s0 Bool) % 0.30/0.55 (declare-const tptp.newf (-> tptp.new $$unsorted tptp.new)) % 0.30/0.55 (declare-const tptp.b $$unsorted) % 0.30/0.55 (declare-const tptp.r0 Bool) % 0.30/0.55 (declare-const tptp.s (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.a $$unsorted) % 0.30/0.55 (declare-const tptp.q0 Bool) % 0.30/0.55 (declare-const tptp.r (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.newc tptp.new) % 0.30/0.55 (declare-const tptp.p0 Bool) % 0.30/0.55 (declare-const tptp.f (-> $$unsorted $$unsorted)) % 0.30/0.55 (declare-const |tptp.'A _'quoted __ escape_''| $$unsorted) % 0.30/0.55 (declare-const tptp.g (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.q (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.p (-> $$unsorted Bool)) % 0.30/0.55 (define tptp.l1 () (let ((_let_1 (@var "C" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_1 _let_2) (_ _let_2 _let_1))))) % 0.30/0.55 (define @t1 () (_ tptp.f (_ tptp.f (_ tptp.f tptp.b)))) % 0.30/0.55 (define @t2 () (not (_ tptp.s @t1))) % 0.30/0.55 (define @t3 () (@var "Z" $$unsorted)) % 0.30/0.55 (define @t4 () (@var "Y" $$unsorted)) % 0.30/0.55 (define @t5 () (_ tptp.f @t4)) % 0.30/0.55 (define @t6 () (@var "X" $$unsorted)) % 0.30/0.55 (define @t7 () (_ (_ (_ tptp.g @t6) @t5) @t3)) % 0.30/0.55 (define @t8 () (_ (_ (_ tptp.r @t6) @t5) @t7)) % 0.30/0.55 (define @t9 () (@list @t4 @t3)) % 0.30/0.55 (define @t10 () (not (_ (_ tptp.q @t6) tptp.a))) % 0.30/0.55 (define @t11 () (_ tptp.p @t6)) % 0.30/0.55 (define @t12 () (@list @t6)) % 0.30/0.55 (define @t13 () (@var "C" $$unsorted)) % 0.30/0.55 (define @t14 () (@var "F" (-> $$unsorted $$unsorted))) % 0.30/0.55 (define @t15 () (_ tptp.p tptp.h)) % 0.30/0.55 (define @t16 () (exists @t12 @t11)) % 0.30/0.55 (define @t17 () (not @t16)) % 0.30/0.55 (define @t18 () (@var "P" (-> $$unsorted Bool))) % 0.30/0.55 (define @t19 () (lambda (@list @t13 @t18) (_ @t18 @t13))) % 0.30/0.55 (define @t20 () (tptp.p tptp.h)) % 0.30/0.55 (define @t21 () (tptp.p @t6)) % 0.30/0.55 (define @t22 () (forall @t12 (not @t21))) % 0.30/0.55 (define @t23 () (not @t11)) % 0.30/0.55 (define @t24 () (forall @t12 @t23)) % 0.30/0.55 (define @t25 () (not @t24)) % 0.30/0.55 (assume @p1 (=> (and tptp.p0 (not tptp.q0)) (or tptp.r0 (not tptp.s0)))) % 0.30/0.55 (assume @p2 (forall @t12 (=> (or @t11 @t10) (exists @t9 (and @t8 @t2))))) % 0.30/0.55 (assume @p3 (exists (@list @t4) (forall (@list @t6 @t3) (or (= @t5 @t7) (not (= @t1 tptp.a)) (= @t6 @t5))))) % 0.30/0.55 (assume @p4 (or true false)) % 0.30/0.55 (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.30/0.55 (assume @p6 (forall @t12 (= (=> @t10 @t11) (exists @t9 (xor @t8 @t2))))) % 0.30/0.55 (assume @p7 (_ tptp.l2 (lambda (@list @t13 @t14) (_ @t14 @t13)))) % 0.30/0.55 (assume @p8 (forall (@list (@var "X" tptp.new)) (_ (_ tptp.newp (_ (_ tptp.newf tptp.newc) tptp.a)) tptp.a))) % 0.30/0.55 (assume @p9 @t15) % 0.30/0.55 (assume @p10 @t17) % 0.30/0.55 (assume @p11 tptp.ia1) % 0.30/0.55 (assume @p12 tptp.ia2) % 0.30/0.55 (assume @p13 tptp.ia3) % 0.30/0.55 (assume @p14 true) % 0.30/0.55 (step @p15 (= tptp.l1 @t19) :rule refl :args (@t19)) % 0.30/0.55 (step @p16 :rule refl :args (@t20)) % 0.30/0.55 (step @p17 :rule refl :args (@t15)) % 0.30/0.55 (step @p18 :rule cong :premises (@p17 @p16) :args ((= @t15 @t20))) % 0.30/0.55 (step @p19 :rule symm :premises (@p18)) % 0.30/0.55 (step @p20 :rule eq_resolve :premises (@p17 @p19)) % 0.30/0.55 (step @p21 :rule eq_resolve :premises (@p9 @p20)) % 0.30/0.55 (step @p22 :rule bool-double-not-elim :args (@t22)) % 0.30/0.55 (step @p23 :rule refl :args (@t21)) % 0.30/0.55 (step @p24 :rule refl :args (@t11)) % 0.30/0.55 (step @p25 :rule cong :premises (@p24 @p23) :args ((= @t11 @t21))) % 0.30/0.55 (step @p26 :rule symm :premises (@p25)) % 0.30/0.55 (step @p27 :rule eq_resolve :premises (@p24 @p26)) % 0.30/0.55 (step @p28 :rule cong :premises (@p27) :args (@t23)) % 0.30/0.55 (step @p29 :rule cong :premises (@p28) :args (@t24)) % 0.30/0.55 (step @p30 :rule cong :premises (@p29) :args (@t25)) % 0.30/0.55 (step @p31 :rule exists-elim :args ((= @t16 @t25))) % 0.30/0.55 (step @p32 :rule trans :premises (@p31 @p30)) % 0.30/0.55 (step @p33 :rule cong :premises (@p32) :args (@t17)) % 0.30/0.55 (step @p34 :rule trans :premises (@p33 @p22)) % 0.30/0.55 (step @p35 :rule eq_resolve :premises (@p10 @p34)) % 0.30/0.55 (assume-push @p42 @t22) % 0.30/0.55 (step @p37 :rule instantiate :premises (@p35) :args ((@list tptp.h))) % 0.30/0.55 (step-pop @p43 :rule scope :premises (@p37)) % 0.30/0.55 (step @p38 :rule process_scope :premises (@p43) :args ((not @t20))) % 0.30/0.55 (step @p40 :rule implies_elim :premises (@p38)) % 0.30/0.55 (step @p41 false :rule chain_m_resolution :premises (@p40 @p35 @p21) :args (false (@list false false) (@list @t22 @t20))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.33/0.55 % cvc5 exiting %------------------------------------------------------------------------------