TSTP Solution File: KRS012-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : KRS012-1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% 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 May 29 17:17:11 EDT 2024
% Result : Unsatisfiable 0.17s 0.49s
% Output : Proof 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : KRS012-1 : TPTP v8.2.0. Released v2.0.0.
% 0.09/0.13 % Command : do_cvc5 %s %d
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 26 08:23:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.47 %----Proving TF0_NAR, FOF, or CNF
% 0.17/0.47 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.17/0.49 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.gFu7lIDGUB/cvc5---1.0.5_8747.smt2
% 0.17/0.49 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.gFu7lIDGUB/cvc5---1.0.5_8747.smt2
% 0.17/0.49 (assume a0 (tptp.c tptp.exists))
% 0.17/0.49 (assume a1 (not (tptp.f tptp.exists)))
% 0.17/0.49 (assume a2 (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3)))))
% 0.17/0.49 (assume a3 (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2)))))
% 0.17/0.49 (assume a4 (forall ((X1 $$unsorted)) (or (tptp.c X1) (not (tptp.d (tptp.u0r1 X1))) (not (tptp.e (tptp.u0r2 X1))))))
% 0.17/0.49 (assume a5 (forall ((X1 $$unsorted)) (or (tptp.c X1) (tptp.d (tptp.u0r2 X1)) (not (tptp.d (tptp.u0r1 X1))))))
% 0.17/0.49 (assume a6 (forall ((X1 $$unsorted)) (or (tptp.c X1) (tptp.r X1 (tptp.u0r2 X1)) (not (tptp.d (tptp.u0r1 X1))))))
% 0.17/0.49 (assume a7 (forall ((X1 $$unsorted)) (or (tptp.c X1) (tptp.r X1 (tptp.u0r1 X1)) (not (tptp.e (tptp.u0r2 X1))))))
% 0.17/0.49 (assume a8 (forall ((X1 $$unsorted)) (or (tptp.c X1) (tptp.r X1 (tptp.u0r1 X1)) (tptp.d (tptp.u0r2 X1)))))
% 0.17/0.49 (assume a9 (forall ((X1 $$unsorted)) (or (tptp.c X1) (tptp.r X1 (tptp.u0r1 X1)) (tptp.r X1 (tptp.u0r2 X1)))))
% 0.17/0.49 (assume a10 (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.e X2) (not (tptp.f X1)) (not (tptp.r X1 X2)))))
% 0.17/0.49 (assume a11 (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1))))))
% 0.17/0.49 (assume a12 (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1)))))
% 0.17/0.49 (step t1 (cl (not (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))) :rule or_pos)
% 0.17/0.49 (step t2 (cl (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (tptp.d (tptp.u1r1 tptp.exists)) (not (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))))) :rule reordering :premises (t1))
% 0.17/0.49 (step t3 (cl (not (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists))))) (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists)))) :rule or_pos)
% 0.17/0.49 (step t4 (cl (not (tptp.c tptp.exists)) (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists))) (not (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists)))))) :rule reordering :premises (t3))
% 0.17/0.49 (step t5 (cl (not (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists))))) (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists)))) :rule or_pos)
% 0.17/0.49 (step t6 (cl (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists))) (not (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists)))))) :rule reordering :premises (t5))
% 0.17/0.49 (step t7 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1))))) (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists))))) (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1)))))) :rule implies_neg1)
% 0.17/0.49 (anchor :step t8)
% 0.17/0.49 (assume t8.a0 (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1))))))
% 0.17/0.49 (step t8.t1 (cl (or (not (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1)))))) (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists)))))) :rule forall_inst :args ((:= X1 tptp.exists)))
% 0.17/0.49 (step t8.t2 (cl (not (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1)))))) (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists))))) :rule or :premises (t8.t1))
% 0.17/0.49 (step t8.t3 (cl (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists))))) :rule resolution :premises (t8.t2 t8.a0))
% 0.17/0.49 (step t8 (cl (not (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1)))))) (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists))))) :rule subproof :discharge (t8.a0))
% 0.17/0.49 (step t9 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1))))) (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists))))) (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists))))) :rule resolution :premises (t7 t8))
% 0.17/0.49 (step t10 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1))))) (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists))))) (not (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists)))))) :rule implies_neg2)
% 0.17/0.49 (step t11 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1))))) (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists))))) (=> (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1))))) (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists)))))) :rule resolution :premises (t9 t10))
% 0.17/0.49 (step t12 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1))))) (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists)))))) :rule contraction :premises (t11))
% 0.17/0.49 (step t13 (cl (not (forall ((X1 $$unsorted)) (or (tptp.f X1) (not (tptp.e (tptp.u1r1 X1)))))) (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists))))) :rule implies :premises (t12))
% 0.17/0.49 (step t14 (cl (or (tptp.f tptp.exists) (not (tptp.e (tptp.u1r1 tptp.exists))))) :rule resolution :premises (t13 a11))
% 0.17/0.49 (step t15 (cl (not (tptp.e (tptp.u1r1 tptp.exists)))) :rule resolution :premises (t6 a1 t14))
% 0.17/0.49 (step t16 (cl (not (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))) (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) :rule or_pos)
% 0.17/0.49 (step t17 (cl (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists)) (not (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) :rule reordering :premises (t16))
% 0.17/0.49 (step t18 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1)))) (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))) (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1))))) :rule implies_neg1)
% 0.17/0.49 (anchor :step t19)
% 0.17/0.49 (assume t19.a0 (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1)))))
% 0.17/0.49 (step t19.t1 (cl (or (not (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1))))) (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) :rule forall_inst :args ((:= X1 tptp.exists)))
% 0.17/0.49 (step t19.t2 (cl (not (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1))))) (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))) :rule or :premises (t19.t1))
% 0.17/0.49 (step t19.t3 (cl (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))) :rule resolution :premises (t19.t2 t19.a0))
% 0.17/0.49 (step t19 (cl (not (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1))))) (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))) :rule subproof :discharge (t19.a0))
% 0.17/0.49 (step t20 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1)))) (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))) (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))) :rule resolution :premises (t18 t19))
% 0.17/0.49 (step t21 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1)))) (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))) (not (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) :rule implies_neg2)
% 0.17/0.49 (step t22 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1)))) (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))) (=> (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1)))) (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) :rule resolution :premises (t20 t21))
% 0.17/0.49 (step t23 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1)))) (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) :rule contraction :premises (t22))
% 0.17/0.49 (step t24 (cl (not (forall ((X1 $$unsorted)) (or (tptp.f X1) (tptp.r X1 (tptp.u1r1 X1))))) (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))) :rule implies :premises (t23))
% 0.17/0.49 (step t25 (cl (or (tptp.f tptp.exists) (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))) :rule resolution :premises (t24 a12))
% 0.17/0.49 (step t26 (cl (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) :rule resolution :premises (t17 a1 t25))
% 0.17/0.49 (step t27 (cl (=> (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3)))) (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists))))) (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3))))) :rule implies_neg1)
% 0.17/0.49 (anchor :step t28)
% 0.17/0.49 (assume t28.a0 (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3)))))
% 0.17/0.49 (step t28.t1 (cl (or (not (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3))))) (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists)))))) :rule forall_inst :args ((:= X3 (tptp.u1r1 tptp.exists)) (:= X1 tptp.exists)))
% 0.17/0.49 (step t28.t2 (cl (not (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3))))) (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists))))) :rule or :premises (t28.t1))
% 0.17/0.49 (step t28.t3 (cl (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists))))) :rule resolution :premises (t28.t2 t28.a0))
% 0.17/0.49 (step t28 (cl (not (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3))))) (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists))))) :rule subproof :discharge (t28.a0))
% 0.17/0.49 (step t29 (cl (=> (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3)))) (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists))))) (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists))))) :rule resolution :premises (t27 t28))
% 0.17/0.49 (step t30 (cl (=> (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3)))) (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists))))) (not (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists)))))) :rule implies_neg2)
% 0.17/0.49 (step t31 (cl (=> (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3)))) (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists))))) (=> (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3)))) (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists)))))) :rule resolution :premises (t29 t30))
% 0.17/0.49 (step t32 (cl (=> (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3)))) (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists)))))) :rule contraction :premises (t31))
% 0.17/0.49 (step t33 (cl (not (forall ((X3 $$unsorted) (X1 $$unsorted)) (or (tptp.e X3) (not (tptp.c X1)) (not (tptp.r X1 X3)) (not (tptp.d X3))))) (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists))))) :rule implies :premises (t32))
% 0.17/0.49 (step t34 (cl (or (tptp.e (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))) (not (tptp.d (tptp.u1r1 tptp.exists))))) :rule resolution :premises (t33 a2))
% 0.17/0.49 (step t35 (cl (not (tptp.d (tptp.u1r1 tptp.exists)))) :rule resolution :premises (t4 a0 t15 t26 t34))
% 0.17/0.49 (step t36 (cl (=> (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2)))) (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2))))) :rule implies_neg1)
% 0.17/0.49 (anchor :step t37)
% 0.17/0.49 (assume t37.a0 (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2)))))
% 0.17/0.49 (step t37.t1 (cl (or (not (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2))))) (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))))) :rule forall_inst :args ((:= X2 (tptp.u1r1 tptp.exists)) (:= X1 tptp.exists)))
% 0.17/0.49 (step t37.t2 (cl (not (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2))))) (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) :rule or :premises (t37.t1))
% 0.17/0.49 (step t37.t3 (cl (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) :rule resolution :premises (t37.t2 t37.a0))
% 0.17/0.49 (step t37 (cl (not (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2))))) (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) :rule subproof :discharge (t37.a0))
% 0.17/0.49 (step t38 (cl (=> (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2)))) (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) :rule resolution :premises (t36 t37))
% 0.17/0.49 (step t39 (cl (=> (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2)))) (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) (not (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))))) :rule implies_neg2)
% 0.17/0.49 (step t40 (cl (=> (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2)))) (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) (=> (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2)))) (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))))) :rule resolution :premises (t38 t39))
% 0.17/0.49 (step t41 (cl (=> (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2)))) (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists)))))) :rule contraction :premises (t40))
% 0.17/0.49 (step t42 (cl (not (forall ((X2 $$unsorted) (X1 $$unsorted)) (or (tptp.d X2) (not (tptp.c X1)) (not (tptp.r X1 X2))))) (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) :rule implies :premises (t41))
% 0.17/0.49 (step t43 (cl (or (tptp.d (tptp.u1r1 tptp.exists)) (not (tptp.c tptp.exists)) (not (tptp.r tptp.exists (tptp.u1r1 tptp.exists))))) :rule resolution :premises (t42 a3))
% 0.17/0.49 (step t44 (cl) :rule resolution :premises (t2 t35 t43 t26 a0))
% 0.17/0.49
% 0.17/0.49 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.gFu7lIDGUB/cvc5---1.0.5_8747.smt2
% 0.17/0.50 % cvc5---1.0.5 exiting
% 0.17/0.50 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------