%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : MGT005-2 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n020.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:29:14 EDT 2024

% Result   : Unsatisfiable 0.22s 0.57s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : MGT005-2 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n020.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 26 10:29:54 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.22/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.57  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.cg5EfZIy3m/cvc5---1.0.5_19068.smt2
% 0.22/0.57  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.cg5EfZIy3m/cvc5---1.0.5_19068.smt2
% 0.22/0.58  (assume a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.greater A B)) (not (= A B)))))
% 0.22/0.58  (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.greater A B)) (not (tptp.greater B A)))))
% 0.22/0.58  (assume a2 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.greater A B)) (not (tptp.greater B C)) (tptp.greater A C))))
% 0.22/0.58  (assume a3 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.survival_chance A B C)) (not (tptp.survival_chance D E C)) (tptp.greater tptp.p1 tptp.p2) (= tptp.p1 tptp.p2) (tptp.greater tptp.p2 tptp.p1))))
% 0.22/0.58  (assume a4 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A B)) (tptp.survival_chance A (tptp.sk1 B A) B))))
% 0.22/0.58  (assume a5 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))))
% 0.22/0.58  (assume a6 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B))))
% 0.22/0.58  (assume a7 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.reorganization_free A B C)) (not (tptp.survival_chance A D B)) (not (tptp.survival_chance A E C)) (not (tptp.greater C B)) (tptp.greater E D))))
% 0.22/0.58  (assume a8 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.reorganization A D E)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance A G C)) (tptp.greater D B) (not (tptp.greater C B)) (tptp.greater C E) (tptp.greater F G))))
% 0.22/0.58  (assume a9 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F))))
% 0.22/0.58  (assume a10 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J))))
% 0.22/0.58  (assume a11 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (not (tptp.greater A B)) (not (tptp.survival_chance C D B)) (not (tptp.survival_chance E F B)) (not (tptp.survival_chance C G A)) (not (tptp.survival_chance E H A)) (not (tptp.greater G D)) (not (tptp.greater F G)) (tptp.greater (tptp.sk2 A B H F G D E C) B))))
% 0.22/0.58  (assume a12 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (not (tptp.greater A B)) (not (tptp.survival_chance C D B)) (not (tptp.survival_chance E F B)) (not (tptp.survival_chance C G A)) (not (tptp.survival_chance E H A)) (not (tptp.greater G D)) (not (tptp.greater F G)) (tptp.greater A (tptp.sk2 A B H F G D E C)))))
% 0.22/0.58  (assume a13 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (not (tptp.greater A B)) (not (tptp.survival_chance C D B)) (not (tptp.survival_chance E F B)) (not (tptp.survival_chance C G A)) (not (tptp.survival_chance E H A)) (not (tptp.greater G D)) (not (tptp.greater F G)) (tptp.survival_chance C (tptp.sk3 A B H F G D E C) (tptp.sk2 A B H F G D E C)))))
% 0.22/0.58  (assume a14 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (not (tptp.greater A B)) (not (tptp.survival_chance C D B)) (not (tptp.survival_chance E F B)) (not (tptp.survival_chance C G A)) (not (tptp.survival_chance E H A)) (not (tptp.greater G D)) (not (tptp.greater F G)) (tptp.survival_chance E (tptp.sk4 A B H F G D E C) (tptp.sk2 A B H F G D E C)))))
% 0.22/0.58  (assume a15 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (not (tptp.greater A B)) (not (tptp.survival_chance C D B)) (not (tptp.survival_chance E F B)) (not (tptp.survival_chance C G A)) (not (tptp.survival_chance E H A)) (not (tptp.greater G D)) (not (tptp.greater F G)) (= (tptp.sk3 A B H F G D E C) (tptp.sk4 A B H F G D E C)))))
% 0.22/0.58  (assume a16 (tptp.organization tptp.sk5 tptp.sk15))
% 0.22/0.58  (assume a17 (tptp.organization tptp.sk6 tptp.sk15))
% 0.22/0.58  (assume a18 (tptp.organization tptp.sk5 tptp.sk17))
% 0.22/0.58  (assume a19 (tptp.organization tptp.sk6 tptp.sk17))
% 0.22/0.58  (assume a20 (tptp.class tptp.sk5 tptp.sk8 tptp.sk15))
% 0.22/0.58  (assume a21 (tptp.class tptp.sk6 tptp.sk8 tptp.sk15))
% 0.22/0.58  (assume a22 (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15))
% 0.22/0.58  (assume a23 (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15))
% 0.22/0.58  (assume a24 (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16))
% 0.22/0.58  (assume a25 (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17))
% 0.22/0.58  (assume a26 (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15))
% 0.22/0.58  (assume a27 (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15))
% 0.22/0.58  (assume a28 (tptp.reorganization_free tptp.sk5 tptp.sk16 tptp.sk17))
% 0.22/0.58  (assume a29 (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14))
% 0.22/0.58  (assume a30 (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14))
% 0.22/0.58  (assume a31 (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15))
% 0.22/0.58  (assume a32 (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15))
% 0.22/0.58  (assume a33 (tptp.greater tptp.sk13 tptp.sk12))
% 0.22/0.58  (assume a34 (or (not (= tptp.sk14 tptp.sk17)) (tptp.greater tptp.sk10 tptp.sk11)))
% 0.22/0.58  (assume a35 (= tptp.sk14 tptp.sk16))
% 0.22/0.58  (assume a36 (not (tptp.greater tptp.sk10 tptp.sk11)))
% 0.22/0.58  (assume a37 (not (= tptp.sk10 tptp.sk11)))
% 0.22/0.58  (step t1 (cl (not (= (or (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16))) (or (not (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk16))))) (not (or (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16)))) (or (not (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk16)))) :rule equiv_pos2)
% 0.22/0.58  (step t2 (cl (= (not (= tptp.sk16 tptp.sk14)) (not (= tptp.sk16 tptp.sk14)))) :rule refl)
% 0.22/0.58  (step t3 (cl (= (= (= (not (not (tptp.organization tptp.sk6 tptp.sk14))) (tptp.organization tptp.sk6 tptp.sk14)) true) (= (not (not (tptp.organization tptp.sk6 tptp.sk14))) (tptp.organization tptp.sk6 tptp.sk14)))) :rule equiv_simplify)
% 0.22/0.58  (step t4 (cl (not (= (= (not (not (tptp.organization tptp.sk6 tptp.sk14))) (tptp.organization tptp.sk6 tptp.sk14)) true)) (= (not (not (tptp.organization tptp.sk6 tptp.sk14))) (tptp.organization tptp.sk6 tptp.sk14))) :rule equiv1 :premises (t3))
% 0.22/0.58  (step t5 (cl (= (= (not (not (tptp.organization tptp.sk6 tptp.sk14))) (tptp.organization tptp.sk6 tptp.sk14)) (= (tptp.organization tptp.sk6 tptp.sk14) (not (not (tptp.organization tptp.sk6 tptp.sk14)))))) :rule all_simplify)
% 0.22/0.58  (step t6 (cl (= (tptp.organization tptp.sk6 tptp.sk14) (tptp.organization tptp.sk6 tptp.sk14))) :rule refl)
% 0.22/0.58  (step t7 (cl (= (not (not (tptp.organization tptp.sk6 tptp.sk14))) (tptp.organization tptp.sk6 tptp.sk14))) :rule all_simplify)
% 0.22/0.58  (step t8 (cl (= (= (tptp.organization tptp.sk6 tptp.sk14) (not (not (tptp.organization tptp.sk6 tptp.sk14)))) (= (tptp.organization tptp.sk6 tptp.sk14) (tptp.organization tptp.sk6 tptp.sk14)))) :rule cong :premises (t6 t7))
% 0.22/0.58  (step t9 (cl (= (= (tptp.organization tptp.sk6 tptp.sk14) (tptp.organization tptp.sk6 tptp.sk14)) true)) :rule all_simplify)
% 0.22/0.58  (step t10 (cl (= (= (tptp.organization tptp.sk6 tptp.sk14) (not (not (tptp.organization tptp.sk6 tptp.sk14)))) true)) :rule trans :premises (t8 t9))
% 0.22/0.58  (step t11 (cl (= (= (not (not (tptp.organization tptp.sk6 tptp.sk14))) (tptp.organization tptp.sk6 tptp.sk14)) true)) :rule trans :premises (t5 t10))
% 0.22/0.58  (step t12 (cl (= (not (not (tptp.organization tptp.sk6 tptp.sk14))) (tptp.organization tptp.sk6 tptp.sk14))) :rule resolution :premises (t4 t11))
% 0.22/0.58  (step t13 (cl (= (not (tptp.organization tptp.sk6 tptp.sk16)) (not (tptp.organization tptp.sk6 tptp.sk16)))) :rule refl)
% 0.22/0.58  (step t14 (cl (= (or (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16))) (or (not (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk16))))) :rule cong :premises (t2 t12 t13))
% 0.22/0.58  (step t15 (cl (not (= (=> (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))))) (not (=> (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))))) (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)))) :rule equiv_pos2)
% 0.22/0.58  (step t16 (cl (= (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)))) :rule refl)
% 0.22/0.58  (step t17 (cl (= (= (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) false) (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))))) :rule equiv_simplify)
% 0.22/0.58  (step t18 (cl (= (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) false) (not (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))))) :rule equiv2 :premises (t17))
% 0.22/0.58  (step t19 (cl (not (not (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))))) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) :rule not_not)
% 0.22/0.58  (step t20 (cl (= (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) false) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) :rule resolution :premises (t18 t19))
% 0.22/0.58  (step t21 (cl (=> (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) false) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) :rule implies_neg1)
% 0.22/0.58  (anchor :step t22)
% 0.22/0.58  (assume t22.a0 (tptp.organization tptp.sk6 tptp.sk16))
% 0.22/0.58  (assume t22.a1 (= tptp.sk16 tptp.sk14))
% 0.22/0.58  (assume t22.a2 (not (tptp.organization tptp.sk6 tptp.sk14)))
% 0.22/0.58  (step t22.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 0.22/0.58  (step t22.t2 (cl (= (= false true) false)) :rule all_simplify)
% 0.22/0.58  (step t22.t3 (cl (= (= (tptp.organization tptp.sk6 tptp.sk14) false) (not (tptp.organization tptp.sk6 tptp.sk14)))) :rule equiv_simplify)
% 0.22/0.58  (step t22.t4 (cl (= (tptp.organization tptp.sk6 tptp.sk14) false) (not (not (tptp.organization tptp.sk6 tptp.sk14)))) :rule equiv2 :premises (t22.t3))
% 0.22/0.58  (step t22.t5 (cl (not (not (not (tptp.organization tptp.sk6 tptp.sk14)))) (tptp.organization tptp.sk6 tptp.sk14)) :rule not_not)
% 0.22/0.58  (step t22.t6 (cl (= (tptp.organization tptp.sk6 tptp.sk14) false) (tptp.organization tptp.sk6 tptp.sk14)) :rule resolution :premises (t22.t4 t22.t5))
% 0.22/0.58  (step t22.t7 (cl (= (tptp.organization tptp.sk6 tptp.sk14) false)) :rule resolution :premises (t22.t6 t22.a2))
% 0.22/0.58  (step t22.t8 (cl (= false (tptp.organization tptp.sk6 tptp.sk14))) :rule symm :premises (t22.t7))
% 0.22/0.58  (step t22.t9 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 0.22/0.58  (step t22.t10 (cl (= tptp.sk14 tptp.sk16)) :rule symm :premises (t22.a1))
% 0.22/0.58  (step t22.t11 (cl (= (tptp.organization tptp.sk6 tptp.sk14) (tptp.organization tptp.sk6 tptp.sk16))) :rule cong :premises (t22.t9 t22.t10))
% 0.22/0.58  (step t22.t12 (cl (= (= (tptp.organization tptp.sk6 tptp.sk16) true) (tptp.organization tptp.sk6 tptp.sk16))) :rule equiv_simplify)
% 0.22/0.58  (step t22.t13 (cl (= (tptp.organization tptp.sk6 tptp.sk16) true) (not (tptp.organization tptp.sk6 tptp.sk16))) :rule equiv2 :premises (t22.t12))
% 0.22/0.58  (step t22.t14 (cl (= (tptp.organization tptp.sk6 tptp.sk16) true)) :rule resolution :premises (t22.t13 t22.a0))
% 0.22/0.58  (step t22.t15 (cl (= false true)) :rule trans :premises (t22.t8 t22.t11 t22.t14))
% 0.22/0.58  (step t22.t16 (cl false) :rule resolution :premises (t22.t1 t22.t2 t22.t15))
% 0.22/0.58  (step t22 (cl (not (tptp.organization tptp.sk6 tptp.sk16)) (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) false) :rule subproof :discharge (t22.a0 t22.a1 t22.a2))
% 0.22/0.58  (step t23 (cl (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (tptp.organization tptp.sk6 tptp.sk16)) :rule and_pos)
% 0.22/0.58  (step t24 (cl (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (= tptp.sk16 tptp.sk14)) :rule and_pos)
% 0.22/0.58  (step t25 (cl (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (not (tptp.organization tptp.sk6 tptp.sk14))) :rule and_pos)
% 0.22/0.58  (step t26 (cl false (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))))) :rule resolution :premises (t22 t23 t24 t25))
% 0.22/0.58  (step t27 (cl (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) false) :rule reordering :premises (t26))
% 0.22/0.58  (step t28 (cl (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) false) :rule contraction :premises (t27))
% 0.22/0.58  (step t29 (cl (=> (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) false) false) :rule resolution :premises (t21 t28))
% 0.22/0.58  (step t30 (cl (=> (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) false) (not false)) :rule implies_neg2)
% 0.22/0.58  (step t31 (cl (=> (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) false) (=> (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) false)) :rule resolution :premises (t29 t30))
% 0.22/0.58  (step t32 (cl (=> (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) false)) :rule contraction :premises (t31))
% 0.22/0.58  (step t33 (cl (= (=> (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) false) (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))))) :rule implies_simplify)
% 0.22/0.58  (step t34 (cl (not (=> (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) false)) (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))))) :rule equiv1 :premises (t33))
% 0.22/0.58  (step t35 (cl (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))))) :rule resolution :premises (t32 t34))
% 0.22/0.58  (step t36 (cl (= (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) false)) :rule resolution :premises (t20 t35))
% 0.22/0.58  (step t37 (cl (= (=> (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (=> (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) false))) :rule cong :premises (t16 t36))
% 0.22/0.58  (step t38 (cl (= (=> (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) false) (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))))) :rule all_simplify)
% 0.22/0.58  (step t39 (cl (= (=> (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))))) :rule trans :premises (t37 t38))
% 0.22/0.58  (step t40 (cl (=> (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))) :rule implies_neg1)
% 0.22/0.58  (anchor :step t41)
% 0.22/0.58  (assume t41.a0 (= tptp.sk16 tptp.sk14))
% 0.22/0.58  (assume t41.a1 (not (tptp.organization tptp.sk6 tptp.sk14)))
% 0.22/0.58  (assume t41.a2 (tptp.organization tptp.sk6 tptp.sk16))
% 0.22/0.58  (step t41.t1 (cl (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16)) (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14)))) :rule and_neg)
% 0.22/0.58  (step t41.t2 (cl (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) :rule resolution :premises (t41.t1 t41.a2 t41.a0 t41.a1))
% 0.22/0.58  (step t41 (cl (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16)) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) :rule subproof :discharge (t41.a0 t41.a1 t41.a2))
% 0.22/0.58  (step t42 (cl (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))) (= tptp.sk16 tptp.sk14)) :rule and_pos)
% 0.22/0.58  (step t43 (cl (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))) (not (tptp.organization tptp.sk6 tptp.sk14))) :rule and_pos)
% 0.22/0.58  (step t44 (cl (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))) (tptp.organization tptp.sk6 tptp.sk16)) :rule and_pos)
% 0.22/0.58  (step t45 (cl (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))) (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))) (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))) (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)))) :rule resolution :premises (t41 t42 t43 t44))
% 0.22/0.58  (step t46 (cl (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))) (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))) (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) :rule reordering :premises (t45))
% 0.22/0.58  (step t47 (cl (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16))) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) :rule contraction :premises (t46))
% 0.22/0.58  (step t48 (cl (=> (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) :rule resolution :premises (t40 t47))
% 0.22/0.58  (step t49 (cl (=> (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (not (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))))) :rule implies_neg2)
% 0.22/0.58  (step t50 (cl (=> (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)))) (=> (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))))) :rule resolution :premises (t48 t49))
% 0.22/0.58  (step t51 (cl (=> (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)) (and (tptp.organization tptp.sk6 tptp.sk16) (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14))))) :rule contraction :premises (t50))
% 0.22/0.58  (step t52 (cl (not (and (= tptp.sk16 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk16)))) :rule resolution :premises (t15 t39 t51))
% 0.22/0.58  (step t53 (cl (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16))) :rule not_and :premises (t52))
% 0.22/0.58  (step t54 (cl (or (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16))) (not (not (= tptp.sk16 tptp.sk14)))) :rule or_neg)
% 0.22/0.58  (step t55 (cl (or (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16))) (not (not (not (tptp.organization tptp.sk6 tptp.sk14))))) :rule or_neg)
% 0.22/0.58  (step t56 (cl (or (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16))) (not (not (tptp.organization tptp.sk6 tptp.sk16)))) :rule or_neg)
% 0.22/0.58  (step t57 (cl (or (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16))) (or (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16))) (or (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16)))) :rule resolution :premises (t53 t54 t55 t56))
% 0.22/0.58  (step t58 (cl (or (not (= tptp.sk16 tptp.sk14)) (not (not (tptp.organization tptp.sk6 tptp.sk14))) (not (tptp.organization tptp.sk6 tptp.sk16)))) :rule contraction :premises (t57))
% 0.22/0.58  (step t59 (cl (or (not (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk16)))) :rule resolution :premises (t1 t14 t58))
% 0.22/0.58  (step t60 (cl (not (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk6 tptp.sk14) (not (tptp.organization tptp.sk6 tptp.sk16))) :rule or :premises (t59))
% 0.22/0.58  (step t61 (cl (not (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16))) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16)) :rule or_pos)
% 0.22/0.58  (step t62 (cl (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16) (not (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16)))) :rule reordering :premises (t61))
% 0.22/0.58  (step t63 (cl (not (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15))) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15)) :rule or_pos)
% 0.22/0.58  (step t64 (cl (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15) (not (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15)))) :rule reordering :premises (t63))
% 0.22/0.58  (step t65 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B))) (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B)))) :rule implies_neg1)
% 0.22/0.58  (anchor :step t66)
% 0.22/0.58  (assume t66.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B))))
% 0.22/0.58  (step t66.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B)))) (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15)))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk15) (:= C tptp.sk16)))
% 0.22/0.58  (step t66.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B)))) (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15))) :rule or :premises (t66.t1))
% 0.22/0.58  (step t66.t3 (cl (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15))) :rule resolution :premises (t66.t2 t66.a0))
% 0.22/0.58  (step t66 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B)))) (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15))) :rule subproof :discharge (t66.a0))
% 0.22/0.58  (step t67 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B))) (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15))) (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15))) :rule resolution :premises (t65 t66))
% 0.22/0.58  (step t68 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B))) (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15))) (not (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15)))) :rule implies_neg2)
% 0.22/0.58  (step t69 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B))) (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B))) (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15)))) :rule resolution :premises (t67 t68))
% 0.22/0.58  (step t70 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B))) (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15)))) :rule contraction :premises (t69))
% 0.22/0.58  (step t71 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.reorganization A B C)) (tptp.greater C B)))) (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15))) :rule implies :premises (t70))
% 0.22/0.58  (step t72 (cl (or (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (tptp.greater tptp.sk16 tptp.sk15))) :rule resolution :premises (t71 a6))
% 0.22/0.58  (step t73 (cl (tptp.greater tptp.sk16 tptp.sk15)) :rule resolution :premises (t64 a24 t72))
% 0.22/0.58  (step t74 (cl (not (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16))) (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16)) :rule or_pos)
% 0.22/0.58  (step t75 (cl (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16) (not (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16)))) :rule reordering :premises (t74))
% 0.22/0.58  (step t76 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F)))) :rule implies_neg1)
% 0.22/0.58  (anchor :step t77)
% 0.22/0.58  (assume t77.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F))))
% 0.22/0.58  (step t77.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F)))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16)))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk15) (:= C tptp.sk6) (:= D tptp.sk17) (:= E tptp.sk8) (:= F tptp.sk16) (:= G tptp.sk7) (:= H tptp.sk12) (:= I tptp.sk13)))
% 0.22/0.58  (step t77.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F)))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16))) :rule or :premises (t77.t1))
% 0.22/0.58  (step t77.t3 (cl (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16))) :rule resolution :premises (t77.t2 t77.a0))
% 0.22/0.58  (step t77 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F)))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16))) :rule subproof :discharge (t77.a0))
% 0.22/0.58  (step t78 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16))) :rule resolution :premises (t76 t77))
% 0.22/0.58  (step t79 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16))) (not (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16)))) :rule implies_neg2)
% 0.22/0.58  (step t80 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16)))) :rule resolution :premises (t78 t79))
% 0.22/0.58  (step t81 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16)))) :rule contraction :premises (t80))
% 0.22/0.58  (step t82 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.reorganization A B F)) (not (tptp.reorganization C B D)) (not (tptp.reorganization_type A G B)) (not (tptp.reorganization_type C G B)) (not (tptp.complexity A H B)) (not (tptp.complexity C I B)) (not (tptp.greater I H)) (tptp.greater D F)))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16))) :rule implies :premises (t81))
% 0.22/0.58  (step t83 (cl (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk17 tptp.sk16))) :rule resolution :premises (t82 a9))
% 0.22/0.58  (step t84 (cl (tptp.greater tptp.sk17 tptp.sk16)) :rule resolution :premises (t75 a16 a17 a19 a20 a21 a24 a25 a26 a27 a31 a32 a33 t83))
% 0.22/0.58  (step t85 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))) (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D)))) :rule implies_neg1)
% 0.22/0.58  (anchor :step t86)
% 0.22/0.58  (assume t86.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))))
% 0.22/0.58  (step t86.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D)))) (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16)))) :rule forall_inst :args ((:= A tptp.sk6) (:= B tptp.sk15) (:= C tptp.sk17) (:= D tptp.sk16)))
% 0.22/0.58  (step t86.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D)))) (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16))) :rule or :premises (t86.t1))
% 0.22/0.58  (step t86.t3 (cl (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16))) :rule resolution :premises (t86.t2 t86.a0))
% 0.22/0.58  (step t86 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D)))) (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16))) :rule subproof :discharge (t86.a0))
% 0.22/0.58  (step t87 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))) (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16))) (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16))) :rule resolution :premises (t85 t86))
% 0.22/0.58  (step t88 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))) (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16))) (not (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16)))) :rule implies_neg2)
% 0.22/0.58  (step t89 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))) (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))) (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16)))) :rule resolution :premises (t87 t88))
% 0.22/0.58  (step t90 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))) (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16)))) :rule contraction :premises (t89))
% 0.22/0.58  (step t91 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D)))) (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16))) :rule implies :premises (t90))
% 0.22/0.58  (step t92 (cl (or (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk6 tptp.sk16))) :rule resolution :premises (t91 a5))
% 0.22/0.58  (step t93 (cl (tptp.organization tptp.sk6 tptp.sk16)) :rule resolution :premises (t62 a17 a19 t73 t84 t92))
% 0.22/0.58  (step t94 (cl (not (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11))) (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11)) :rule or_pos)
% 0.22/0.58  (step t95 (cl (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11) (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11)))) :rule reordering :premises (t94))
% 0.22/0.58  (step t96 (cl (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16)) (not (= tptp.sk16 tptp.sk14)) (not (tptp.organization tptp.sk5 tptp.sk16))) :rule and_neg)
% 0.22/0.58  (step t97 (cl (=> (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk14)) (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16))) :rule implies_neg1)
% 0.22/0.58  (anchor :step t98)
% 0.22/0.58  (assume t98.a0 (= tptp.sk16 tptp.sk14))
% 0.22/0.58  (assume t98.a1 (tptp.organization tptp.sk5 tptp.sk16))
% 0.22/0.58  (step t98.t1 (cl (=> (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk5 tptp.sk14)) (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14))) :rule implies_neg1)
% 0.22/0.58  (anchor :step t98.t2)
% 0.22/0.58  (assume t98.t2.a0 (tptp.organization tptp.sk5 tptp.sk16))
% 0.22/0.58  (assume t98.t2.a1 (= tptp.sk16 tptp.sk14))
% 0.22/0.58  (step t98.t2.t1 (cl (= (= (tptp.organization tptp.sk5 tptp.sk14) true) (tptp.organization tptp.sk5 tptp.sk14))) :rule equiv_simplify)
% 0.22/0.58  (step t98.t2.t2 (cl (not (= (tptp.organization tptp.sk5 tptp.sk14) true)) (tptp.organization tptp.sk5 tptp.sk14)) :rule equiv1 :premises (t98.t2.t1))
% 0.22/0.58  (step t98.t2.t3 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 0.22/0.58  (step t98.t2.t4 (cl (= tptp.sk14 tptp.sk16)) :rule symm :premises (t98.t2.a1))
% 0.22/0.58  (step t98.t2.t5 (cl (= (tptp.organization tptp.sk5 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16))) :rule cong :premises (t98.t2.t3 t98.t2.t4))
% 0.22/0.58  (step t98.t2.t6 (cl (= (= (tptp.organization tptp.sk5 tptp.sk16) true) (tptp.organization tptp.sk5 tptp.sk16))) :rule equiv_simplify)
% 0.22/0.58  (step t98.t2.t7 (cl (= (tptp.organization tptp.sk5 tptp.sk16) true) (not (tptp.organization tptp.sk5 tptp.sk16))) :rule equiv2 :premises (t98.t2.t6))
% 0.22/0.58  (step t98.t2.t8 (cl (= (tptp.organization tptp.sk5 tptp.sk16) true)) :rule resolution :premises (t98.t2.t7 t98.t2.a0))
% 0.22/0.58  (step t98.t2.t9 (cl (= (tptp.organization tptp.sk5 tptp.sk14) true)) :rule trans :premises (t98.t2.t5 t98.t2.t8))
% 0.22/0.58  (step t98.t2.t10 (cl (tptp.organization tptp.sk5 tptp.sk14)) :rule resolution :premises (t98.t2.t2 t98.t2.t9))
% 0.22/0.58  (step t98.t2 (cl (not (tptp.organization tptp.sk5 tptp.sk16)) (not (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk5 tptp.sk14)) :rule subproof :discharge (t98.t2.a0 t98.t2.a1))
% 0.22/0.58  (step t98.t3 (cl (not (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14))) (tptp.organization tptp.sk5 tptp.sk16)) :rule and_pos)
% 0.22/0.58  (step t98.t4 (cl (not (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14))) (= tptp.sk16 tptp.sk14)) :rule and_pos)
% 0.22/0.58  (step t98.t5 (cl (tptp.organization tptp.sk5 tptp.sk14) (not (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14))) (not (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14)))) :rule resolution :premises (t98.t2 t98.t3 t98.t4))
% 0.22/0.58  (step t98.t6 (cl (not (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14))) (not (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14))) (tptp.organization tptp.sk5 tptp.sk14)) :rule reordering :premises (t98.t5))
% 0.22/0.58  (step t98.t7 (cl (not (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14))) (tptp.organization tptp.sk5 tptp.sk14)) :rule contraction :premises (t98.t6))
% 0.22/0.58  (step t98.t8 (cl (=> (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk5 tptp.sk14)) (tptp.organization tptp.sk5 tptp.sk14)) :rule resolution :premises (t98.t1 t98.t7))
% 0.22/0.58  (step t98.t9 (cl (=> (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk5 tptp.sk14))) :rule implies_neg2)
% 0.22/0.58  (step t98.t10 (cl (=> (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk5 tptp.sk14)) (=> (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk5 tptp.sk14))) :rule resolution :premises (t98.t8 t98.t9))
% 0.22/0.58  (step t98.t11 (cl (=> (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk5 tptp.sk14))) :rule contraction :premises (t98.t10))
% 0.22/0.58  (step t98.t12 (cl (not (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14))) (tptp.organization tptp.sk5 tptp.sk14)) :rule implies :premises (t98.t11))
% 0.22/0.58  (step t98.t13 (cl (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14)) (not (tptp.organization tptp.sk5 tptp.sk16)) (not (= tptp.sk16 tptp.sk14))) :rule and_neg)
% 0.22/0.58  (step t98.t14 (cl (and (tptp.organization tptp.sk5 tptp.sk16) (= tptp.sk16 tptp.sk14))) :rule resolution :premises (t98.t13 t98.a1 t98.a0))
% 0.22/0.58  (step t98.t15 (cl (tptp.organization tptp.sk5 tptp.sk14)) :rule resolution :premises (t98.t12 t98.t14))
% 0.22/0.58  (step t98 (cl (not (= tptp.sk16 tptp.sk14)) (not (tptp.organization tptp.sk5 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk14)) :rule subproof :discharge (t98.a0 t98.a1))
% 0.22/0.58  (step t99 (cl (not (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16))) (= tptp.sk16 tptp.sk14)) :rule and_pos)
% 0.22/0.58  (step t100 (cl (not (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16))) (tptp.organization tptp.sk5 tptp.sk16)) :rule and_pos)
% 0.22/0.58  (step t101 (cl (tptp.organization tptp.sk5 tptp.sk14) (not (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16))) (not (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16)))) :rule resolution :premises (t98 t99 t100))
% 0.22/0.58  (step t102 (cl (not (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16))) (not (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16))) (tptp.organization tptp.sk5 tptp.sk14)) :rule reordering :premises (t101))
% 0.22/0.58  (step t103 (cl (not (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16))) (tptp.organization tptp.sk5 tptp.sk14)) :rule contraction :premises (t102))
% 0.22/0.58  (step t104 (cl (=> (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk14)) (tptp.organization tptp.sk5 tptp.sk14)) :rule resolution :premises (t97 t103))
% 0.22/0.58  (step t105 (cl (=> (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk5 tptp.sk14))) :rule implies_neg2)
% 0.22/0.58  (step t106 (cl (=> (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk14)) (=> (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk14))) :rule resolution :premises (t104 t105))
% 0.22/0.58  (step t107 (cl (=> (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk14))) :rule contraction :premises (t106))
% 0.22/0.58  (step t108 (cl (not (and (= tptp.sk16 tptp.sk14) (tptp.organization tptp.sk5 tptp.sk16))) (tptp.organization tptp.sk5 tptp.sk14)) :rule implies :premises (t107))
% 0.22/0.58  (step t109 (cl (not (= tptp.sk16 tptp.sk14)) (not (tptp.organization tptp.sk5 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk14)) :rule resolution :premises (t96 t108))
% 0.22/0.58  (step t110 (cl (not (= tptp.sk16 tptp.sk14)) (tptp.organization tptp.sk5 tptp.sk14) (not (tptp.organization tptp.sk5 tptp.sk16))) :rule reordering :premises (t109))
% 0.22/0.58  (step t111 (cl (= tptp.sk16 tptp.sk14)) :rule symm :premises (a35))
% 0.22/0.58  (step t112 (cl (not (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16))) (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16)) :rule or_pos)
% 0.22/0.58  (step t113 (cl (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16) (not (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16)))) :rule reordering :premises (t112))
% 0.22/0.58  (step t114 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D)))) :rule implies_neg1)
% 0.22/0.58  (anchor :step t115)
% 0.22/0.58  (assume t115.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))))
% 0.22/0.58  (step t115.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D)))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16)))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk15) (:= C tptp.sk17) (:= D tptp.sk16)))
% 0.22/0.58  (step t115.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D)))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16))) :rule or :premises (t115.t1))
% 0.22/0.58  (step t115.t3 (cl (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16))) :rule resolution :premises (t115.t2 t115.a0))
% 0.22/0.58  (step t115 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D)))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16))) :rule subproof :discharge (t115.a0))
% 0.22/0.58  (step t116 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16))) :rule resolution :premises (t114 t115))
% 0.22/0.58  (step t117 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16))) (not (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16)))) :rule implies_neg2)
% 0.22/0.58  (step t118 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16)))) :rule resolution :premises (t116 t117))
% 0.22/0.58  (step t119 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16)))) :rule contraction :premises (t118))
% 0.22/0.58  (step t120 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization A C)) (not (tptp.greater D B)) (not (tptp.greater C D)) (tptp.organization A D)))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16))) :rule implies :premises (t119))
% 0.22/0.58  (step t121 (cl (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk17)) (not (tptp.greater tptp.sk16 tptp.sk15)) (not (tptp.greater tptp.sk17 tptp.sk16)) (tptp.organization tptp.sk5 tptp.sk16))) :rule resolution :premises (t120 a5))
% 0.22/0.58  (step t122 (cl (tptp.organization tptp.sk5 tptp.sk16)) :rule resolution :premises (t113 a16 a18 t73 t84 t121))
% 0.22/0.58  (step t123 (cl (tptp.organization tptp.sk5 tptp.sk14)) :rule resolution :premises (t110 t111 t122))
% 0.22/0.58  (step t124 (cl (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (= tptp.sk16 tptp.sk14))) :rule and_neg)
% 0.22/0.58  (step t125 (cl (=> (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) :rule implies_neg1)
% 0.22/0.58  (anchor :step t126)
% 0.22/0.58  (assume t126.a0 (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16))
% 0.22/0.58  (assume t126.a1 (= tptp.sk16 tptp.sk14))
% 0.22/0.58  (step t126.t1 (cl (=> (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) :rule implies_neg1)
% 0.22/0.58  (anchor :step t126.t2)
% 0.22/0.58  (assume t126.t2.a0 (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16))
% 0.22/0.58  (assume t126.t2.a1 (= tptp.sk16 tptp.sk14))
% 0.22/0.58  (step t126.t2.t1 (cl (= (= (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14) true) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14))) :rule equiv_simplify)
% 0.22/0.58  (step t126.t2.t2 (cl (not (= (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14) true)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule equiv1 :premises (t126.t2.t1))
% 0.22/0.58  (step t126.t2.t3 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 0.22/0.58  (step t126.t2.t4 (cl (= tptp.sk15 tptp.sk15)) :rule refl)
% 0.22/0.58  (step t126.t2.t5 (cl (= tptp.sk14 tptp.sk16)) :rule symm :premises (t126.t2.a1))
% 0.22/0.58  (step t126.t2.t6 (cl (= (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16))) :rule cong :premises (t126.t2.t3 t126.t2.t4 t126.t2.t5))
% 0.22/0.58  (step t126.t2.t7 (cl (= (= (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) true) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16))) :rule equiv_simplify)
% 0.22/0.58  (step t126.t2.t8 (cl (= (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) true) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16))) :rule equiv2 :premises (t126.t2.t7))
% 0.22/0.58  (step t126.t2.t9 (cl (= (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) true)) :rule resolution :premises (t126.t2.t8 t126.t2.a0))
% 0.22/0.58  (step t126.t2.t10 (cl (= (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14) true)) :rule trans :premises (t126.t2.t6 t126.t2.t9))
% 0.22/0.58  (step t126.t2.t11 (cl (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule resolution :premises (t126.t2.t2 t126.t2.t10))
% 0.22/0.58  (step t126.t2 (cl (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule subproof :discharge (t126.t2.a0 t126.t2.a1))
% 0.22/0.58  (step t126.t3 (cl (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) :rule and_pos)
% 0.22/0.58  (step t126.t4 (cl (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (= tptp.sk16 tptp.sk14)) :rule and_pos)
% 0.22/0.58  (step t126.t5 (cl (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14) (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)))) :rule resolution :premises (t126.t2 t126.t3 t126.t4))
% 0.22/0.58  (step t126.t6 (cl (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule reordering :premises (t126.t5))
% 0.22/0.58  (step t126.t7 (cl (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule contraction :premises (t126.t6))
% 0.22/0.58  (step t126.t8 (cl (=> (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule resolution :premises (t126.t1 t126.t7))
% 0.22/0.58  (step t126.t9 (cl (=> (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14))) :rule implies_neg2)
% 0.22/0.58  (step t126.t10 (cl (=> (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (=> (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14))) :rule resolution :premises (t126.t8 t126.t9))
% 0.22/0.58  (step t126.t11 (cl (=> (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14))) :rule contraction :premises (t126.t10))
% 0.22/0.58  (step t126.t12 (cl (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule implies :premises (t126.t11))
% 0.22/0.58  (step t126.t13 (cl (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (= tptp.sk16 tptp.sk14))) :rule and_neg)
% 0.22/0.58  (step t126.t14 (cl (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) :rule resolution :premises (t126.t13 t126.a0 t126.a1))
% 0.22/0.58  (step t126.t15 (cl (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule resolution :premises (t126.t12 t126.t14))
% 0.22/0.58  (step t126 (cl (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule subproof :discharge (t126.a0 t126.a1))
% 0.22/0.58  (step t127 (cl (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) :rule and_pos)
% 0.22/0.58  (step t128 (cl (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (= tptp.sk16 tptp.sk14)) :rule and_pos)
% 0.22/0.58  (step t129 (cl (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14) (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)))) :rule resolution :premises (t126 t127 t128))
% 0.22/0.58  (step t130 (cl (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule reordering :premises (t129))
% 0.22/0.58  (step t131 (cl (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule contraction :premises (t130))
% 0.22/0.58  (step t132 (cl (=> (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule resolution :premises (t125 t131))
% 0.22/0.58  (step t133 (cl (=> (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14))) :rule implies_neg2)
% 0.22/0.58  (step t134 (cl (=> (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (=> (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14))) :rule resolution :premises (t132 t133))
% 0.22/0.58  (step t135 (cl (=> (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14))) :rule contraction :premises (t134))
% 0.22/0.58  (step t136 (cl (not (and (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16) (= tptp.sk16 tptp.sk14))) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule implies :premises (t135))
% 0.22/0.58  (step t137 (cl (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk16)) (not (= tptp.sk16 tptp.sk14)) (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule resolution :premises (t124 t136))
% 0.22/0.58  (step t138 (cl (= tptp.sk16 tptp.sk14)) :rule symm :premises (a35))
% 0.22/0.58  (step t139 (cl (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) :rule resolution :premises (t137 a24 t138))
% 0.22/0.58  (step t140 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J)))) :rule implies_neg1)
% 0.22/0.58  (anchor :step t141)
% 0.22/0.58  (assume t141.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J))))
% 0.22/0.58  (step t141.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J)))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11)))) :rule forall_inst :args ((:= A tptp.sk5) (:= B tptp.sk15) (:= C tptp.sk6) (:= D tptp.sk14) (:= E tptp.sk8) (:= F tptp.sk9) (:= G tptp.sk17) (:= H tptp.sk7) (:= I tptp.sk10) (:= J tptp.sk11) (:= K tptp.sk12) (:= L tptp.sk13)))
% 0.22/0.58  (step t141.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J)))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11))) :rule or :premises (t141.t1))
% 0.22/0.58  (step t141.t3 (cl (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11))) :rule resolution :premises (t141.t2 t141.a0))
% 0.22/0.58  (step t141 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J)))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11))) :rule subproof :discharge (t141.a0))
% 0.22/0.58  (step t142 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11))) :rule resolution :premises (t140 t141))
% 0.22/0.58  (step t143 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11))) (not (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11)))) :rule implies_neg2)
% 0.22/0.58  (step t144 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11)))) :rule resolution :premises (t142 t143))
% 0.22/0.58  (step t145 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11)))) :rule contraction :premises (t144))
% 0.22/0.58  (step t146 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (K $$unsorted) (L $$unsorted)) (or (not (tptp.organization A B)) (not (tptp.organization C B)) (not (tptp.organization A D)) (not (tptp.organization C D)) (not (tptp.class A E B)) (not (tptp.class C E B)) (not (tptp.survival_chance A F B)) (not (tptp.survival_chance C F B)) (not (tptp.reorganization A B D)) (not (tptp.reorganization C B G)) (not (tptp.reorganization_type A H B)) (not (tptp.reorganization_type C H B)) (not (tptp.survival_chance A I D)) (not (tptp.survival_chance C J D)) (not (tptp.complexity A K B)) (not (tptp.complexity C L B)) (not (tptp.greater L K)) (tptp.greater I J) (= I J)))) (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11))) :rule implies :premises (t145))
% 0.22/0.58  (step t147 (cl (or (not (tptp.organization tptp.sk5 tptp.sk15)) (not (tptp.organization tptp.sk6 tptp.sk15)) (not (tptp.organization tptp.sk5 tptp.sk14)) (not (tptp.organization tptp.sk6 tptp.sk14)) (not (tptp.class tptp.sk5 tptp.sk8 tptp.sk15)) (not (tptp.class tptp.sk6 tptp.sk8 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk9 tptp.sk15)) (not (tptp.survival_chance tptp.sk6 tptp.sk9 tptp.sk15)) (not (tptp.reorganization tptp.sk5 tptp.sk15 tptp.sk14)) (not (tptp.reorganization tptp.sk6 tptp.sk15 tptp.sk17)) (not (tptp.reorganization_type tptp.sk5 tptp.sk7 tptp.sk15)) (not (tptp.reorganization_type tptp.sk6 tptp.sk7 tptp.sk15)) (not (tptp.survival_chance tptp.sk5 tptp.sk10 tptp.sk14)) (not (tptp.survival_chance tptp.sk6 tptp.sk11 tptp.sk14)) (not (tptp.complexity tptp.sk5 tptp.sk12 tptp.sk15)) (not (tptp.complexity tptp.sk6 tptp.sk13 tptp.sk15)) (not (tptp.greater tptp.sk13 tptp.sk12)) (tptp.greater tptp.sk10 tptp.sk11) (= tptp.sk10 tptp.sk11))) :rule resolution :premises (t146 a10))
% 0.22/0.58  (step t148 (cl (not (tptp.organization tptp.sk6 tptp.sk14))) :rule resolution :premises (t95 a36 a37 a16 a17 a20 a21 a22 a23 a25 a26 a27 a29 a30 a31 a32 a33 t123 t139 t147))
% 0.22/0.58  (step t149 (cl (= tptp.sk16 tptp.sk14)) :rule symm :premises (a35))
% 0.22/0.58  (step t150 (cl) :rule resolution :premises (t60 t93 t148 t149))
% 0.22/0.58  
% 0.22/0.58  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.cg5EfZIy3m/cvc5---1.0.5_19068.smt2
% 0.22/0.59  % cvc5---1.0.5 exiting
% 0.22/0.59  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------