TSTP Solution File: SYN354-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN354-1 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n014.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 18:25:14 EDT 2024
% Result : Unsatisfiable 0.21s 0.52s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN354-1 : TPTP v8.2.0. Released v1.2.0.
% 0.03/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue May 28 12:38:24 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.POeMFnKujV/cvc5---1.0.5_29593.smt2
% 0.21/0.52 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.POeMFnKujV/cvc5---1.0.5_29593.smt2
% 0.21/0.52 (assume a0 (tptp.f tptp.a tptp.b))
% 0.21/0.52 (assume a1 (tptp.g tptp.a tptp.b))
% 0.21/0.52 (assume a2 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))))
% 0.21/0.52 (assume a3 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))))
% 0.21/0.52 (assume a4 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (not (tptp.g Y1 (tptp.z Y1 Y2))))))
% 0.21/0.52 (assume a5 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (tptp.g Y1 (tptp.z Y1 Y2)))))
% 0.21/0.52 (assume a6 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2)))))
% 0.21/0.52 (step t1 (cl (not (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)) :rule or_pos)
% 0.21/0.52 (step t2 (cl (not (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)) :rule contraction :premises (t1))
% 0.21/0.52 (step t3 (cl (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)))) :rule reordering :premises (t2))
% 0.21/0.52 (step t4 (cl (not (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)) :rule or_pos)
% 0.21/0.52 (step t5 (cl (not (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)) :rule contraction :premises (t4))
% 0.21/0.52 (step t6 (cl (not (tptp.f tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.f tptp.b tptp.b) (not (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)))) :rule reordering :premises (t5))
% 0.21/0.52 (step t7 (cl (not (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b)))) (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b))) :rule or_pos)
% 0.21/0.52 (step t8 (cl (not (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b)))) (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b))) :rule contraction :premises (t7))
% 0.21/0.52 (step t9 (cl (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b))))) :rule reordering :premises (t8))
% 0.21/0.52 (step t10 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2)))) (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b)))) (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2))))) :rule implies_neg1)
% 0.21/0.52 (anchor :step t11)
% 0.21/0.52 (assume t11.a0 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2)))))
% 0.21/0.52 (step t11.t1 (cl (or (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2))))) (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b))))) :rule forall_inst :args ((:= Y1 tptp.b) (:= Y2 tptp.b)))
% 0.21/0.52 (step t11.t2 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2))))) (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b)))) :rule or :premises (t11.t1))
% 0.21/0.52 (step t11.t3 (cl (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b)))) :rule resolution :premises (t11.t2 t11.a0))
% 0.21/0.52 (step t11 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2))))) (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b)))) :rule subproof :discharge (t11.a0))
% 0.21/0.52 (step t12 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2)))) (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b)))) (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b)))) :rule resolution :premises (t10 t11))
% 0.21/0.52 (step t13 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2)))) (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b)))) (not (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b))))) :rule implies_neg2)
% 0.21/0.52 (step t14 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2)))) (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b)))) (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2)))) (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b))))) :rule resolution :premises (t12 t13))
% 0.21/0.52 (step t15 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2)))) (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b))))) :rule contraction :premises (t14))
% 0.21/0.52 (step t16 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.a Y1)) (not (tptp.f tptp.b Y1)) (not (tptp.f Y1 Y2))))) (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b)))) :rule implies :premises (t15))
% 0.21/0.52 (step t17 (cl (or (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.b tptp.b)) (not (tptp.f tptp.b tptp.b)))) :rule resolution :premises (t16 a6))
% 0.21/0.52 (step t18 (cl (not (tptp.f tptp.b tptp.b))) :rule resolution :premises (t9 a0 t17))
% 0.21/0.52 (step t19 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))) (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2)))) :rule implies_neg1)
% 0.21/0.52 (anchor :step t20)
% 0.21/0.52 (assume t20.a0 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))))
% 0.21/0.52 (step t20.t1 (cl (or (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2)))) (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)))) :rule forall_inst :args ((:= Y1 tptp.a) (:= Y2 tptp.b)))
% 0.21/0.52 (step t20.t2 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2)))) (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) :rule or :premises (t20.t1))
% 0.21/0.52 (step t20.t3 (cl (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) :rule resolution :premises (t20.t2 t20.a0))
% 0.21/0.52 (step t20 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2)))) (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) :rule subproof :discharge (t20.a0))
% 0.21/0.52 (step t21 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))) (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) :rule resolution :premises (t19 t20))
% 0.21/0.52 (step t22 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))) (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) (not (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)))) :rule implies_neg2)
% 0.21/0.52 (step t23 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))) (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))) (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)))) :rule resolution :premises (t21 t22))
% 0.21/0.52 (step t24 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))) (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)))) :rule contraction :premises (t23))
% 0.21/0.52 (step t25 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (tptp.g tptp.b (tptp.z Y1 Y2)) (tptp.g Y2 (tptp.z Y1 Y2)) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2)))) (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) :rule implies :premises (t24))
% 0.21/0.52 (step t26 (cl (or (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (tptp.g tptp.b (tptp.z tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) :rule resolution :premises (t25 a2))
% 0.21/0.52 (step t27 (cl (tptp.g tptp.b (tptp.z tptp.a tptp.b))) :rule resolution :premises (t6 a0 t18 t26))
% 0.21/0.52 (step t28 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))) (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2)))) :rule implies_neg1)
% 0.21/0.52 (anchor :step t29)
% 0.21/0.52 (assume t29.a0 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))))
% 0.21/0.52 (step t29.t1 (cl (or (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2)))) (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)))) :rule forall_inst :args ((:= Y1 tptp.a) (:= Y2 tptp.b)))
% 0.21/0.52 (step t29.t2 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2)))) (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) :rule or :premises (t29.t1))
% 0.21/0.52 (step t29.t3 (cl (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) :rule resolution :premises (t29.t2 t29.a0))
% 0.21/0.52 (step t29 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2)))) (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) :rule subproof :discharge (t29.a0))
% 0.21/0.52 (step t30 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))) (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) :rule resolution :premises (t28 t29))
% 0.21/0.52 (step t31 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))) (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) (not (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)))) :rule implies_neg2)
% 0.21/0.52 (step t32 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))) (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))) (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)))) :rule resolution :premises (t30 t31))
% 0.21/0.52 (step t33 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2))) (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b)))) :rule contraction :premises (t32))
% 0.21/0.52 (step t34 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.g tptp.b (tptp.z Y1 Y2))) (not (tptp.g Y2 (tptp.z Y1 Y2))) (not (tptp.f Y1 Y2)) (tptp.f tptp.b Y2)))) (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) :rule implies :premises (t33))
% 0.21/0.52 (step t35 (cl (or (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.g tptp.b (tptp.z tptp.a tptp.b))) (not (tptp.f tptp.a tptp.b)) (tptp.f tptp.b tptp.b))) :rule resolution :premises (t34 a3))
% 0.21/0.52 (step t36 (cl) :rule resolution :premises (t3 t27 t18 t35 a0))
% 0.21/0.52
% 0.21/0.52 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.POeMFnKujV/cvc5---1.0.5_29593.smt2
% 0.21/0.53 % cvc5---1.0.5 exiting
% 0.21/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------