%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : DAT334_8 : TPTP v9.2.1. Released v8.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n017.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:14:46 AM UTC 2026 % Result : Theorem 0.30s 0.54s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT334_8 : TPTP v9.2.1. Released v8.2.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.15/0.33 % Computer : n017.cluster.edu % 0.15/0.33 % Model : x86_64 x86_64 % 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.33 % Memory : 8042.1875MB % 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.33 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Mon Jun 1 22:31:01 EDT 2026 % 0.15/0.34 % CPUTime : % 0.30/0.48 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.54 % SZS status Theorem % 0.30/0.54 % SZS output start Proof % 0.30/0.54 ( % 0.30/0.54 (declare-sort |tptp.'$ki_world'| 0) % 0.30/0.54 (declare-sort $$unsorted 0) % 0.30/0.54 (declare-const |tptp.'$ki_local_world'| |tptp.'$ki_world'|) % 0.30/0.54 (declare-const tptp.john $$unsorted) % 0.30/0.54 (declare-const tptp.math $$unsorted) % 0.30/0.54 (declare-const tptp.mary $$unsorted) % 0.30/0.54 (declare-const tptp.teach (-> |tptp.'$ki_world'| $$unsorted $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.sue $$unsorted) % 0.30/0.54 (declare-const tptp.psych $$unsorted) % 0.30/0.54 (declare-const |tptp.'$ki_exists_in_world_$i'| (-> |tptp.'$ki_world'| $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.cs $$unsorted) % 0.30/0.54 (declare-const |tptp.'$ki_accessible'| (-> |tptp.'$ki_world'| |tptp.'$ki_world'| Bool)) % 0.30/0.54 (define @t1 () (@var "W" |tptp.'$ki_world'|)) % 0.30/0.54 (define @t2 () (@list @t1)) % 0.30/0.54 (define @t3 () (@var "X" $$unsorted)) % 0.30/0.54 (define @t4 () (|tptp.'$ki_exists_in_world_$i'| @t1 @t3)) % 0.30/0.54 (define @t5 () (@list @t3)) % 0.30/0.54 (define @t6 () (tptp.teach @t1 tptp.sue tptp.psych)) % 0.30/0.54 (define @t7 () (tptp.teach @t1 tptp.mary tptp.psych)) % 0.30/0.54 (define @t8 () (tptp.teach @t1 @t3 tptp.cs)) % 0.30/0.54 (define @t9 () (and @t4 @t8)) % 0.30/0.54 (define @t10 () (exists @t5 @t9)) % 0.30/0.54 (define @t11 () (tptp.teach @t1 tptp.john tptp.math)) % 0.30/0.54 (define @t12 () (and @t11 @t10 @t7 @t6)) % 0.30/0.54 (define @t13 () (|tptp.'$ki_accessible'| |tptp.'$ki_local_world'| @t1)) % 0.30/0.54 (define @t14 () (=> @t13 @t12)) % 0.30/0.54 (define @t15 () (forall @t2 @t14)) % 0.30/0.54 (define @t16 () (=> @t13 @t10)) % 0.30/0.54 (define @t17 () (forall @t2 @t16)) % 0.30/0.54 (define @t18 () (not @t17)) % 0.30/0.54 (define @t19 () (not (forall @t5 (or (not @t4) (not @t8))))) % 0.30/0.54 (define @t20 () (forall @t5 (not @t9))) % 0.30/0.54 (define @t21 () (not @t20)) % 0.30/0.54 (define @t22 () (@quantifiers_skolemize (forall @t2 (or (not @t13) @t19)) 0)) % 0.30/0.54 (define @t23 () (|tptp.'$ki_accessible'| |tptp.'$ki_local_world'| @t22)) % 0.30/0.54 (define @t24 () (forall @t5 (or (not (|tptp.'$ki_exists_in_world_$i'| @t22 @t3)) (not (tptp.teach @t22 @t3 tptp.cs))))) % 0.30/0.54 (define @t25 () (not @t24)) % 0.30/0.54 (define @t26 () (not @t23)) % 0.30/0.54 (define @t27 () (or @t26 @t25)) % 0.30/0.54 (define @t28 () (@list true)) % 0.30/0.54 (define @t29 () (@list @t27)) % 0.30/0.54 (define @t30 () (and (tptp.teach @t22 tptp.john tptp.math) @t25 (tptp.teach @t22 tptp.mary tptp.psych) (tptp.teach @t22 tptp.sue tptp.psych))) % 0.30/0.54 (define @t31 () (not @t30)) % 0.30/0.54 (define @t32 () (and @t11 @t19 @t7 @t6)) % 0.30/0.54 (define @t33 () (or @t26 @t30)) % 0.30/0.54 (assume @p1 (forall @t2 (|tptp.'$ki_accessible'| @t1 @t1))) % 0.30/0.54 (assume @p2 (forall @t2 (exists @t5 @t4))) % 0.30/0.54 (assume @p3 @t15) % 0.30/0.54 (assume @p4 @t18) % 0.30/0.54 (assume @p5 true) % 0.30/0.54 (step @p6 :rule bool-impl-elim :args (@t13 @t19)) % 0.30/0.54 (step @p7 :rule cong :premises (@p6) :args ((forall @t2 (=> @t13 @t19)))) % 0.30/0.54 (step @p8 :rule bool-and-de-morgan :args (@t4 @t8 true)) % 0.30/0.54 (step @p9 :rule cong :premises (@p8) :args (@t20)) % 0.30/0.54 (step @p10 :rule cong :premises (@p9) :args (@t21)) % 0.30/0.54 (step @p11 :rule exists-elim :args ((= @t10 @t21))) % 0.30/0.54 (step @p12 :rule trans :premises (@p11 @p10)) % 0.30/0.54 (step @p13 :rule refl :args (@t13)) % 0.30/0.54 (step @p14 :rule cong :premises (@p13 @p12) :args (@t16)) % 0.30/0.54 (step @p15 :rule cong :premises (@p14) :args (@t17)) % 0.30/0.54 (step @p16 :rule trans :premises (@p15 @p7)) % 0.30/0.54 (step @p17 :rule cong :premises (@p16) :args (@t18)) % 0.30/0.54 (step @p18 :rule eq_resolve :premises (@p4 @p17)) % 0.30/0.54 (step @p19 :rule skolemize :premises (@p18)) % 0.30/0.54 (step @p20 :rule bool-double-not-elim :args (@t23)) % 0.30/0.54 (step @p21 :rule refl :args (@t27)) % 0.30/0.54 (step @p22 :rule nary_cong :premises (@p21 @p20) :args ((or @t27 (not @t26)))) % 0.30/0.54 (step @p23 :rule cnf_or_neg :args (@t27 0)) % 0.30/0.54 (step @p24 :rule eq_resolve :premises (@p23 @p22)) % 0.30/0.54 (step @p25 :rule reordering :premises (@p24) :args ((or @t23 @t27))) % 0.30/0.54 (step @p26 :rule chain_m_resolution :premises (@p25 @p19) :args (@t23 @t28 @t29)) % 0.30/0.54 (step @p27 :rule bool-double-not-elim :args (@t24)) % 0.30/0.54 (step @p28 :rule nary_cong :premises (@p21 @p27) :args ((or @t27 (not @t25)))) % 0.30/0.54 (step @p29 :rule cnf_or_neg :args (@t27 1)) % 0.30/0.54 (step @p30 :rule eq_resolve :premises (@p29 @p28)) % 0.30/0.54 (step @p31 :rule reordering :premises (@p30) :args ((or @t24 @t27))) % 0.30/0.54 (step @p32 :rule chain_m_resolution :premises (@p31 @p19) :args (@t24 @t28 @t29)) % 0.30/0.54 (step @p33 :rule cnf_and_pos :args (@t30 1)) % 0.30/0.54 (step @p34 :rule reordering :premises (@p33) :args ((or @t25 @t31))) % 0.30/0.54 (step @p35 :rule chain_m_resolution :premises (@p34 @p32) :args (@t31 (@list false) (@list @t24))) % 0.30/0.55 (step @p36 :rule bool-impl-elim :args (@t13 @t32)) % 0.30/0.55 (step @p37 :rule cong :premises (@p36) :args ((forall @t2 (=> @t13 @t32)))) % 0.30/0.55 (step @p38 :rule refl :args (@t6)) % 0.30/0.55 (step @p39 :rule refl :args (@t7)) % 0.30/0.55 (step @p40 :rule refl :args (@t11)) % 0.30/0.55 (step @p41 :rule nary_cong :premises (@p40 @p12 @p39 @p38) :args (@t12)) % 0.30/0.55 (step @p42 :rule cong :premises (@p13 @p41) :args (@t14)) % 0.30/0.55 (step @p43 :rule cong :premises (@p42) :args (@t15)) % 0.30/0.55 (step @p44 :rule trans :premises (@p43 @p37)) % 0.30/0.55 (step @p45 :rule eq_resolve :premises (@p3 @p44)) % 0.30/0.55 (step @p46 :rule instantiate :premises (@p45) :args ((@list @t22))) % 0.30/0.55 (step @p47 :rule cnf_or_pos :args (@t33)) % 0.30/0.55 (step @p48 :rule reordering :premises (@p47) :args ((or @t26 @t30 (not @t33)))) % 0.30/0.55 (step @p49 false :rule chain_m_resolution :premises (@p48 @p46 @p35 @p26) :args (false (@list false true false) (@list @t33 @t30 @t23))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.30/0.55 % cvc5 exiting %------------------------------------------------------------------------------