%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : ITP001_2 : TPTP v9.2.1. Bugfixed v7.5.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n020.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 08:24:20 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 : ITP001_2 : TPTP v9.2.1. Bugfixed v7.5.0. % 0.13/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n020.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 03:32:55 EDT 2026 % 0.16/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 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.tp__o 0) % 0.30/0.55 (declare-sort tptp.del 0) % 0.30/0.55 (declare-sort $$unsorted 0) % 0.30/0.55 (declare-const tptp.c_2Emin_2E_3D (-> tptp.del $$unsorted)) % 0.30/0.55 (declare-const tptp.fo__c_2Ebool_2ET tptp.tp__o) % 0.30/0.55 (declare-const tptp.c_2Ebool_2ET $$unsorted) % 0.30/0.55 (declare-const tptp.surj__o (-> $$unsorted tptp.tp__o)) % 0.30/0.55 (declare-const tptp.inj__o (-> tptp.tp__o $$unsorted)) % 0.30/0.55 (declare-const tptp.i (-> tptp.del $$unsorted)) % 0.30/0.55 (declare-const tptp.k (-> tptp.del $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.bool tptp.del) % 0.30/0.55 (declare-const tptp.p (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.arr (-> tptp.del tptp.del tptp.del)) % 0.30/0.55 (declare-const tptp.mem (-> $$unsorted tptp.del Bool)) % 0.30/0.55 (declare-const tptp.ap (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (define @t1 () (@var "B" tptp.del)) % 0.30/0.55 (define @t2 () (@var "X" $$unsorted)) % 0.30/0.55 (define @t3 () (@var "F" $$unsorted)) % 0.30/0.55 (define @t4 () (tptp.ap @t3 @t2)) % 0.30/0.55 (define @t5 () (@var "A" tptp.del)) % 0.30/0.55 (define @t6 () (tptp.mem @t2 @t5)) % 0.30/0.55 (define @t7 () (@list @t2)) % 0.30/0.55 (define @t8 () (tptp.arr @t5 @t1)) % 0.30/0.55 (define @t9 () (tptp.mem @t3 @t8)) % 0.30/0.55 (define @t10 () (@list @t5 @t1 @t3)) % 0.30/0.55 (define @t11 () (@var "R" $$unsorted)) % 0.30/0.55 (define @t12 () (@var "Q" $$unsorted)) % 0.30/0.55 (define @t13 () (@var "G" $$unsorted)) % 0.30/0.55 (define @t14 () (@var "Y" $$unsorted)) % 0.30/0.55 (define @t15 () (@list @t5 @t2)) % 0.30/0.55 (define @t16 () (@var "X" tptp.tp__o)) % 0.30/0.55 (define @t17 () (tptp.inj__o @t16)) % 0.30/0.55 (define @t18 () (@list @t16)) % 0.30/0.55 (define @t19 () (@var "A_27a" tptp.del)) % 0.30/0.55 (define @t20 () (tptp.i tptp.bool)) % 0.30/0.55 (define @t21 () (not true)) % 0.30/0.55 (assume @p1 (forall @t10 (=> @t9 (forall @t7 (=> @t6 (tptp.mem @t4 @t1)))))) % 0.30/0.55 (assume @p2 (forall (@list @t12) (=> (tptp.mem @t12 tptp.bool) (forall (@list @t11) (=> (tptp.mem @t11 tptp.bool) (=> (= (tptp.p @t12) (tptp.p @t11)) (= @t12 @t11))))))) % 0.30/0.55 (assume @p3 (forall @t10 (=> @t9 (forall (@list @t13) (=> (tptp.mem @t13 @t8) (=> (forall @t7 (=> @t6 (= @t4 (tptp.ap @t13 @t2)))) (= @t3 @t13))))))) % 0.30/0.55 (assume @p4 (forall (@list @t5 @t14 @t2) (=> @t6 (= (tptp.ap (tptp.k @t5 @t14) @t2) @t14)))) % 0.30/0.55 (assume @p5 (forall @t15 (=> @t6 (= (tptp.ap (tptp.i @t5) @t2) @t2)))) % 0.30/0.55 (assume @p6 (forall @t18 (= (tptp.surj__o @t17) @t16))) % 0.30/0.55 (assume @p7 (forall @t18 (tptp.mem @t17 tptp.bool))) % 0.30/0.55 (assume @p8 (forall @t7 (=> (tptp.mem @t2 tptp.bool) (= @t2 (tptp.inj__o (tptp.surj__o @t2)))))) % 0.30/0.55 (assume @p9 (tptp.mem tptp.c_2Ebool_2ET tptp.bool)) % 0.30/0.55 (assume @p10 (= (tptp.inj__o tptp.fo__c_2Ebool_2ET) tptp.c_2Ebool_2ET)) % 0.30/0.55 (assume @p11 (tptp.p tptp.c_2Ebool_2ET)) % 0.30/0.55 (assume @p12 (forall (@list @t19) (tptp.mem (tptp.c_2Emin_2E_3D @t19) (tptp.arr @t19 (tptp.arr @t19 tptp.bool))))) % 0.30/0.55 (assume @p13 (forall @t15 (=> @t6 (forall (@list @t14) (=> (tptp.mem @t14 @t5) (= (tptp.p (tptp.ap (tptp.ap (tptp.c_2Emin_2E_3D @t5) @t2) @t14)) (= @t2 @t14))))))) % 0.30/0.55 (assume @p14 (= true (= @t20 @t20))) % 0.30/0.55 (assume @p15 @t21) % 0.30/0.55 (assume @p16 true) % 0.30/0.55 (step @p17 :rule evaluate :args (@t21)) % 0.30/0.55 (step @p18 false :rule eq_resolve :premises (@p15 @p17)) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.30/0.55 % cvc5 exiting %------------------------------------------------------------------------------