%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : CSR051+1 : TPTP v9.2.1. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n021.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:11:32 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.11 % Problem : CSR051+1 : TPTP v9.2.1. Released v3.4.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.33 % Computer : n021.cluster.edu % 0.16/0.33 % Model : x86_64 x86_64 % 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.33 % Memory : 8042.1875MB % 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.33 % CPULimit : 300 % 0.16/0.33 % WCLimit : 300 % 0.16/0.33 % DateTime : Mon Jun 1 20:53:49 EDT 2026 % 0.16/0.33 % 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 $$unsorted 0) % 0.30/0.54 (declare-const tptp.c_marriagelicensedocument $$unsorted) % 0.30/0.54 (declare-const tptp.genlinverse (-> $$unsorted $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.marriagelicensedocument (-> $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.c_tptpmarriagelicensedocument $$unsorted) % 0.30/0.54 (declare-const tptp.disjointwith (-> $$unsorted $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.genlpreds (-> $$unsorted $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.binarypredicate (-> $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.thing (-> $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.c_tptp_member3356_mt $$unsorted) % 0.30/0.54 (declare-const tptp.isa (-> $$unsorted $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.mtvisible (-> $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.predicate (-> $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.collection (-> $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.genls (-> $$unsorted $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.c_basekb $$unsorted) % 0.30/0.54 (define @t1 () (tptp.marriagelicensedocument tptp.c_tptpmarriagelicensedocument)) % 0.30/0.54 (define @t2 () (tptp.mtvisible tptp.c_tptp_member3356_mt)) % 0.30/0.54 (define @t3 () (@var "COL2" $$unsorted)) % 0.30/0.54 (define @t4 () (@var "COL1" $$unsorted)) % 0.30/0.54 (define @t5 () (@var "OBJ" $$unsorted)) % 0.30/0.54 (define @t6 () (@var "GENLPRED" $$unsorted)) % 0.30/0.54 (define @t7 () (@var "SPECPRED" $$unsorted)) % 0.30/0.54 (define @t8 () (@var "PRED" $$unsorted)) % 0.30/0.54 (define @t9 () (@var "INS" $$unsorted)) % 0.30/0.54 (define @t10 () (tptp.predicate @t9)) % 0.30/0.54 (define @t11 () (@var "ARG1" $$unsorted)) % 0.30/0.54 (define @t12 () (@list @t11 @t9)) % 0.30/0.54 (define @t13 () (@var "ARG2" $$unsorted)) % 0.30/0.54 (define @t14 () (@list @t9 @t13)) % 0.30/0.54 (define @t15 () (@var "Z" $$unsorted)) % 0.30/0.54 (define @t16 () (@var "X" $$unsorted)) % 0.30/0.54 (define @t17 () (@var "Y" $$unsorted)) % 0.30/0.54 (define @t18 () (@list @t16)) % 0.30/0.54 (define @t19 () (tptp.binarypredicate @t9)) % 0.30/0.54 (define @t20 () (@var "NEW" $$unsorted)) % 0.30/0.54 (define @t21 () (@var "OLD" $$unsorted)) % 0.30/0.54 (define @t22 () (@list @t21 @t13 @t20)) % 0.30/0.54 (define @t23 () (@list @t11 @t21 @t20)) % 0.30/0.54 (define @t24 () (tptp.collection @t9)) % 0.30/0.54 (define @t25 () (tptp.genls @t20 @t21)) % 0.30/0.54 (define @t26 () (tptp.marriagelicensedocument @t16)) % 0.30/0.54 (define @t27 () (tptp.isa @t16 tptp.c_marriagelicensedocument)) % 0.30/0.54 (define @t28 () (=> @t2 @t26)) % 0.30/0.54 (define @t29 () (exists @t18 @t28)) % 0.30/0.54 (define @t30 () (not @t29)) % 0.30/0.54 (define @t31 () (@var "BOUND_VARIABLE_7650" $$unsorted)) % 0.30/0.54 (define @t32 () (forall (@list @t31) (not (tptp.marriagelicensedocument @t31)))) % 0.30/0.54 (define @t33 () (not @t26)) % 0.30/0.54 (define @t34 () (forall @t18 @t33)) % 0.30/0.54 (define @t35 () (forall @t18 @t2)) % 0.30/0.54 (define @t36 () (and @t35 @t34)) % 0.30/0.54 (define @t37 () (forall @t18 (not @t28))) % 0.30/0.54 (define @t38 () (not @t37)) % 0.30/0.54 (define @t39 () (not @t1)) % 0.30/0.54 (assume @p1 (=> @t2 @t1)) % 0.30/0.54 (assume @p2 (forall (@list @t5 @t4 @t3) (not (and (tptp.isa @t5 @t4) (tptp.isa @t5 @t3) (tptp.disjointwith @t4 @t3))))) % 0.30/0.54 (assume @p3 (forall (@list @t7 @t8 @t6) (=> (and (tptp.genlinverse @t7 @t8) (tptp.genlinverse @t8 @t6)) (tptp.genlpreds @t7 @t6)))) % 0.30/0.54 (assume @p4 (forall @t12 (=> (tptp.genlpreds @t11 @t9) @t10))) % 0.30/0.54 (assume @p5 (forall @t14 (=> (tptp.genlpreds @t9 @t13) @t10))) % 0.30/0.54 (assume @p6 (forall (@list @t16 @t17 @t15) (=> (and (tptp.genlpreds @t16 @t17) (tptp.genlpreds @t17 @t15)) (tptp.genlpreds @t16 @t15)))) % 0.30/0.54 (assume @p7 (forall @t18 (=> (tptp.predicate @t16) (tptp.genlpreds @t16 @t16)))) % 0.30/0.54 (assume @p8 (forall @t12 (=> (tptp.genlinverse @t11 @t9) @t19))) % 0.30/0.54 (assume @p9 (forall @t14 (=> (tptp.genlinverse @t9 @t13) @t19))) % 0.30/0.54 (assume @p10 (forall @t22 (=> (and (tptp.genlinverse @t21 @t13) (tptp.genlpreds @t20 @t21)) (tptp.genlinverse @t20 @t13)))) % 0.30/0.54 (assume @p11 (forall @t23 (=> (and (tptp.genlinverse @t11 @t21) (tptp.genlpreds @t21 @t20)) (tptp.genlinverse @t11 @t20)))) % 0.30/0.54 (assume @p12 (forall @t12 (=> (tptp.disjointwith @t11 @t9) @t24))) % 0.30/0.54 (assume @p13 (forall @t14 (=> (tptp.disjointwith @t9 @t13) @t24))) % 0.30/0.54 (assume @p14 (forall (@list @t16 @t17) (=> (tptp.disjointwith @t16 @t17) (tptp.disjointwith @t17 @t16)))) % 0.30/0.54 (assume @p15 (forall @t23 (=> (and (tptp.disjointwith @t11 @t21) @t25) (tptp.disjointwith @t11 @t20)))) % 0.30/0.54 (assume @p16 (forall @t22 (=> (and (tptp.disjointwith @t21 @t13) @t25) (tptp.disjointwith @t20 @t13)))) % 0.30/0.55 (assume @p17 (tptp.mtvisible tptp.c_basekb)) % 0.30/0.55 (assume @p18 (forall @t18 (=> @t27 @t26))) % 0.30/0.55 (assume @p19 (forall @t18 (=> @t26 @t27))) % 0.30/0.55 (assume @p20 (forall @t12 (=> (tptp.isa @t11 @t9) @t24))) % 0.30/0.55 (assume @p21 (forall @t14 (=> (tptp.isa @t9 @t13) (tptp.thing @t9)))) % 0.30/0.55 (assume @p22 (forall @t23 (=> (and (tptp.isa @t11 @t21) (tptp.genls @t21 @t20)) (tptp.isa @t11 @t20)))) % 0.30/0.55 (assume @p23 @t30) % 0.30/0.55 (assume @p24 true) % 0.30/0.55 (step @p25 :rule bool-double-not-elim :args ((and @t2 @t32))) % 0.30/0.55 (step @p26 :rule alpha_equiv :args (@t34 (@list @t16) (@list @t31))) % 0.30/0.55 (step @p27 :rule quant-unused-vars :args ((= @t35 @t2))) % 0.30/0.55 (step @p28 :rule nary_cong :premises (@p27 @p26) :args (@t36)) % 0.30/0.55 (step @p29 :rule quant-miniscope-and :args ((= (forall @t18 (and @t2 @t33)) @t36))) % 0.30/0.55 (step @p30 :rule trans :premises (@p29 @p28)) % 0.30/0.55 (step @p31 :rule bool-implies-de-morgan :args (@t2 @t26)) % 0.30/0.55 (step @p32 :rule cong :premises (@p31) :args (@t37)) % 0.30/0.55 (step @p33 :rule trans :premises (@p32 @p30)) % 0.30/0.55 (step @p34 :rule cong :premises (@p33) :args (@t38)) % 0.30/0.55 (step @p35 :rule exists-elim :args ((= @t29 @t38))) % 0.30/0.55 (step @p36 :rule trans :premises (@p35 @p34)) % 0.30/0.55 (step @p37 :rule cong :premises (@p36) :args (@t30)) % 0.30/0.55 (step @p38 :rule trans :premises (@p37 @p25)) % 0.30/0.55 (step @p39 :rule eq_resolve :premises (@p23 @p38)) % 0.30/0.55 (step @p40 :rule and_elim :premises (@p39) :args (0)) % 0.30/0.55 (step @p41 :rule implies_elim :premises (@p1)) % 0.30/0.55 (step @p42 :rule reordering :premises (@p41) :args ((or @t1 (not @t2)))) % 0.30/0.55 (step @p43 :rule chain_m_resolution :premises (@p42 @p40) :args (@t1 (@list false) (@list @t2))) % 0.30/0.55 (step @p44 :rule and_elim :premises (@p39) :args (1)) % 0.30/0.55 (assume-push @p52 @t32) % 0.30/0.55 (step @p46 :rule instantiate :premises (@p44) :args ((@list tptp.c_tptpmarriagelicensedocument))) % 0.30/0.55 (step-pop @p53 :rule scope :premises (@p46)) % 0.30/0.55 (step @p47 :rule process_scope :premises (@p53) :args (@t39)) % 0.30/0.55 (step @p49 :rule implies_elim :premises (@p47)) % 0.30/0.55 (step @p50 :rule reordering :premises (@p49) :args ((or @t39 (not @t32)))) % 0.30/0.55 (step @p51 false :rule chain_m_resolution :premises (@p50 @p44 @p43) :args (false (@list false false) (@list @t32 @t1))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.30/0.55 % cvc5 exiting %------------------------------------------------------------------------------