TSTP Solution File: SYN347-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN347-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n019.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:12 EDT 2024
% Result : Unsatisfiable 0.21s 0.53s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYN347-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.13/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n019.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue May 28 13:29:09 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.UDXyfcVal3/cvc5---1.0.5_30671.smt2
% 0.21/0.53 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.UDXyfcVal3/cvc5---1.0.5_30671.smt2
% 0.21/0.54 (assume a0 (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))) (tptp.f tptp.a tptp.b))))
% 0.21/0.54 (assume a1 (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)) (tptp.f tptp.a tptp.b))))
% 0.21/0.54 (assume a2 (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))) (not (tptp.f tptp.a tptp.b)))))
% 0.21/0.54 (assume a3 (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)) (not (tptp.f tptp.a tptp.b)))))
% 0.21/0.54 (assume a4 (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2)))))
% 0.21/0.54 (assume a5 (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2))))))
% 0.21/0.54 (step t1 (cl (not (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b))) :rule or_pos)
% 0.21/0.54 (step t2 (cl (tptp.f tptp.b (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule reordering :premises (t1))
% 0.21/0.54 (step t3 (cl (not (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b))) :rule or_pos)
% 0.21/0.54 (step t4 (cl (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b)) (not (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule reordering :premises (t3))
% 0.21/0.54 (step t5 (cl (not (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule or_pos)
% 0.21/0.54 (step t6 (cl (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))) (not (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))))) :rule reordering :premises (t5))
% 0.21/0.54 (step t7 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2)))))) :rule implies_neg1)
% 0.21/0.54 (anchor :step t8)
% 0.21/0.54 (assume t8.a0 (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))))))
% 0.21/0.54 (step t8.t1 (cl (or (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2)))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))))) :rule forall_inst :args ((:= X1 tptp.a) (:= X2 tptp.b)))
% 0.21/0.54 (step t8.t2 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2)))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule or :premises (t8.t1))
% 0.21/0.54 (step t8.t3 (cl (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule resolution :premises (t8.t2 t8.a0))
% 0.21/0.54 (step t8 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2)))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule subproof :discharge (t8.a0))
% 0.21/0.54 (step t9 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule resolution :premises (t7 t8))
% 0.21/0.54 (step t10 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) (not (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))))) :rule implies_neg2)
% 0.21/0.54 (step t11 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))))) :rule resolution :premises (t9 t10))
% 0.21/0.54 (step t12 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))))) :rule contraction :premises (t11))
% 0.21/0.54 (step t13 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2)))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule implies :premises (t12))
% 0.21/0.54 (step t14 (cl (not (= (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))) (tptp.f tptp.a tptp.b))) (or (tptp.f tptp.a tptp.b) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2)))))))) (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))) (tptp.f tptp.a tptp.b)))) (or (tptp.f tptp.a tptp.b) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))))))) :rule equiv_pos2)
% 0.21/0.54 (step t15 (cl (= (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))) (tptp.f tptp.a tptp.b))) (or (tptp.f tptp.a tptp.b) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2)))))))) :rule all_simplify)
% 0.21/0.54 (step t16 (cl (or (tptp.f tptp.a tptp.b) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2))))))) :rule resolution :premises (t14 t15 a0))
% 0.21/0.54 (step t17 (cl (tptp.f tptp.a tptp.b) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2)))))) :rule or :premises (t16))
% 0.21/0.54 (step t18 (cl (not (= (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a)))))) (not (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a)))))) (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) :rule equiv_pos2)
% 0.21/0.54 (step t19 (cl (= (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))))) :rule refl)
% 0.21/0.54 (step t20 (cl (= (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) :rule all_simplify)
% 0.21/0.54 (step t21 (cl (= (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a)))))) :rule cong :premises (t19 t20))
% 0.21/0.54 (step t22 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2)))))) :rule implies_neg1)
% 0.21/0.54 (anchor :step t23)
% 0.21/0.54 (assume t23.a0 (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))))
% 0.21/0.54 (step t23.t1 (cl (or (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2)))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a)))))) :rule forall_inst :args ((:= X1 tptp.a) (:= X2 tptp.a)))
% 0.21/0.54 (step t23.t2 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2)))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) :rule or :premises (t23.t1))
% 0.21/0.54 (step t23.t3 (cl (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) :rule resolution :premises (t23.t2 t23.a0))
% 0.21/0.54 (step t23 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2)))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) :rule subproof :discharge (t23.a0))
% 0.21/0.54 (step t24 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) :rule resolution :premises (t22 t23))
% 0.21/0.54 (step t25 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) (not (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a)))))) :rule implies_neg2)
% 0.21/0.54 (step t26 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a)))))) :rule resolution :premises (t24 t25))
% 0.21/0.54 (step t27 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a)))))) :rule contraction :premises (t26))
% 0.21/0.54 (step t28 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) :rule resolution :premises (t18 t21 t27))
% 0.21/0.54 (step t29 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2)))))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) :rule implies :premises (t28))
% 0.21/0.54 (step t30 (cl (not (= (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) (not (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) :rule equiv_pos2)
% 0.21/0.54 (step t31 (cl (= (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))))) :rule refl)
% 0.21/0.54 (step t32 (cl (= (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a))) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) :rule all_simplify)
% 0.21/0.54 (step t33 (cl (= (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) :rule cong :premises (t31 t32))
% 0.21/0.54 (step t34 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2))))) :rule implies_neg1)
% 0.21/0.54 (anchor :step t35)
% 0.21/0.54 (assume t35.a0 (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))))
% 0.21/0.54 (step t35.t1 (cl (or (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) :rule forall_inst :args ((:= X1 tptp.a) (:= X2 tptp.a)))
% 0.21/0.54 (step t35.t2 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) :rule or :premises (t35.t1))
% 0.21/0.54 (step t35.t3 (cl (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) :rule resolution :premises (t35.t2 t35.a0))
% 0.21/0.54 (step t35 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) :rule subproof :discharge (t35.a0))
% 0.21/0.54 (step t36 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) :rule resolution :premises (t34 t35))
% 0.21/0.54 (step t37 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) (not (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) :rule implies_neg2)
% 0.21/0.54 (step t38 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) :rule resolution :premises (t36 t37))
% 0.21/0.54 (step t39 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.a)) (tptp.f tptp.a (tptp.y tptp.a tptp.a))))) :rule contraction :premises (t38))
% 0.21/0.54 (step t40 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))) (tptp.f tptp.a (tptp.y tptp.a tptp.a)))) :rule resolution :premises (t30 t33 t39))
% 0.21/0.54 (step t41 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2))))) (tptp.f tptp.a (tptp.y tptp.a tptp.a))) :rule implies :premises (t40))
% 0.21/0.54 (step t42 (cl (not (= (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)) (not (tptp.f tptp.a tptp.b)))) (or (not (tptp.f tptp.a tptp.b)) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2))))))) (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)) (not (tptp.f tptp.a tptp.b))))) (or (not (tptp.f tptp.a tptp.b)) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))))) :rule equiv_pos2)
% 0.21/0.54 (step t43 (cl (= (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)) (not (tptp.f tptp.a tptp.b)))) (or (not (tptp.f tptp.a tptp.b)) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2))))))) :rule all_simplify)
% 0.21/0.54 (step t44 (cl (or (not (tptp.f tptp.a tptp.b)) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2)))))) :rule resolution :premises (t42 t43 a3))
% 0.21/0.54 (step t45 (cl (not (tptp.f tptp.a tptp.b)) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (tptp.f X2 (tptp.y X1 X2))))) :rule or :premises (t44))
% 0.21/0.54 (step t46 (cl (not (= (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))) (not (tptp.f tptp.a tptp.b)))) (or (not (tptp.f tptp.a tptp.b)) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2)))))))) (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))) (not (tptp.f tptp.a tptp.b))))) (or (not (tptp.f tptp.a tptp.b)) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))))) :rule equiv_pos2)
% 0.21/0.54 (step t47 (cl (= (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))) (not (tptp.f tptp.a tptp.b)))) (or (not (tptp.f tptp.a tptp.b)) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2)))))))) :rule all_simplify)
% 0.21/0.54 (step t48 (cl (or (not (tptp.f tptp.a tptp.b)) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2))))))) :rule resolution :premises (t46 t47 a2))
% 0.21/0.54 (step t49 (cl (not (tptp.f tptp.a tptp.b)) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (not (tptp.f X2 (tptp.y X1 X2)))))) :rule or :premises (t48))
% 0.21/0.54 (step t50 (cl (not (tptp.f tptp.a tptp.b)) (not (tptp.f tptp.a tptp.b))) :rule resolution :premises (t29 t41 t45 t49))
% 0.21/0.54 (step t51 (cl (not (tptp.f tptp.a tptp.b))) :rule contraction :premises (t50))
% 0.21/0.54 (step t52 (cl (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f X1 (tptp.y X1 X2)) (not (tptp.f X2 (tptp.y X1 X2)))))) :rule resolution :premises (t17 t51))
% 0.21/0.54 (step t53 (cl (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule resolution :premises (t13 t52))
% 0.21/0.54 (step t54 (cl (not (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule or_pos)
% 0.21/0.54 (step t55 (cl (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))) (not (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))))) :rule reordering :premises (t54))
% 0.21/0.54 (step t56 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2)))))) :rule implies_neg1)
% 0.21/0.54 (anchor :step t57)
% 0.21/0.54 (assume t57.a0 (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2))))))
% 0.21/0.54 (step t57.t1 (cl (or (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2)))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))))) :rule forall_inst :args ((:= X1 tptp.a) (:= X2 tptp.b)))
% 0.21/0.54 (step t57.t2 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2)))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule or :premises (t57.t1))
% 0.21/0.54 (step t57.t3 (cl (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule resolution :premises (t57.t2 t57.a0))
% 0.21/0.54 (step t57 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2)))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule subproof :discharge (t57.a0))
% 0.21/0.54 (step t58 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule resolution :premises (t56 t57))
% 0.21/0.54 (step t59 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) (not (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))))) :rule implies_neg2)
% 0.21/0.54 (step t60 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))))) :rule resolution :premises (t58 t59))
% 0.21/0.54 (step t61 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))))) :rule contraction :premises (t60))
% 0.21/0.54 (step t62 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f tptp.a (tptp.y X1 X2))) (not (tptp.f tptp.b (tptp.y X1 X2)))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule implies :premises (t61))
% 0.21/0.54 (step t63 (cl (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule resolution :premises (t62 a5))
% 0.21/0.54 (step t64 (cl (not (tptp.f tptp.b (tptp.y tptp.a tptp.b))) (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule resolution :premises (t6 t53 t55 t63))
% 0.21/0.54 (step t65 (cl (not (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule contraction :premises (t64))
% 0.21/0.54 (step t66 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2))))) :rule implies_neg1)
% 0.21/0.54 (anchor :step t67)
% 0.21/0.54 (assume t67.a0 (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2)))))
% 0.21/0.54 (step t67.t1 (cl (or (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule forall_inst :args ((:= X1 tptp.a) (:= X2 tptp.b)))
% 0.21/0.54 (step t67.t2 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule or :premises (t67.t1))
% 0.21/0.54 (step t67.t3 (cl (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule resolution :premises (t67.t2 t67.a0))
% 0.21/0.54 (step t67 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule subproof :discharge (t67.a0))
% 0.21/0.54 (step t68 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule resolution :premises (t66 t67))
% 0.21/0.54 (step t69 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) (not (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule implies_neg2)
% 0.21/0.54 (step t70 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule resolution :premises (t68 t69))
% 0.21/0.54 (step t71 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2)))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule contraction :premises (t70))
% 0.21/0.54 (step t72 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (tptp.f tptp.a (tptp.y X1 X2)) (tptp.f tptp.b (tptp.y X1 X2))))) (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule implies :premises (t71))
% 0.21/0.54 (step t73 (cl (or (tptp.f tptp.a (tptp.y tptp.a tptp.b)) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule resolution :premises (t72 a4))
% 0.21/0.54 (step t74 (cl (tptp.f tptp.a (tptp.y tptp.a tptp.b))) :rule resolution :premises (t4 t65 t73))
% 0.21/0.54 (step t75 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2))))) :rule implies_neg1)
% 0.21/0.54 (anchor :step t76)
% 0.21/0.54 (assume t76.a0 (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)))))
% 0.21/0.54 (step t76.t1 (cl (or (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule forall_inst :args ((:= X1 tptp.a) (:= X2 tptp.b)))
% 0.21/0.54 (step t76.t2 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule or :premises (t76.t1))
% 0.21/0.54 (step t76.t3 (cl (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule resolution :premises (t76.t2 t76.a0))
% 0.21/0.54 (step t76 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule subproof :discharge (t76.a0))
% 0.21/0.54 (step t77 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule resolution :premises (t75 t76))
% 0.21/0.54 (step t78 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) (not (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule implies_neg2)
% 0.21/0.54 (step t79 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule resolution :premises (t77 t78))
% 0.21/0.54 (step t80 (cl (=> (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b))))) :rule contraction :premises (t79))
% 0.21/0.54 (step t81 (cl (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2))))) (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule implies :premises (t80))
% 0.21/0.54 (step t82 (cl (not (= (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)) (tptp.f tptp.a tptp.b))) (or (tptp.f tptp.a tptp.b) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2))))))) (not (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)) (tptp.f tptp.a tptp.b)))) (or (tptp.f tptp.a tptp.b) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)))))) :rule equiv_pos2)
% 0.21/0.54 (step t83 (cl (= (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)) (tptp.f tptp.a tptp.b))) (or (tptp.f tptp.a tptp.b) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2))))))) :rule all_simplify)
% 0.21/0.54 (step t84 (cl (or (tptp.f tptp.a tptp.b) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2)))))) :rule resolution :premises (t82 t83 a1))
% 0.21/0.54 (step t85 (cl (tptp.f tptp.a tptp.b) (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2))))) :rule or :premises (t84))
% 0.21/0.54 (step t86 (cl (forall ((X1 $$unsorted) (X2 $$unsorted)) (or (not (tptp.f X1 (tptp.y X1 X2))) (tptp.f X2 (tptp.y X1 X2))))) :rule resolution :premises (t85 t51))
% 0.21/0.54 (step t87 (cl (or (not (tptp.f tptp.a (tptp.y tptp.a tptp.b))) (tptp.f tptp.b (tptp.y tptp.a tptp.b)))) :rule resolution :premises (t81 t86))
% 0.21/0.54 (step t88 (cl) :rule resolution :premises (t2 t74 t65 t87))
% 0.21/0.54
% 0.21/0.54 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.UDXyfcVal3/cvc5---1.0.5_30671.smt2
% 0.21/0.55 % cvc5---1.0.5 exiting
% 0.21/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------