%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : KRS017-1 : TPTP v9.2.1. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n013.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:28:45 AM UTC 2026 % Result : Unsatisfiable 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 : KRS017-1 : TPTP v9.2.1. Released v2.0.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 : n013.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 05:25:30 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.54 % SZS status Unsatisfiable % 0.30/0.54 % SZS output start Proof % 0.30/0.54 ( % 0.30/0.54 (declare-sort $$unsorted 0) % 0.30/0.54 (declare-const tptp.u0r1 (-> $$unsorted $$unsorted)) % 0.30/0.54 (declare-const tptp.r (-> $$unsorted $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.u0r2 (-> $$unsorted $$unsorted)) % 0.30/0.54 (declare-const tptp.a (-> $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.u0r3 (-> $$unsorted $$unsorted)) % 0.30/0.54 (declare-const tptp.e (-> $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.exists $$unsorted) % 0.30/0.54 (define @t1 () (tptp.e tptp.exists)) % 0.30/0.54 (define @t2 () (tptp.a tptp.exists)) % 0.30/0.54 (define @t3 () (@var "X1" $$unsorted)) % 0.30/0.54 (define @t4 () (tptp.e @t3)) % 0.30/0.54 (define @t5 () (not @t4)) % 0.30/0.54 (define @t6 () (@var "X2" $$unsorted)) % 0.30/0.54 (define @t7 () (@var "X3" $$unsorted)) % 0.30/0.54 (define @t8 () (forall (@list @t7 @t3 @t6) (or (tptp.a @t7) @t5 (not (tptp.r @t3 @t6)) (not (tptp.r @t7 @t6))))) % 0.30/0.54 (define @t9 () (@var "X4" $$unsorted)) % 0.30/0.54 (define @t10 () (not (tptp.r @t3 @t9))) % 0.30/0.54 (define @t11 () (tptp.u0r2 @t3)) % 0.30/0.54 (define @t12 () (@list @t3 @t9)) % 0.30/0.54 (define @t13 () (tptp.u0r1 @t3)) % 0.30/0.54 (define @t14 () (not @t1)) % 0.30/0.54 (define @t15 () (tptp.u0r3 tptp.exists)) % 0.30/0.54 (define @t16 () (tptp.r tptp.exists @t15)) % 0.30/0.54 (define @t17 () (or @t16 @t14)) % 0.30/0.54 (define @t18 () (not @t16)) % 0.30/0.54 (define @t19 () (or @t2 @t14 @t18 @t18)) % 0.30/0.54 (define @t20 () (not @t19)) % 0.30/0.54 (assume @p1 @t1) % 0.30/0.54 (assume @p2 (not @t2)) % 0.30/0.54 (assume @p3 (forall (@list @t3) (or (tptp.r @t3 (tptp.u0r3 @t3)) @t5))) % 0.30/0.54 (assume @p4 @t8) % 0.30/0.54 (assume @p5 (forall @t12 (or @t4 (not (tptp.a @t11)) @t10))) % 0.30/0.54 (assume @p6 (forall @t12 (or @t4 (tptp.r @t11 @t13) @t10))) % 0.30/0.54 (assume @p7 (forall @t12 (or @t4 (tptp.r @t3 @t13) @t10))) % 0.30/0.54 (step @p8 :rule instantiate :premises (@p3) :args ((@list tptp.exists))) % 0.30/0.54 (step @p9 :rule cnf_or_pos :args (@t17)) % 0.30/0.54 (step @p10 :rule reordering :premises (@p9) :args ((or @t14 @t16 (not @t17)))) % 0.30/0.54 (step @p11 :rule chain_m_resolution :premises (@p10 @p1 @p8) :args (@t16 (@list false false) (@list @t1 @t17))) % 0.30/0.54 (step @p12 :rule cnf_or_pos :args (@t19)) % 0.30/0.54 (step @p13 :rule factoring :premises (@p12)) % 0.30/0.54 (step @p14 :rule reordering :premises (@p13) :args ((or @t2 @t14 @t18 @t20))) % 0.30/0.54 (step @p15 :rule chain_m_resolution :premises (@p14 @p2 @p1 @p11) :args (@t20 (@list true false false) (@list @t2 @t1 @t16))) % 0.30/0.54 (assume-push @p22 @t8) % 0.30/0.54 (step @p17 :rule instantiate :premises (@p4) :args ((@list tptp.exists tptp.exists @t15))) % 0.30/0.54 (step-pop @p23 :rule scope :premises (@p17)) % 0.30/0.54 (step @p18 :rule process_scope :premises (@p23) :args (@t19)) % 0.30/0.54 (step @p20 :rule implies_elim :premises (@p18)) % 0.30/0.54 (step @p21 false :rule chain_m_resolution :premises (@p20 @p15 @p4) :args (false (@list true false) (@list @t19 @t8))) % 0.30/0.54 ) % 0.30/0.54 % SZS output end Proof % 0.30/0.54 % cvc5 exiting %------------------------------------------------------------------------------