TSTP Solution File: LAT005-6 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : LAT005-6 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n024.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:18:24 EDT 2024
% Result : Unsatisfiable 73.37s 73.60s
% Output : Proof 73.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : LAT005-6 : TPTP v8.2.0. Released v1.1.0.
% 0.08/0.17 % Command : do_cvc5 %s %d
% 0.16/0.39 % Computer : n024.cluster.edu
% 0.16/0.39 % Model : x86_64 x86_64
% 0.16/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39 % Memory : 8042.1875MB
% 0.16/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39 % CPULimit : 300
% 0.16/0.39 % WCLimit : 300
% 0.16/0.39 % DateTime : Mon May 27 14:51:09 EDT 2024
% 0.16/0.39 % CPUTime :
% 0.39/0.57 %----Proving TF0_NAR, FOF, or CNF
% 0.39/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.43/10.61 --- Run --no-e-matching --full-saturate-quant at 5...
% 15.42/15.63 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.44/20.65 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.49/25.69 --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 30.50/30.72 --- Run --trigger-sel=max --full-saturate-quant at 5...
% 35.57/35.75 --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 5...
% 40.56/40.78 --- Run --multi-trigger-cache --full-saturate-quant at 5...
% 45.83/46.04 --- Run --prenex-quant=none --full-saturate-quant at 5...
% 50.82/51.07 --- Run --enum-inst-interleave --decision=internal --full-saturate-quant at 5...
% 55.89/56.10 --- Run --relevant-triggers --full-saturate-quant at 5...
% 60.93/61.15 --- Run --finite-model-find --e-matching --sort-inference --uf-ss-fair at 5...
% 65.97/66.23 --- Run --pre-skolem-quant=on --full-saturate-quant at 10...
% 73.37/73.60 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.Uizb1ZRKbs/cvc5---1.0.5_16143.smt2
% 73.37/73.60 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.Uizb1ZRKbs/cvc5---1.0.5_16143.smt2
% 73.37/73.63 (assume a0 (forall ((X $$unsorted)) (tptp.join tptp.n1 X tptp.n1)))
% 73.37/73.63 (assume a1 (forall ((X $$unsorted)) (tptp.join X X X)))
% 73.37/73.63 (assume a2 (forall ((X $$unsorted)) (tptp.join tptp.n0 X X)))
% 73.37/73.63 (assume a3 (forall ((X $$unsorted)) (tptp.meet tptp.n0 X tptp.n0)))
% 73.37/73.63 (assume a4 (forall ((X $$unsorted)) (tptp.meet X X X)))
% 73.37/73.63 (assume a5 (forall ((X $$unsorted)) (tptp.meet tptp.n1 X X)))
% 73.37/73.63 (assume a6 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))))
% 73.37/73.63 (assume a7 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))))
% 73.37/73.63 (assume a8 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))))
% 73.37/73.63 (assume a9 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))))
% 73.37/73.63 (assume a10 (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))))
% 73.37/73.63 (assume a11 (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))))
% 73.37/73.63 (assume a12 (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.join X Y Xy)) (not (tptp.join Y Z Yz)) (not (tptp.join X Yz Xyz)) (tptp.join Xy Z Xyz))))
% 73.37/73.63 (assume a13 (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.join X Y Xy)) (not (tptp.join Y Z Yz)) (not (tptp.join Xy Z Xyz)) (tptp.join X Yz Xyz))))
% 73.37/73.63 (assume a14 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.meet Z X1 Z1)) (tptp.join X Y1 Z1))))
% 73.37/73.63 (assume a15 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))))
% 73.37/73.63 (assume a16 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.meet X Y (tptp.meet_of X Y))))
% 73.37/73.63 (assume a17 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.meet X Y Z1)) (not (tptp.meet X Y Z2)) (= Z1 Z2))))
% 73.37/73.63 (assume a18 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.join X Y (tptp.join_of X Y))))
% 73.37/73.63 (assume a19 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.join X Y Z1)) (not (tptp.join X Y Z2)) (= Z1 Z2))))
% 73.37/73.63 (assume a20 (forall ((X $$unsorted)) (tptp.join X tptp.n1 tptp.n1)))
% 73.37/73.63 (assume a21 (forall ((X $$unsorted)) (tptp.join X tptp.n0 X)))
% 73.37/73.63 (assume a22 (forall ((X $$unsorted)) (tptp.meet X tptp.n0 tptp.n0)))
% 73.37/73.63 (assume a23 (forall ((X $$unsorted)) (tptp.meet X tptp.n1 X)))
% 73.37/73.63 (assume a24 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1))))
% 73.37/73.63 (assume a25 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.join Z X1 Z1)) (tptp.meet X Y1 Z1))))
% 73.37/73.63 (assume a26 (tptp.meet tptp.a tptp.b tptp.c))
% 73.37/73.63 (assume a27 (tptp.join tptp.c tptp.r2 tptp.n1))
% 73.37/73.63 (assume a28 (tptp.meet tptp.c tptp.r2 tptp.n0))
% 73.37/73.63 (assume a29 (tptp.meet tptp.r2 tptp.b tptp.e))
% 73.37/73.63 (assume a30 (tptp.join tptp.a tptp.b tptp.c2))
% 73.37/73.63 (assume a31 (tptp.join tptp.c2 tptp.r1 tptp.n1))
% 73.37/73.63 (assume a32 (tptp.meet tptp.c2 tptp.r1 tptp.n0))
% 73.37/73.63 (assume a33 (tptp.meet tptp.r2 tptp.a tptp.d))
% 73.37/73.63 (assume a34 (tptp.join tptp.r1 tptp.e tptp.a2))
% 73.37/73.63 (assume a35 (tptp.join tptp.r1 tptp.d tptp.b2))
% 73.37/73.63 (assume a36 (not (tptp.meet tptp.a2 tptp.b2 tptp.r1)))
% 73.37/73.63 (step t1 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) :rule implies_neg1)
% 73.37/73.63 (anchor :step t2)
% 73.37/73.63 (assume t2.a0 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))))
% 73.37/73.63 (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1)))) :rule forall_inst :args ((:= X tptp.r1) (:= Z tptp.a2) (:= Y tptp.d) (:= X1 tptp.b2) (:= Y1 tptp.n0) (:= Z1 tptp.r1)))
% 73.37/73.63 (step t2.t2 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1))) :rule or :premises (t2.t1))
% 73.37/73.63 (step t2.t3 (cl (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1))) :rule resolution :premises (t2.t2 t2.a0))
% 73.37/73.63 (step t2 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1))) :rule subproof :discharge (t2.a0))
% 73.37/73.63 (step t3 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1))) (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1))) :rule resolution :premises (t1 t2))
% 73.37/73.63 (step t4 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1))) (not (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1)))) :rule implies_neg2)
% 73.37/73.63 (step t5 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1)))) :rule resolution :premises (t3 t4))
% 73.37/73.63 (step t6 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1)))) :rule contraction :premises (t5))
% 73.37/73.63 (step t7 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1))) :rule implies :premises (t6))
% 73.37/73.63 (step t8 (cl (not (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1))) (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1)) :rule or_pos)
% 73.37/73.63 (step t9 (cl (tptp.meet tptp.a2 tptp.b2 tptp.r1) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1)))) :rule reordering :premises (t8))
% 73.37/73.63 (step t10 (cl (not (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1))) (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1)) :rule or_pos)
% 73.37/73.63 (step t11 (cl (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1) (not (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1)))) :rule reordering :premises (t10))
% 73.37/73.63 (step t12 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) :rule implies_neg1)
% 73.37/73.63 (anchor :step t13)
% 73.37/73.63 (assume t13.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))))
% 73.37/73.63 (step t13.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1)))) :rule forall_inst :args ((:= X tptp.r1) (:= Y tptp.e) (:= Z tptp.a2)))
% 73.37/73.63 (step t13.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1))) :rule or :premises (t13.t1))
% 73.37/73.63 (step t13.t3 (cl (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1))) :rule resolution :premises (t13.t2 t13.a0))
% 73.37/73.63 (step t13 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1))) :rule subproof :discharge (t13.a0))
% 73.37/73.63 (step t14 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1))) :rule resolution :premises (t12 t13))
% 73.37/73.63 (step t15 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1))) (not (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1)))) :rule implies_neg2)
% 73.37/73.63 (step t16 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1)))) :rule resolution :premises (t14 t15))
% 73.37/73.63 (step t17 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1)))) :rule contraction :premises (t16))
% 73.37/73.63 (step t18 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1))) :rule implies :premises (t17))
% 73.37/73.63 (step t19 (cl (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.meet tptp.r1 tptp.a2 tptp.r1))) :rule resolution :premises (t18 a9))
% 73.40/73.63 (step t20 (cl (tptp.meet tptp.r1 tptp.a2 tptp.r1)) :rule resolution :premises (t11 a34 t19))
% 73.40/73.63 (step t21 (cl (not (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1))) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1)) :rule or_pos)
% 73.40/73.63 (step t22 (cl (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1) (not (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1)))) :rule reordering :premises (t21))
% 73.40/73.63 (step t23 (cl (not (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0))) (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0)) :rule or_pos)
% 73.40/73.63 (step t24 (cl (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0) (not (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0)))) :rule reordering :premises (t23))
% 73.40/73.63 (step t25 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t26)
% 73.40/73.63 (assume t26.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))))
% 73.40/73.63 (step t26.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0)))) :rule forall_inst :args ((:= X tptp.c2) (:= Y tptp.r1) (:= Z tptp.n0)))
% 73.40/73.63 (step t26.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0))) :rule or :premises (t26.t1))
% 73.40/73.63 (step t26.t3 (cl (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0))) :rule resolution :premises (t26.t2 t26.a0))
% 73.40/73.63 (step t26 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0))) :rule subproof :discharge (t26.a0))
% 73.40/73.63 (step t27 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0))) :rule resolution :premises (t25 t26))
% 73.40/73.63 (step t28 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0))) (not (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0)))) :rule implies_neg2)
% 73.40/73.63 (step t29 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0)))) :rule resolution :premises (t27 t28))
% 73.40/73.63 (step t30 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0)))) :rule contraction :premises (t29))
% 73.40/73.63 (step t31 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0))) :rule implies :premises (t30))
% 73.40/73.63 (step t32 (cl (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.meet tptp.r1 tptp.c2 tptp.n0))) :rule resolution :premises (t31 a6))
% 73.40/73.63 (step t33 (cl (tptp.meet tptp.r1 tptp.c2 tptp.n0)) :rule resolution :premises (t24 a32 t32))
% 73.40/73.63 (step t34 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t35)
% 73.40/73.63 (assume t35.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))))
% 73.40/73.63 (step t35.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1)))) :rule forall_inst :args ((:= X tptp.r1) (:= Y tptp.c2) (:= Z tptp.n0)))
% 73.40/73.63 (step t35.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1))) :rule or :premises (t35.t1))
% 73.40/73.63 (step t35.t3 (cl (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1))) :rule resolution :premises (t35.t2 t35.a0))
% 73.40/73.63 (step t35 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1))) :rule subproof :discharge (t35.a0))
% 73.40/73.63 (step t36 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1))) (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1))) :rule resolution :premises (t34 t35))
% 73.40/73.63 (step t37 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1))) (not (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1)))) :rule implies_neg2)
% 73.40/73.63 (step t38 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1)))) :rule resolution :premises (t36 t37))
% 73.40/73.63 (step t39 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1)))) :rule contraction :premises (t38))
% 73.40/73.63 (step t40 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1))) :rule implies :premises (t39))
% 73.40/73.63 (step t41 (cl (or (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (tptp.join tptp.r1 tptp.n0 tptp.r1))) :rule resolution :premises (t40 a8))
% 73.40/73.63 (step t42 (cl (tptp.join tptp.r1 tptp.n0 tptp.r1)) :rule resolution :premises (t22 t33 t41))
% 73.40/73.63 (step t43 (cl (not (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0))) (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0)) :rule or_pos)
% 73.40/73.63 (step t44 (cl (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0) (not (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0)))) :rule reordering :premises (t43))
% 73.40/73.63 (step t45 (cl (not (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0))) (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0)) :rule or_pos)
% 73.40/73.63 (step t46 (cl (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (tptp.meet tptp.a2 tptp.d tptp.n0) (not (tptp.meet tptp.e tptp.d tptp.n0)) (not (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0)))) :rule reordering :premises (t45))
% 73.40/73.63 (step t47 (cl (not (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d))) (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d)) :rule or_pos)
% 73.40/73.63 (step t48 (cl (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d) (not (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d)))) :rule reordering :premises (t47))
% 73.40/73.63 (step t49 (cl (not (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d))) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d)) :rule or_pos)
% 73.40/73.63 (step t50 (cl (not (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d))) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (tptp.meet tptp.d tptp.c2 tptp.d)) :rule contraction :premises (t49))
% 73.40/73.63 (step t51 (cl (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (tptp.meet tptp.d tptp.c2 tptp.d) (not (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d)))) :rule reordering :premises (t50))
% 73.40/73.63 (step t52 (cl (not (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a))) (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a)) :rule or_pos)
% 73.40/73.63 (step t53 (cl (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a) (not (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a)))) :rule reordering :premises (t52))
% 73.40/73.63 (step t54 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t55)
% 73.40/73.63 (assume t55.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))))
% 73.40/73.63 (step t55.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a)))) :rule forall_inst :args ((:= X tptp.a) (:= Y tptp.b) (:= Z tptp.c2)))
% 73.40/73.63 (step t55.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a))) :rule or :premises (t55.t1))
% 73.40/73.63 (step t55.t3 (cl (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a))) :rule resolution :premises (t55.t2 t55.a0))
% 73.40/73.63 (step t55 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a))) :rule subproof :discharge (t55.a0))
% 73.40/73.63 (step t56 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a))) :rule resolution :premises (t54 t55))
% 73.40/73.63 (step t57 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a))) (not (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a)))) :rule implies_neg2)
% 73.40/73.63 (step t58 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a)))) :rule resolution :premises (t56 t57))
% 73.40/73.63 (step t59 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a)))) :rule contraction :premises (t58))
% 73.40/73.63 (step t60 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a))) :rule implies :premises (t59))
% 73.40/73.63 (step t61 (cl (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.meet tptp.a tptp.c2 tptp.a))) :rule resolution :premises (t60 a9))
% 73.40/73.63 (step t62 (cl (tptp.meet tptp.a tptp.c2 tptp.a)) :rule resolution :premises (t53 a30 t61))
% 73.40/73.63 (step t63 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d))) (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t64)
% 73.40/73.63 (assume t64.a0 (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))))
% 73.40/73.63 (step t64.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d)))) :rule forall_inst :args ((:= X tptp.r2) (:= Y tptp.a) (:= Xy tptp.d) (:= Z tptp.c2) (:= Yz tptp.a) (:= Xyz tptp.d)))
% 73.40/73.63 (step t64.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d))) :rule or :premises (t64.t1))
% 73.40/73.63 (step t64.t3 (cl (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d))) :rule resolution :premises (t64.t2 t64.a0))
% 73.40/73.63 (step t64 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d))) :rule subproof :discharge (t64.a0))
% 73.40/73.63 (step t65 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d))) :rule resolution :premises (t63 t64))
% 73.40/73.63 (step t66 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d))) (not (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d)))) :rule implies_neg2)
% 73.40/73.63 (step t67 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d)))) :rule resolution :premises (t65 t66))
% 73.40/73.63 (step t68 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d)))) :rule contraction :premises (t67))
% 73.40/73.63 (step t69 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d))) :rule implies :premises (t68))
% 73.40/73.63 (step t70 (cl (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (not (tptp.meet tptp.a tptp.c2 tptp.a)) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.d tptp.c2 tptp.d))) :rule resolution :premises (t69 a10))
% 73.40/73.63 (step t71 (cl (tptp.meet tptp.d tptp.c2 tptp.d)) :rule resolution :premises (t51 a33 t62 t70))
% 73.40/73.63 (step t72 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t73)
% 73.40/73.63 (assume t73.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))))
% 73.40/73.63 (step t73.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d)))) :rule forall_inst :args ((:= X tptp.d) (:= Y tptp.c2) (:= Z tptp.d)))
% 73.40/73.63 (step t73.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d))) :rule or :premises (t73.t1))
% 73.40/73.63 (step t73.t3 (cl (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d))) :rule resolution :premises (t73.t2 t73.a0))
% 73.40/73.63 (step t73 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d))) :rule subproof :discharge (t73.a0))
% 73.40/73.63 (step t74 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d))) (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d))) :rule resolution :premises (t72 t73))
% 73.40/73.63 (step t75 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d))) (not (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d)))) :rule implies_neg2)
% 73.40/73.63 (step t76 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d)))) :rule resolution :premises (t74 t75))
% 73.40/73.63 (step t77 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d)))) :rule contraction :premises (t76))
% 73.40/73.63 (step t78 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d))) :rule implies :premises (t77))
% 73.40/73.63 (step t79 (cl (or (not (tptp.meet tptp.d tptp.c2 tptp.d)) (tptp.meet tptp.c2 tptp.d tptp.d))) :rule resolution :premises (t78 a6))
% 73.40/73.63 (step t80 (cl (tptp.meet tptp.c2 tptp.d tptp.d)) :rule resolution :premises (t48 t71 t79))
% 73.40/73.63 (step t81 (cl (not (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e))) (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e)) :rule or_pos)
% 73.40/73.63 (step t82 (cl (tptp.meet tptp.a2 tptp.c2 tptp.e) (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (not (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e)))) :rule reordering :premises (t81))
% 73.40/73.63 (step t83 (cl (not (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e))) (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e)) :rule or_pos)
% 73.40/73.63 (step t84 (cl (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (not (tptp.meet tptp.e tptp.c2 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e) (not (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e)))) :rule reordering :premises (t83))
% 73.40/73.63 (step t85 (cl (not (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2))) (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2)) :rule or_pos)
% 73.40/73.63 (step t86 (cl (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2) (not (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2)))) :rule reordering :premises (t85))
% 73.40/73.63 (step t87 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t88)
% 73.40/73.63 (assume t88.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))))
% 73.40/73.63 (step t88.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2)))) :rule forall_inst :args ((:= X tptp.r1) (:= Y tptp.e) (:= Z tptp.a2)))
% 73.40/73.63 (step t88.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2))) :rule or :premises (t88.t1))
% 73.40/73.63 (step t88.t3 (cl (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2))) :rule resolution :premises (t88.t2 t88.a0))
% 73.40/73.63 (step t88 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2))) :rule subproof :discharge (t88.a0))
% 73.40/73.63 (step t89 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2))) :rule resolution :premises (t87 t88))
% 73.40/73.63 (step t90 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2))) (not (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2)))) :rule implies_neg2)
% 73.40/73.63 (step t91 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2)))) :rule resolution :premises (t89 t90))
% 73.40/73.63 (step t92 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2)))) :rule contraction :premises (t91))
% 73.40/73.63 (step t93 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2))) :rule implies :premises (t92))
% 73.40/73.63 (step t94 (cl (or (not (tptp.join tptp.r1 tptp.e tptp.a2)) (tptp.join tptp.e tptp.r1 tptp.a2))) :rule resolution :premises (t93 a7))
% 73.40/73.63 (step t95 (cl (tptp.join tptp.e tptp.r1 tptp.a2)) :rule resolution :premises (t86 a34 t94))
% 73.40/73.63 (step t96 (cl (not (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e))) (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e)) :rule or_pos)
% 73.40/73.63 (step t97 (cl (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e) (not (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e)))) :rule reordering :premises (t96))
% 73.40/73.63 (step t98 (cl (not (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0))) (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0)) :rule or_pos)
% 73.40/73.63 (step t99 (cl (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0) (not (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0)))) :rule reordering :premises (t98))
% 73.40/73.63 (step t100 (cl (not (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c))) (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c)) :rule or_pos)
% 73.40/73.63 (step t101 (cl (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c) (not (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c)))) :rule reordering :premises (t100))
% 73.40/73.63 (step t102 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t103)
% 73.40/73.63 (assume t103.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))))
% 73.40/73.63 (step t103.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c)))) :rule forall_inst :args ((:= X tptp.a) (:= Y tptp.b) (:= Z tptp.c)))
% 73.40/73.63 (step t103.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c))) :rule or :premises (t103.t1))
% 73.40/73.63 (step t103.t3 (cl (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c))) :rule resolution :premises (t103.t2 t103.a0))
% 73.40/73.63 (step t103 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c))) :rule subproof :discharge (t103.a0))
% 73.40/73.63 (step t104 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c))) (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c))) :rule resolution :premises (t102 t103))
% 73.40/73.63 (step t105 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c))) (not (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c)))) :rule implies_neg2)
% 73.40/73.63 (step t106 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c)))) :rule resolution :premises (t104 t105))
% 73.40/73.63 (step t107 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c)))) :rule contraction :premises (t106))
% 73.40/73.63 (step t108 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c))) :rule implies :premises (t107))
% 73.40/73.63 (step t109 (cl (or (not (tptp.meet tptp.a tptp.b tptp.c)) (tptp.meet tptp.b tptp.a tptp.c))) :rule resolution :premises (t108 a6))
% 73.40/73.63 (step t110 (cl (tptp.meet tptp.b tptp.a tptp.c)) :rule resolution :premises (t101 a26 t109))
% 73.40/73.63 (step t111 (cl (not (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0))) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0)) :rule or_pos)
% 73.40/73.63 (step t112 (cl (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0) (not (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0)))) :rule reordering :premises (t111))
% 73.40/73.63 (step t113 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t114)
% 73.40/73.63 (assume t114.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))))
% 73.40/73.63 (step t114.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0)))) :rule forall_inst :args ((:= X tptp.c) (:= Y tptp.r2) (:= Z tptp.n0)))
% 73.40/73.63 (step t114.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0))) :rule or :premises (t114.t1))
% 73.40/73.63 (step t114.t3 (cl (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0))) :rule resolution :premises (t114.t2 t114.a0))
% 73.40/73.63 (step t114 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0))) :rule subproof :discharge (t114.a0))
% 73.40/73.63 (step t115 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0))) (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0))) :rule resolution :premises (t113 t114))
% 73.40/73.63 (step t116 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0))) (not (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0)))) :rule implies_neg2)
% 73.40/73.63 (step t117 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0)))) :rule resolution :premises (t115 t116))
% 73.40/73.63 (step t118 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0)))) :rule contraction :premises (t117))
% 73.40/73.63 (step t119 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0))) :rule implies :premises (t118))
% 73.40/73.63 (step t120 (cl (or (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.r2 tptp.c tptp.n0))) :rule resolution :premises (t119 a6))
% 73.40/73.63 (step t121 (cl (tptp.meet tptp.r2 tptp.c tptp.n0)) :rule resolution :premises (t112 a28 t120))
% 73.40/73.63 (step t122 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0))) (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t123)
% 73.40/73.63 (assume t123.a0 (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))))
% 73.40/73.63 (step t123.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0)))) :rule forall_inst :args ((:= X tptp.r2) (:= Y tptp.b) (:= Xy tptp.e) (:= Z tptp.a) (:= Yz tptp.c) (:= Xyz tptp.n0)))
% 73.40/73.63 (step t123.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0))) :rule or :premises (t123.t1))
% 73.40/73.63 (step t123.t3 (cl (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0))) :rule resolution :premises (t123.t2 t123.a0))
% 73.40/73.63 (step t123 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0))) :rule subproof :discharge (t123.a0))
% 73.40/73.63 (step t124 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0))) :rule resolution :premises (t122 t123))
% 73.40/73.63 (step t125 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0))) (not (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0)))) :rule implies_neg2)
% 73.40/73.63 (step t126 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0)))) :rule resolution :premises (t124 t125))
% 73.40/73.63 (step t127 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0)))) :rule contraction :premises (t126))
% 73.40/73.63 (step t128 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0))) :rule implies :premises (t127))
% 73.40/73.63 (step t129 (cl (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.meet tptp.e tptp.a tptp.n0))) :rule resolution :premises (t128 a10))
% 73.40/73.63 (step t130 (cl (tptp.meet tptp.e tptp.a tptp.n0)) :rule resolution :premises (t99 a29 t110 t121 t129))
% 73.40/73.63 (step t131 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t132)
% 73.40/73.63 (assume t132.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))))
% 73.40/73.63 (step t132.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e)))) :rule forall_inst :args ((:= X tptp.e) (:= Y tptp.a) (:= Z tptp.n0)))
% 73.40/73.63 (step t132.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e))) :rule or :premises (t132.t1))
% 73.40/73.63 (step t132.t3 (cl (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e))) :rule resolution :premises (t132.t2 t132.a0))
% 73.40/73.63 (step t132 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e))) :rule subproof :discharge (t132.a0))
% 73.40/73.63 (step t133 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e))) (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e))) :rule resolution :premises (t131 t132))
% 73.40/73.63 (step t134 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e))) (not (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e)))) :rule implies_neg2)
% 73.40/73.63 (step t135 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e)))) :rule resolution :premises (t133 t134))
% 73.40/73.63 (step t136 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e)))) :rule contraction :premises (t135))
% 73.40/73.63 (step t137 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e))) :rule implies :premises (t136))
% 73.40/73.63 (step t138 (cl (or (not (tptp.meet tptp.e tptp.a tptp.n0)) (tptp.join tptp.e tptp.n0 tptp.e))) :rule resolution :premises (t137 a8))
% 73.40/73.63 (step t139 (cl (tptp.join tptp.e tptp.n0 tptp.e)) :rule resolution :premises (t97 t130 t138))
% 73.40/73.63 (step t140 (cl (not (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e))) (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e)) :rule or_pos)
% 73.40/73.63 (step t141 (cl (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (tptp.meet tptp.e tptp.c2 tptp.e) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e)))) :rule reordering :premises (t140))
% 73.40/73.63 (step t142 (cl (not (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2))) (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2)) :rule or_pos)
% 73.40/73.63 (step t143 (cl (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2) (not (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2)))) :rule reordering :premises (t142))
% 73.40/73.63 (step t144 (cl (not (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2))) (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2)) :rule or_pos)
% 73.40/73.63 (step t145 (cl (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2) (not (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2)))) :rule reordering :premises (t144))
% 73.40/73.63 (step t146 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t147)
% 73.40/73.63 (assume t147.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))))
% 73.40/73.63 (step t147.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2)))) :rule forall_inst :args ((:= X tptp.c2) (:= Y tptp.r1) (:= Z tptp.n0)))
% 73.40/73.63 (step t147.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2))) :rule or :premises (t147.t1))
% 73.40/73.63 (step t147.t3 (cl (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2))) :rule resolution :premises (t147.t2 t147.a0))
% 73.40/73.63 (step t147 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2))) :rule subproof :discharge (t147.a0))
% 73.40/73.63 (step t148 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2))) :rule resolution :premises (t146 t147))
% 73.40/73.63 (step t149 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2))) (not (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2)))) :rule implies_neg2)
% 73.40/73.63 (step t150 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2)))) :rule resolution :premises (t148 t149))
% 73.40/73.63 (step t151 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2)))) :rule contraction :premises (t150))
% 73.40/73.63 (step t152 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2))) :rule implies :premises (t151))
% 73.40/73.63 (step t153 (cl (or (not (tptp.meet tptp.c2 tptp.r1 tptp.n0)) (tptp.join tptp.c2 tptp.n0 tptp.c2))) :rule resolution :premises (t152 a8))
% 73.40/73.63 (step t154 (cl (tptp.join tptp.c2 tptp.n0 tptp.c2)) :rule resolution :premises (t145 a32 t153))
% 73.40/73.63 (step t155 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t156)
% 73.40/73.63 (assume t156.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))))
% 73.40/73.63 (step t156.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2)))) :rule forall_inst :args ((:= X tptp.c2) (:= Y tptp.n0) (:= Z tptp.c2)))
% 73.40/73.63 (step t156.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2))) :rule or :premises (t156.t1))
% 73.40/73.63 (step t156.t3 (cl (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2))) :rule resolution :premises (t156.t2 t156.a0))
% 73.40/73.63 (step t156 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2))) :rule subproof :discharge (t156.a0))
% 73.40/73.63 (step t157 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2))) (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2))) :rule resolution :premises (t155 t156))
% 73.40/73.63 (step t158 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2))) (not (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2)))) :rule implies_neg2)
% 73.40/73.63 (step t159 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2)))) :rule resolution :premises (t157 t158))
% 73.40/73.63 (step t160 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2)))) :rule contraction :premises (t159))
% 73.40/73.63 (step t161 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2))) :rule implies :premises (t160))
% 73.40/73.63 (step t162 (cl (or (not (tptp.join tptp.c2 tptp.n0 tptp.c2)) (tptp.join tptp.n0 tptp.c2 tptp.c2))) :rule resolution :premises (t161 a7))
% 73.40/73.63 (step t163 (cl (tptp.join tptp.n0 tptp.c2 tptp.c2)) :rule resolution :premises (t143 t154 t162))
% 73.40/73.63 (step t164 (cl (not (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e))) (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e)) :rule or_pos)
% 73.40/73.63 (step t165 (cl (not (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e))) (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e)) :rule contraction :premises (t164))
% 73.40/73.63 (step t166 (cl (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (tptp.join tptp.n0 tptp.e tptp.e) (not (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e)))) :rule reordering :premises (t165))
% 73.40/73.63 (step t167 (cl (not (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e))) (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e)) :rule or_pos)
% 73.40/73.63 (step t168 (cl (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e) (not (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e)))) :rule reordering :premises (t167))
% 73.40/73.63 (step t169 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t170)
% 73.40/73.63 (assume t170.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))))
% 73.40/73.63 (step t170.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e)))) :rule forall_inst :args ((:= X tptp.r2) (:= Y tptp.b) (:= Z tptp.e)))
% 73.40/73.63 (step t170.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e))) :rule or :premises (t170.t1))
% 73.40/73.63 (step t170.t3 (cl (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e))) :rule resolution :premises (t170.t2 t170.a0))
% 73.40/73.63 (step t170 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e))) :rule subproof :discharge (t170.a0))
% 73.40/73.63 (step t171 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e))) :rule resolution :premises (t169 t170))
% 73.40/73.63 (step t172 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e))) (not (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e)))) :rule implies_neg2)
% 73.40/73.63 (step t173 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e)))) :rule resolution :premises (t171 t172))
% 73.40/73.63 (step t174 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e)))) :rule contraction :premises (t173))
% 73.40/73.63 (step t175 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e))) :rule implies :premises (t174))
% 73.40/73.63 (step t176 (cl (or (not (tptp.meet tptp.r2 tptp.b tptp.e)) (tptp.meet tptp.b tptp.r2 tptp.e))) :rule resolution :premises (t175 a6))
% 73.40/73.63 (step t177 (cl (tptp.meet tptp.b tptp.r2 tptp.e)) :rule resolution :premises (t168 a29 t176))
% 73.40/73.63 (step t178 (cl (not (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2))) (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2)) :rule or_pos)
% 73.40/73.63 (step t179 (cl (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2) (not (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2)))) :rule reordering :premises (t178))
% 73.40/73.63 (step t180 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t181)
% 73.40/73.63 (assume t181.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))))
% 73.40/73.63 (step t181.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2)))) :rule forall_inst :args ((:= X tptp.r2) (:= Y tptp.c) (:= Z tptp.n0)))
% 73.40/73.63 (step t181.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2))) :rule or :premises (t181.t1))
% 73.40/73.63 (step t181.t3 (cl (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2))) :rule resolution :premises (t181.t2 t181.a0))
% 73.40/73.63 (step t181 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2))) :rule subproof :discharge (t181.a0))
% 73.40/73.63 (step t182 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2))) (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2))) :rule resolution :premises (t180 t181))
% 73.40/73.63 (step t183 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2))) (not (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2)))) :rule implies_neg2)
% 73.40/73.63 (step t184 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2)))) :rule resolution :premises (t182 t183))
% 73.40/73.63 (step t185 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2)))) :rule contraction :premises (t184))
% 73.40/73.63 (step t186 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2))) :rule implies :premises (t185))
% 73.40/73.63 (step t187 (cl (or (not (tptp.meet tptp.r2 tptp.c tptp.n0)) (tptp.join tptp.r2 tptp.n0 tptp.r2))) :rule resolution :premises (t186 a8))
% 73.40/73.63 (step t188 (cl (tptp.join tptp.r2 tptp.n0 tptp.r2)) :rule resolution :premises (t179 t121 t187))
% 73.40/73.63 (step t189 (cl (not (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0))) (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0)) :rule or_pos)
% 73.40/73.63 (step t190 (cl (not (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0))) (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0)) :rule contraction :premises (t189))
% 73.40/73.63 (step t191 (cl (tptp.meet tptp.b tptp.n0 tptp.n0) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.b tptp.b)) (not (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0)))) :rule reordering :premises (t190))
% 73.40/73.63 (step t192 (cl (not (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0))) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0)) :rule or_pos)
% 73.40/73.63 (step t193 (cl (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (tptp.meet tptp.b tptp.d tptp.n0) (not (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0)))) :rule reordering :premises (t192))
% 73.40/73.63 (step t194 (cl (not (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d))) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d)) :rule or_pos)
% 73.40/73.63 (step t195 (cl (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d) (not (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d)))) :rule reordering :premises (t194))
% 73.40/73.63 (step t196 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t197)
% 73.40/73.63 (assume t197.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))))
% 73.40/73.63 (step t197.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d)))) :rule forall_inst :args ((:= X tptp.r2) (:= Y tptp.a) (:= Z tptp.d)))
% 73.40/73.63 (step t197.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d))) :rule or :premises (t197.t1))
% 73.40/73.63 (step t197.t3 (cl (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d))) :rule resolution :premises (t197.t2 t197.a0))
% 73.40/73.63 (step t197 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d))) :rule subproof :discharge (t197.a0))
% 73.40/73.63 (step t198 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d))) :rule resolution :premises (t196 t197))
% 73.40/73.63 (step t199 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d))) (not (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d)))) :rule implies_neg2)
% 73.40/73.63 (step t200 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d)))) :rule resolution :premises (t198 t199))
% 73.40/73.63 (step t201 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d)))) :rule contraction :premises (t200))
% 73.40/73.63 (step t202 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d))) :rule implies :premises (t201))
% 73.40/73.63 (step t203 (cl (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.meet tptp.a tptp.r2 tptp.d))) :rule resolution :premises (t202 a6))
% 73.40/73.63 (step t204 (cl (tptp.meet tptp.a tptp.r2 tptp.d)) :rule resolution :premises (t195 a33 t203))
% 73.40/73.63 (step t205 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0))) (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t206)
% 73.40/73.63 (assume t206.a0 (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))))
% 73.40/73.63 (step t206.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0)))) :rule forall_inst :args ((:= X tptp.b) (:= Y tptp.a) (:= Xy tptp.c) (:= Z tptp.r2) (:= Yz tptp.d) (:= Xyz tptp.n0)))
% 73.40/73.63 (step t206.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0))) :rule or :premises (t206.t1))
% 73.40/73.63 (step t206.t3 (cl (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0))) :rule resolution :premises (t206.t2 t206.a0))
% 73.40/73.63 (step t206 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0))) :rule subproof :discharge (t206.a0))
% 73.40/73.63 (step t207 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0))) :rule resolution :premises (t205 t206))
% 73.40/73.63 (step t208 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0))) (not (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0)))) :rule implies_neg2)
% 73.40/73.63 (step t209 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0)))) :rule resolution :premises (t207 t208))
% 73.40/73.63 (step t210 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0)))) :rule contraction :premises (t209))
% 73.40/73.63 (step t211 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0))) :rule implies :premises (t210))
% 73.40/73.63 (step t212 (cl (or (not (tptp.meet tptp.b tptp.a tptp.c)) (not (tptp.meet tptp.a tptp.r2 tptp.d)) (not (tptp.meet tptp.c tptp.r2 tptp.n0)) (tptp.meet tptp.b tptp.d tptp.n0))) :rule resolution :premises (t211 a11))
% 73.40/73.63 (step t213 (cl (tptp.meet tptp.b tptp.d tptp.n0)) :rule resolution :premises (t193 a28 t110 t204 t212))
% 73.40/73.63 (step t214 (cl (not (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b))) (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b)) :rule or_pos)
% 73.40/73.63 (step t215 (cl (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b) (not (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b)))) :rule reordering :premises (t214))
% 73.40/73.63 (step t216 (cl (not (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b))) (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b)) :rule or_pos)
% 73.40/73.63 (step t217 (cl (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b) (not (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b)))) :rule reordering :premises (t216))
% 73.40/73.63 (step t218 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t219)
% 73.40/73.63 (assume t219.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))))
% 73.40/73.63 (step t219.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b)))) :rule forall_inst :args ((:= X tptp.b) (:= Y tptp.a) (:= Z tptp.c)))
% 73.40/73.63 (step t219.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b))) :rule or :premises (t219.t1))
% 73.40/73.63 (step t219.t3 (cl (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b))) :rule resolution :premises (t219.t2 t219.a0))
% 73.40/73.63 (step t219 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b))) :rule subproof :discharge (t219.a0))
% 73.40/73.63 (step t220 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b))) :rule resolution :premises (t218 t219))
% 73.40/73.63 (step t221 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b))) (not (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b)))) :rule implies_neg2)
% 73.40/73.63 (step t222 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b)))) :rule resolution :premises (t220 t221))
% 73.40/73.63 (step t223 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b)))) :rule contraction :premises (t222))
% 73.40/73.63 (step t224 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b))) :rule implies :premises (t223))
% 73.40/73.63 (step t225 (cl (or (not (tptp.meet tptp.b tptp.a tptp.c)) (tptp.join tptp.b tptp.c tptp.b))) :rule resolution :premises (t224 a8))
% 73.40/73.63 (step t226 (cl (tptp.join tptp.b tptp.c tptp.b)) :rule resolution :premises (t217 t110 t225))
% 73.40/73.63 (step t227 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t228)
% 73.40/73.63 (assume t228.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))))
% 73.40/73.63 (step t228.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b)))) :rule forall_inst :args ((:= X tptp.b) (:= Y tptp.c) (:= Z tptp.b)))
% 73.40/73.63 (step t228.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b))) :rule or :premises (t228.t1))
% 73.40/73.63 (step t228.t3 (cl (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b))) :rule resolution :premises (t228.t2 t228.a0))
% 73.40/73.63 (step t228 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b))) :rule subproof :discharge (t228.a0))
% 73.40/73.63 (step t229 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b))) (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b))) :rule resolution :premises (t227 t228))
% 73.40/73.63 (step t230 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b))) (not (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b)))) :rule implies_neg2)
% 73.40/73.63 (step t231 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b)))) :rule resolution :premises (t229 t230))
% 73.40/73.63 (step t232 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b)))) :rule contraction :premises (t231))
% 73.40/73.63 (step t233 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b))) :rule implies :premises (t232))
% 73.40/73.63 (step t234 (cl (or (not (tptp.join tptp.b tptp.c tptp.b)) (tptp.meet tptp.b tptp.b tptp.b))) :rule resolution :premises (t233 a9))
% 73.40/73.63 (step t235 (cl (tptp.meet tptp.b tptp.b tptp.b)) :rule resolution :premises (t215 t226 t234))
% 73.40/73.63 (step t236 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0))) (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t237)
% 73.40/73.63 (assume t237.a0 (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))))
% 73.40/73.63 (step t237.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0)))) :rule forall_inst :args ((:= X tptp.b) (:= Y tptp.b) (:= Xy tptp.b) (:= Z tptp.d) (:= Yz tptp.n0) (:= Xyz tptp.n0)))
% 73.40/73.63 (step t237.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0))) :rule or :premises (t237.t1))
% 73.40/73.63 (step t237.t3 (cl (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0))) :rule resolution :premises (t237.t2 t237.a0))
% 73.40/73.63 (step t237 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0))) :rule subproof :discharge (t237.a0))
% 73.40/73.63 (step t238 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0))) (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0))) :rule resolution :premises (t236 t237))
% 73.40/73.63 (step t239 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0))) (not (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0)))) :rule implies_neg2)
% 73.40/73.63 (step t240 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0)))) :rule resolution :premises (t238 t239))
% 73.40/73.63 (step t241 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0)))) :rule contraction :premises (t240))
% 73.40/73.63 (step t242 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0))) :rule implies :premises (t241))
% 73.40/73.63 (step t243 (cl (or (not (tptp.meet tptp.b tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.b tptp.n0 tptp.n0))) :rule resolution :premises (t242 a11))
% 73.40/73.63 (step t244 (cl (tptp.meet tptp.b tptp.n0 tptp.n0)) :rule resolution :premises (t191 t213 t235 t243))
% 73.40/73.63 (step t245 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1))) (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t246)
% 73.40/73.63 (assume t246.a0 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1))))
% 73.40/73.63 (step t246.t1 (cl (or (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1)))) (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e)))) :rule forall_inst :args ((:= X tptp.b) (:= Z tptp.n0) (:= Y tptp.r2) (:= Y1 tptp.r2) (:= X1 tptp.e) (:= Z1 tptp.e)))
% 73.40/73.63 (step t246.t2 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1)))) (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e))) :rule or :premises (t246.t1))
% 73.40/73.63 (step t246.t3 (cl (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e))) :rule resolution :premises (t246.t2 t246.a0))
% 73.40/73.63 (step t246 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1)))) (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e))) :rule subproof :discharge (t246.a0))
% 73.40/73.63 (step t247 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1))) (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e))) (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e))) :rule resolution :premises (t245 t246))
% 73.40/73.63 (step t248 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1))) (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e))) (not (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e)))) :rule implies_neg2)
% 73.40/73.63 (step t249 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1))) (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1))) (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e)))) :rule resolution :premises (t247 t248))
% 73.40/73.63 (step t250 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1))) (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e)))) :rule contraction :premises (t249))
% 73.40/73.63 (step t251 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (Y1 $$unsorted) (X1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z Z)) (not (tptp.join Y Z Y1)) (not (tptp.meet X Y X1)) (not (tptp.meet X Y1 Z1)) (tptp.join Z X1 Z1)))) (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e))) :rule implies :premises (t250))
% 73.40/73.63 (step t252 (cl (or (not (tptp.meet tptp.b tptp.n0 tptp.n0)) (not (tptp.join tptp.r2 tptp.n0 tptp.r2)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.join tptp.n0 tptp.e tptp.e))) :rule resolution :premises (t251 a24))
% 73.40/73.63 (step t253 (cl (tptp.join tptp.n0 tptp.e tptp.e)) :rule resolution :premises (t166 t177 t188 t244 t252))
% 73.40/73.63 (step t254 (cl (not (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0))) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0)) :rule or_pos)
% 73.40/73.63 (step t255 (cl (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0) (not (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0)))) :rule reordering :premises (t254))
% 73.40/73.63 (step t256 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t257)
% 73.40/73.63 (assume t257.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))))
% 73.40/73.63 (step t257.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0)))) :rule forall_inst :args ((:= X tptp.n0) (:= Y tptp.e) (:= Z tptp.e)))
% 73.40/73.63 (step t257.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0))) :rule or :premises (t257.t1))
% 73.40/73.63 (step t257.t3 (cl (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0))) :rule resolution :premises (t257.t2 t257.a0))
% 73.40/73.63 (step t257 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0))) :rule subproof :discharge (t257.a0))
% 73.40/73.63 (step t258 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0))) (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0))) :rule resolution :premises (t256 t257))
% 73.40/73.63 (step t259 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0))) (not (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0)))) :rule implies_neg2)
% 73.40/73.63 (step t260 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0)))) :rule resolution :premises (t258 t259))
% 73.40/73.63 (step t261 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0)))) :rule contraction :premises (t260))
% 73.40/73.63 (step t262 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0))) :rule implies :premises (t261))
% 73.40/73.63 (step t263 (cl (or (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.n0 tptp.e tptp.n0))) :rule resolution :premises (t262 a9))
% 73.40/73.63 (step t264 (cl (tptp.meet tptp.n0 tptp.e tptp.n0)) :rule resolution :premises (t255 t253 t263))
% 73.40/73.63 (step t265 (cl (not (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e))) (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e)) :rule or_pos)
% 73.40/73.63 (step t266 (cl (not (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e))) (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e)) :rule contraction :premises (t265))
% 73.40/73.63 (step t267 (cl (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.c2 tptp.b tptp.b)) (tptp.meet tptp.c2 tptp.e tptp.e) (not (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e)))) :rule reordering :premises (t266))
% 73.40/73.63 (step t268 (cl (not (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b))) (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b)) :rule or_pos)
% 73.40/73.63 (step t269 (cl (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b) (not (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b)))) :rule reordering :premises (t268))
% 73.40/73.63 (step t270 (cl (not (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b))) (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b)) :rule or_pos)
% 73.40/73.63 (step t271 (cl (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b) (not (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b)))) :rule reordering :premises (t270))
% 73.40/73.63 (step t272 (cl (not (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2))) (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2)) :rule or_pos)
% 73.40/73.63 (step t273 (cl (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2) (not (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2)))) :rule reordering :premises (t272))
% 73.40/73.63 (step t274 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t275)
% 73.40/73.63 (assume t275.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))))
% 73.40/73.63 (step t275.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2)))) :rule forall_inst :args ((:= X tptp.a) (:= Y tptp.b) (:= Z tptp.c2)))
% 73.40/73.63 (step t275.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2))) :rule or :premises (t275.t1))
% 73.40/73.63 (step t275.t3 (cl (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2))) :rule resolution :premises (t275.t2 t275.a0))
% 73.40/73.63 (step t275 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2))) :rule subproof :discharge (t275.a0))
% 73.40/73.63 (step t276 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2))) :rule resolution :premises (t274 t275))
% 73.40/73.63 (step t277 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2))) (not (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2)))) :rule implies_neg2)
% 73.40/73.63 (step t278 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2)))) :rule resolution :premises (t276 t277))
% 73.40/73.63 (step t279 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2)))) :rule contraction :premises (t278))
% 73.40/73.63 (step t280 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2))) :rule implies :premises (t279))
% 73.40/73.63 (step t281 (cl (or (not (tptp.join tptp.a tptp.b tptp.c2)) (tptp.join tptp.b tptp.a tptp.c2))) :rule resolution :premises (t280 a7))
% 73.40/73.63 (step t282 (cl (tptp.join tptp.b tptp.a tptp.c2)) :rule resolution :premises (t273 a30 t281))
% 73.40/73.63 (step t283 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t284)
% 73.40/73.63 (assume t284.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))))
% 73.40/73.63 (step t284.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b)))) :rule forall_inst :args ((:= X tptp.b) (:= Y tptp.a) (:= Z tptp.c2)))
% 73.40/73.63 (step t284.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b))) :rule or :premises (t284.t1))
% 73.40/73.63 (step t284.t3 (cl (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b))) :rule resolution :premises (t284.t2 t284.a0))
% 73.40/73.63 (step t284 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b))) :rule subproof :discharge (t284.a0))
% 73.40/73.63 (step t285 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b))) (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b))) :rule resolution :premises (t283 t284))
% 73.40/73.63 (step t286 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b))) (not (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b)))) :rule implies_neg2)
% 73.40/73.63 (step t287 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b)))) :rule resolution :premises (t285 t286))
% 73.40/73.63 (step t288 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b)))) :rule contraction :premises (t287))
% 73.40/73.63 (step t289 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b))) :rule implies :premises (t288))
% 73.40/73.63 (step t290 (cl (or (not (tptp.join tptp.b tptp.a tptp.c2)) (tptp.meet tptp.b tptp.c2 tptp.b))) :rule resolution :premises (t289 a9))
% 73.40/73.63 (step t291 (cl (tptp.meet tptp.b tptp.c2 tptp.b)) :rule resolution :premises (t271 t282 t290))
% 73.40/73.63 (step t292 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t293)
% 73.40/73.63 (assume t293.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))))
% 73.40/73.63 (step t293.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b)))) :rule forall_inst :args ((:= X tptp.b) (:= Y tptp.c2) (:= Z tptp.b)))
% 73.40/73.63 (step t293.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b))) :rule or :premises (t293.t1))
% 73.40/73.63 (step t293.t3 (cl (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b))) :rule resolution :premises (t293.t2 t293.a0))
% 73.40/73.63 (step t293 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b))) :rule subproof :discharge (t293.a0))
% 73.40/73.63 (step t294 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b))) (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b))) :rule resolution :premises (t292 t293))
% 73.40/73.63 (step t295 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b))) (not (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b)))) :rule implies_neg2)
% 73.40/73.63 (step t296 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b)))) :rule resolution :premises (t294 t295))
% 73.40/73.63 (step t297 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b)))) :rule contraction :premises (t296))
% 73.40/73.63 (step t298 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b))) :rule implies :premises (t297))
% 73.40/73.63 (step t299 (cl (or (not (tptp.meet tptp.b tptp.c2 tptp.b)) (tptp.meet tptp.c2 tptp.b tptp.b))) :rule resolution :premises (t298 a6))
% 73.40/73.63 (step t300 (cl (tptp.meet tptp.c2 tptp.b tptp.b)) :rule resolution :premises (t269 t291 t299))
% 73.40/73.63 (step t301 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e))) (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t302)
% 73.40/73.63 (assume t302.a0 (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))))
% 73.40/73.63 (step t302.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e)))) :rule forall_inst :args ((:= X tptp.c2) (:= Y tptp.b) (:= Xy tptp.b) (:= Z tptp.r2) (:= Yz tptp.e) (:= Xyz tptp.e)))
% 73.40/73.63 (step t302.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e))) :rule or :premises (t302.t1))
% 73.40/73.63 (step t302.t3 (cl (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e))) :rule resolution :premises (t302.t2 t302.a0))
% 73.40/73.63 (step t302 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e))) :rule subproof :discharge (t302.a0))
% 73.40/73.63 (step t303 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e))) (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e))) :rule resolution :premises (t301 t302))
% 73.40/73.63 (step t304 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e))) (not (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e)))) :rule implies_neg2)
% 73.40/73.63 (step t305 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e)))) :rule resolution :premises (t303 t304))
% 73.40/73.63 (step t306 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e)))) :rule contraction :premises (t305))
% 73.40/73.63 (step t307 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e))) :rule implies :premises (t306))
% 73.40/73.63 (step t308 (cl (or (not (tptp.meet tptp.c2 tptp.b tptp.b)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (tptp.meet tptp.c2 tptp.e tptp.e))) :rule resolution :premises (t307 a11))
% 73.40/73.63 (step t309 (cl (tptp.meet tptp.c2 tptp.e tptp.e)) :rule resolution :premises (t267 t177 t300 t308))
% 73.40/73.63 (step t310 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t311)
% 73.40/73.63 (assume t311.a0 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))))
% 73.40/73.63 (step t311.t1 (cl (or (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e)))) :rule forall_inst :args ((:= X tptp.n0) (:= Z tptp.e) (:= Y tptp.c2) (:= X1 tptp.c2) (:= Y1 tptp.e) (:= Z1 tptp.e)))
% 73.40/73.63 (step t311.t2 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e))) :rule or :premises (t311.t1))
% 73.40/73.63 (step t311.t3 (cl (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e))) :rule resolution :premises (t311.t2 t311.a0))
% 73.40/73.63 (step t311 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e))) :rule subproof :discharge (t311.a0))
% 73.40/73.63 (step t312 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e))) (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e))) :rule resolution :premises (t310 t311))
% 73.40/73.63 (step t313 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e))) (not (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e)))) :rule implies_neg2)
% 73.40/73.63 (step t314 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e)))) :rule resolution :premises (t312 t313))
% 73.40/73.63 (step t315 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e)))) :rule contraction :premises (t314))
% 73.40/73.63 (step t316 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e))) :rule implies :premises (t315))
% 73.40/73.63 (step t317 (cl (or (not (tptp.meet tptp.n0 tptp.e tptp.n0)) (not (tptp.join tptp.n0 tptp.c2 tptp.c2)) (not (tptp.meet tptp.c2 tptp.e tptp.e)) (not (tptp.join tptp.n0 tptp.e tptp.e)) (tptp.meet tptp.e tptp.c2 tptp.e))) :rule resolution :premises (t316 a15))
% 73.40/73.63 (step t318 (cl (tptp.meet tptp.e tptp.c2 tptp.e)) :rule resolution :premises (t141 t163 t253 t264 t309 t317))
% 73.40/73.63 (step t319 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t320)
% 73.40/73.63 (assume t320.a0 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))))
% 73.40/73.63 (step t320.t1 (cl (or (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e)))) :rule forall_inst :args ((:= X tptp.e) (:= Z tptp.c2) (:= Y tptp.r1) (:= X1 tptp.a2) (:= Y1 tptp.n0) (:= Z1 tptp.e)))
% 73.40/73.63 (step t320.t2 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e))) :rule or :premises (t320.t1))
% 73.40/73.63 (step t320.t3 (cl (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e))) :rule resolution :premises (t320.t2 t320.a0))
% 73.40/73.63 (step t320 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e))) :rule subproof :discharge (t320.a0))
% 73.40/73.63 (step t321 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e))) (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e))) :rule resolution :premises (t319 t320))
% 73.40/73.63 (step t322 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e))) (not (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e)))) :rule implies_neg2)
% 73.40/73.63 (step t323 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e)))) :rule resolution :premises (t321 t322))
% 73.40/73.63 (step t324 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1))) (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e)))) :rule contraction :premises (t323))
% 73.40/73.63 (step t325 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z1 $$unsorted)) (or (not (tptp.meet X Z X)) (not (tptp.join X Y X1)) (not (tptp.meet Y Z Y1)) (not (tptp.join X Y1 Z1)) (tptp.meet Z X1 Z1)))) (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e))) :rule implies :premises (t324))
% 73.40/73.63 (step t326 (cl (or (not (tptp.meet tptp.e tptp.c2 tptp.e)) (not (tptp.join tptp.e tptp.r1 tptp.a2)) (not (tptp.meet tptp.r1 tptp.c2 tptp.n0)) (not (tptp.join tptp.e tptp.n0 tptp.e)) (tptp.meet tptp.c2 tptp.a2 tptp.e))) :rule resolution :premises (t325 a15))
% 73.40/73.63 (step t327 (cl (tptp.meet tptp.c2 tptp.a2 tptp.e)) :rule resolution :premises (t84 t33 t95 t139 t318 t326))
% 73.40/73.63 (step t328 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t329)
% 73.40/73.63 (assume t329.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))))
% 73.40/73.63 (step t329.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e)))) :rule forall_inst :args ((:= X tptp.c2) (:= Y tptp.a2) (:= Z tptp.e)))
% 73.40/73.63 (step t329.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e))) :rule or :premises (t329.t1))
% 73.40/73.63 (step t329.t3 (cl (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e))) :rule resolution :premises (t329.t2 t329.a0))
% 73.40/73.63 (step t329 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e))) :rule subproof :discharge (t329.a0))
% 73.40/73.63 (step t330 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e))) (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e))) :rule resolution :premises (t328 t329))
% 73.40/73.63 (step t331 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e))) (not (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e)))) :rule implies_neg2)
% 73.40/73.63 (step t332 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e)))) :rule resolution :premises (t330 t331))
% 73.40/73.63 (step t333 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e)))) :rule contraction :premises (t332))
% 73.40/73.63 (step t334 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e))) :rule implies :premises (t333))
% 73.40/73.63 (step t335 (cl (or (not (tptp.meet tptp.c2 tptp.a2 tptp.e)) (tptp.meet tptp.a2 tptp.c2 tptp.e))) :rule resolution :premises (t334 a6))
% 73.40/73.63 (step t336 (cl (tptp.meet tptp.a2 tptp.c2 tptp.e)) :rule resolution :premises (t82 t327 t335))
% 73.40/73.63 (step t337 (cl (not (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0))) (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0)) :rule or_pos)
% 73.40/73.63 (step t338 (cl (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (tptp.meet tptp.e tptp.d tptp.n0) (not (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0)))) :rule reordering :premises (t337))
% 73.40/73.63 (step t339 (cl (not (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d))) (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d)) :rule or_pos)
% 73.40/73.63 (step t340 (cl (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d) (not (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d)))) :rule reordering :premises (t339))
% 73.40/73.63 (step t341 (cl (not (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d))) (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d)) :rule or_pos)
% 73.40/73.63 (step t342 (cl (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d) (not (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d)))) :rule reordering :premises (t341))
% 73.40/73.63 (step t343 (cl (not (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2))) (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2)) :rule or_pos)
% 73.40/73.63 (step t344 (cl (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2) (not (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2)))) :rule reordering :premises (t343))
% 73.40/73.63 (step t345 (cl (not (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2))) (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2)) :rule or_pos)
% 73.40/73.63 (step t346 (cl (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2) (not (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2)))) :rule reordering :premises (t345))
% 73.40/73.63 (step t347 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t348)
% 73.40/73.63 (assume t348.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))))
% 73.40/73.63 (step t348.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2)))) :rule forall_inst :args ((:= X tptp.r2) (:= Y tptp.a) (:= Z tptp.d)))
% 73.40/73.63 (step t348.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2))) :rule or :premises (t348.t1))
% 73.40/73.63 (step t348.t3 (cl (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2))) :rule resolution :premises (t348.t2 t348.a0))
% 73.40/73.63 (step t348 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2))) :rule subproof :discharge (t348.a0))
% 73.40/73.63 (step t349 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2))) :rule resolution :premises (t347 t348))
% 73.40/73.63 (step t350 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2))) (not (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2)))) :rule implies_neg2)
% 73.40/73.63 (step t351 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2)))) :rule resolution :premises (t349 t350))
% 73.40/73.63 (step t352 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2)))) :rule contraction :premises (t351))
% 73.40/73.63 (step t353 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.join X Z X)))) (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2))) :rule implies :premises (t352))
% 73.40/73.63 (step t354 (cl (or (not (tptp.meet tptp.r2 tptp.a tptp.d)) (tptp.join tptp.r2 tptp.d tptp.r2))) :rule resolution :premises (t353 a8))
% 73.40/73.63 (step t355 (cl (tptp.join tptp.r2 tptp.d tptp.r2)) :rule resolution :premises (t346 a33 t354))
% 73.40/73.63 (step t356 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t357)
% 73.40/73.63 (assume t357.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))))
% 73.40/73.63 (step t357.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2)))) :rule forall_inst :args ((:= X tptp.r2) (:= Y tptp.d) (:= Z tptp.r2)))
% 73.40/73.63 (step t357.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2))) :rule or :premises (t357.t1))
% 73.40/73.63 (step t357.t3 (cl (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2))) :rule resolution :premises (t357.t2 t357.a0))
% 73.40/73.63 (step t357 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2))) :rule subproof :discharge (t357.a0))
% 73.40/73.63 (step t358 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2))) (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2))) :rule resolution :premises (t356 t357))
% 73.40/73.63 (step t359 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2))) (not (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2)))) :rule implies_neg2)
% 73.40/73.63 (step t360 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2)))) :rule resolution :premises (t358 t359))
% 73.40/73.63 (step t361 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z))) (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2)))) :rule contraction :premises (t360))
% 73.40/73.63 (step t362 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.join Y X Z)))) (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2))) :rule implies :premises (t361))
% 73.40/73.63 (step t363 (cl (or (not (tptp.join tptp.r2 tptp.d tptp.r2)) (tptp.join tptp.d tptp.r2 tptp.r2))) :rule resolution :premises (t362 a7))
% 73.40/73.63 (step t364 (cl (tptp.join tptp.d tptp.r2 tptp.r2)) :rule resolution :premises (t344 t355 t363))
% 73.40/73.63 (step t365 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t366)
% 73.40/73.63 (assume t366.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))))
% 73.40/73.63 (step t366.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d)))) :rule forall_inst :args ((:= X tptp.d) (:= Y tptp.r2) (:= Z tptp.r2)))
% 73.40/73.63 (step t366.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d))) :rule or :premises (t366.t1))
% 73.40/73.63 (step t366.t3 (cl (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d))) :rule resolution :premises (t366.t2 t366.a0))
% 73.40/73.63 (step t366 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d))) :rule subproof :discharge (t366.a0))
% 73.40/73.63 (step t367 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d))) (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d))) :rule resolution :premises (t365 t366))
% 73.40/73.63 (step t368 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d))) (not (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d)))) :rule implies_neg2)
% 73.40/73.63 (step t369 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d)))) :rule resolution :premises (t367 t368))
% 73.40/73.63 (step t370 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X))) (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d)))) :rule contraction :premises (t369))
% 73.40/73.63 (step t371 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.join X Y Z)) (tptp.meet X Z X)))) (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d))) :rule implies :premises (t370))
% 73.40/73.63 (step t372 (cl (or (not (tptp.join tptp.d tptp.r2 tptp.r2)) (tptp.meet tptp.d tptp.r2 tptp.d))) :rule resolution :premises (t371 a9))
% 73.40/73.63 (step t373 (cl (tptp.meet tptp.d tptp.r2 tptp.d)) :rule resolution :premises (t342 t364 t372))
% 73.40/73.63 (step t374 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t375)
% 73.40/73.63 (assume t375.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))))
% 73.40/73.63 (step t375.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d)))) :rule forall_inst :args ((:= X tptp.d) (:= Y tptp.r2) (:= Z tptp.d)))
% 73.40/73.63 (step t375.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d))) :rule or :premises (t375.t1))
% 73.40/73.63 (step t375.t3 (cl (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d))) :rule resolution :premises (t375.t2 t375.a0))
% 73.40/73.63 (step t375 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d))) :rule subproof :discharge (t375.a0))
% 73.40/73.63 (step t376 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d))) (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d))) :rule resolution :premises (t374 t375))
% 73.40/73.63 (step t377 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d))) (not (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d)))) :rule implies_neg2)
% 73.40/73.63 (step t378 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d)))) :rule resolution :premises (t376 t377))
% 73.40/73.63 (step t379 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d)))) :rule contraction :premises (t378))
% 73.40/73.63 (step t380 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d))) :rule implies :premises (t379))
% 73.40/73.63 (step t381 (cl (or (not (tptp.meet tptp.d tptp.r2 tptp.d)) (tptp.meet tptp.r2 tptp.d tptp.d))) :rule resolution :premises (t380 a6))
% 73.40/73.63 (step t382 (cl (tptp.meet tptp.r2 tptp.d tptp.d)) :rule resolution :premises (t340 t373 t381))
% 73.40/73.63 (step t383 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0))) (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t384)
% 73.40/73.63 (assume t384.a0 (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))))
% 73.40/73.63 (step t384.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0)))) :rule forall_inst :args ((:= X tptp.b) (:= Y tptp.r2) (:= Xy tptp.e) (:= Z tptp.d) (:= Yz tptp.d) (:= Xyz tptp.n0)))
% 73.40/73.63 (step t384.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0))) :rule or :premises (t384.t1))
% 73.40/73.63 (step t384.t3 (cl (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0))) :rule resolution :premises (t384.t2 t384.a0))
% 73.40/73.63 (step t384 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0))) :rule subproof :discharge (t384.a0))
% 73.40/73.63 (step t385 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0))) (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0))) :rule resolution :premises (t383 t384))
% 73.40/73.63 (step t386 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0))) (not (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0)))) :rule implies_neg2)
% 73.40/73.63 (step t387 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0)))) :rule resolution :premises (t385 t386))
% 73.40/73.63 (step t388 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz))) (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0)))) :rule contraction :premises (t387))
% 73.40/73.63 (step t389 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet X Yz Xyz)) (tptp.meet Xy Z Xyz)))) (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0))) :rule implies :premises (t388))
% 73.40/73.63 (step t390 (cl (or (not (tptp.meet tptp.b tptp.r2 tptp.e)) (not (tptp.meet tptp.r2 tptp.d tptp.d)) (not (tptp.meet tptp.b tptp.d tptp.n0)) (tptp.meet tptp.e tptp.d tptp.n0))) :rule resolution :premises (t389 a10))
% 73.40/73.63 (step t391 (cl (tptp.meet tptp.e tptp.d tptp.n0)) :rule resolution :premises (t338 t177 t213 t382 t390))
% 73.40/73.63 (step t392 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0))) (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t393)
% 73.40/73.63 (assume t393.a0 (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))))
% 73.40/73.63 (step t393.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0)))) :rule forall_inst :args ((:= X tptp.a2) (:= Y tptp.c2) (:= Xy tptp.e) (:= Z tptp.d) (:= Yz tptp.d) (:= Xyz tptp.n0)))
% 73.40/73.63 (step t393.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0))) :rule or :premises (t393.t1))
% 73.40/73.63 (step t393.t3 (cl (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0))) :rule resolution :premises (t393.t2 t393.a0))
% 73.40/73.63 (step t393 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0))) :rule subproof :discharge (t393.a0))
% 73.40/73.63 (step t394 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0))) (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0))) :rule resolution :premises (t392 t393))
% 73.40/73.63 (step t395 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0))) (not (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0)))) :rule implies_neg2)
% 73.40/73.63 (step t396 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0)))) :rule resolution :premises (t394 t395))
% 73.40/73.63 (step t397 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz))) (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0)))) :rule contraction :premises (t396))
% 73.40/73.63 (step t398 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Xy $$unsorted) (Z $$unsorted) (Yz $$unsorted) (Xyz $$unsorted)) (or (not (tptp.meet X Y Xy)) (not (tptp.meet Y Z Yz)) (not (tptp.meet Xy Z Xyz)) (tptp.meet X Yz Xyz)))) (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0))) :rule implies :premises (t397))
% 73.40/73.63 (step t399 (cl (or (not (tptp.meet tptp.a2 tptp.c2 tptp.e)) (not (tptp.meet tptp.c2 tptp.d tptp.d)) (not (tptp.meet tptp.e tptp.d tptp.n0)) (tptp.meet tptp.a2 tptp.d tptp.n0))) :rule resolution :premises (t398 a11))
% 73.40/73.63 (step t400 (cl (tptp.meet tptp.a2 tptp.d tptp.n0)) :rule resolution :premises (t46 t80 t336 t391 t399))
% 73.40/73.63 (step t401 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) :rule implies_neg1)
% 73.40/73.63 (anchor :step t402)
% 73.40/73.63 (assume t402.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))))
% 73.40/73.63 (step t402.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0)))) :rule forall_inst :args ((:= X tptp.a2) (:= Y tptp.d) (:= Z tptp.n0)))
% 73.40/73.63 (step t402.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0))) :rule or :premises (t402.t1))
% 73.40/73.63 (step t402.t3 (cl (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0))) :rule resolution :premises (t402.t2 t402.a0))
% 73.40/73.63 (step t402 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0))) :rule subproof :discharge (t402.a0))
% 73.40/73.63 (step t403 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0))) (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0))) :rule resolution :premises (t401 t402))
% 73.40/73.63 (step t404 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0))) (not (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0)))) :rule implies_neg2)
% 73.40/73.63 (step t405 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0)))) :rule resolution :premises (t403 t404))
% 73.40/73.63 (step t406 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z))) (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0)))) :rule contraction :premises (t405))
% 73.40/73.63 (step t407 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.meet X Y Z)) (tptp.meet Y X Z)))) (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0))) :rule implies :premises (t406))
% 73.40/73.63 (step t408 (cl (or (not (tptp.meet tptp.a2 tptp.d tptp.n0)) (tptp.meet tptp.d tptp.a2 tptp.n0))) :rule resolution :premises (t407 a6))
% 73.40/73.63 (step t409 (cl (tptp.meet tptp.d tptp.a2 tptp.n0)) :rule resolution :premises (t44 t400 t408))
% 73.40/73.63 (step t410 (cl (not (or (not (tptp.meet tptp.r1 tptp.a2 tptp.r1)) (not (tptp.join tptp.r1 tptp.d tptp.b2)) (not (tptp.meet tptp.d tptp.a2 tptp.n0)) (not (tptp.join tptp.r1 tptp.n0 tptp.r1)) (tptp.meet tptp.a2 tptp.b2 tptp.r1)))) :rule resolution :premises (t9 a36 a35 t20 t42 t409))
% 73.40/73.63 (step t411 (cl) :rule resolution :premises (t7 t410 a15))
% 73.40/73.63
% 73.40/73.63 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.Uizb1ZRKbs/cvc5---1.0.5_16143.smt2
% 73.40/73.64 % cvc5---1.0.5 exiting
% 73.40/73.64 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------