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

% Computer : n017.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:31 EDT 2024

% Result   : Unsatisfiable 0.20s 0.58s
% Output   : Proof 0.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : MGT050-1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n017.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:25:39 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.58  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.oGRnoHF6AV/cvc5---1.0.5_14446.smt2
% 0.20/0.58  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.oGRnoHF6AV/cvc5---1.0.5_14446.smt2
% 0.43/0.60  (assume a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller_or_equal A B)) (tptp.smaller A B) (= A B))))
% 0.43/0.60  (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.smaller_or_equal A B))))
% 0.43/0.60  (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (or (not (= A B)) (tptp.smaller_or_equal A B))))
% 0.43/0.60  (assume a3 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.greater_or_equal A B)) (tptp.greater A B) (= A B))))
% 0.43/0.60  (assume a4 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.greater A B)) (tptp.greater_or_equal A B))))
% 0.43/0.60  (assume a5 (forall ((A $$unsorted) (B $$unsorted)) (or (not (= A B)) (tptp.greater_or_equal A B))))
% 0.43/0.60  (assume a6 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))))
% 0.43/0.60  (assume a7 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.greater A B)) (tptp.smaller B A))))
% 0.43/0.60  (assume a8 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.greater A B)) (not (tptp.greater B A)))))
% 0.43/0.60  (assume a9 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.greater A B)) (not (tptp.greater B C)) (tptp.greater A C))))
% 0.43/0.60  (assume a10 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.smaller A B) (= A B) (tptp.greater A B))))
% 0.43/0.60  (assume a11 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))))
% 0.43/0.60  (assume a12 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B)))))
% 0.43/0.60  (assume a13 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater_or_equal (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B)))))
% 0.43/0.60  (assume a14 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (= (tptp.capability A C) (tptp.capability A B))) (not (= (tptp.position A C) (tptp.position A B))) (= (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B)))))
% 0.43/0.60  (assume a15 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.smaller_or_equal (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.greater (tptp.capability A B) (tptp.capability A C)))))
% 0.43/0.60  (assume a16 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C)))))
% 0.43/0.60  (assume a17 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (= (tptp.internal_friction A B) (tptp.internal_friction A C))) (= (tptp.capability A B) (tptp.capability A C)))))
% 0.43/0.60  (assume a18 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.external_ties A B) (tptp.external_ties A C))) (tptp.greater (tptp.position A B) (tptp.position A C)))))
% 0.43/0.60  (assume a19 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C)))))
% 0.43/0.60  (assume a20 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))))
% 0.43/0.60  (assume a21 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C)))))
% 0.43/0.60  (assume a22 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C)))))
% 0.43/0.60  (assume a23 (tptp.organization tptp.sk1))
% 0.43/0.60  (assume a24 (not (tptp.has_endowment tptp.sk1)))
% 0.43/0.60  (assume a25 (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2)))
% 0.43/0.60  (assume a26 (not (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2))))
% 0.43/0.60  (step t1 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))) (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A)))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t2)
% 0.43/0.60  (assume t2.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))))
% 0.43/0.60  (step t2.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A)))) (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))))) :rule forall_inst :args ((:= A (tptp.capability tptp.sk1 tptp.sk3)) (:= B (tptp.capability tptp.sk1 tptp.sk2))))
% 0.43/0.60  (step t2.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A)))) (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3)))) :rule or :premises (t2.t1))
% 0.43/0.60  (step t2.t3 (cl (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3)))) :rule resolution :premises (t2.t2 t2.a0))
% 0.43/0.60  (step t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A)))) (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3)))) :rule subproof :discharge (t2.a0))
% 0.43/0.60  (step t3 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))) (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3)))) (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3)))) :rule resolution :premises (t1 t2))
% 0.43/0.60  (step t4 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))) (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3)))) (not (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))))) :rule implies_neg2)
% 0.43/0.60  (step t5 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))) (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))) (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))))) :rule resolution :premises (t3 t4))
% 0.43/0.60  (step t6 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))) (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))))) :rule contraction :premises (t5))
% 0.43/0.60  (step t7 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A)))) (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3)))) :rule implies :premises (t6))
% 0.43/0.60  (step t8 (cl (not (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3)))) (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) :rule or_pos)
% 0.43/0.60  (step t9 (cl (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3)) (not (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))))) :rule reordering :premises (t8))
% 0.43/0.60  (step t10 (cl (not (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2)))) (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) :rule or_pos)
% 0.43/0.60  (step t11 (cl (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2)) (not (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))))) :rule reordering :premises (t10))
% 0.43/0.60  (step t12 (cl (not (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2)))) (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) :rule or_pos)
% 0.43/0.60  (step t13 (cl (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2)) (not (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))))) :rule reordering :premises (t12))
% 0.43/0.60  (step t14 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t15)
% 0.43/0.60  (assume t15.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C)))))
% 0.43/0.60  (step t15.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))))) (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))))) :rule forall_inst :args ((:= A tptp.sk1) (:= B tptp.sk3) (:= C tptp.sk2)))
% 0.43/0.60  (step t15.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))))) (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2)))) :rule or :premises (t15.t1))
% 0.43/0.60  (step t15.t3 (cl (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2)))) :rule resolution :premises (t15.t2 t15.a0))
% 0.43/0.60  (step t15 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))))) (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2)))) :rule subproof :discharge (t15.a0))
% 0.43/0.60  (step t16 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2)))) :rule resolution :premises (t14 t15))
% 0.43/0.60  (step t17 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2)))) (not (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))))) :rule implies_neg2)
% 0.43/0.60  (step t18 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))))) :rule resolution :premises (t16 t17))
% 0.43/0.60  (step t19 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))))) :rule contraction :premises (t18))
% 0.43/0.60  (step t20 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.greater (tptp.age A B) (tptp.age A C))) (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))))) (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2)))) :rule implies :premises (t19))
% 0.43/0.60  (step t21 (cl (or (not (tptp.organization tptp.sk1)) (not (tptp.greater (tptp.age tptp.sk1 tptp.sk3) (tptp.age tptp.sk1 tptp.sk2))) (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2)))) :rule resolution :premises (t20 a22))
% 0.43/0.60  (step t22 (cl (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) :rule resolution :premises (t13 a23 a25 t21))
% 0.43/0.60  (step t23 (cl (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule and_neg)
% 0.43/0.60  (step t24 (cl (=> (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t25)
% 0.43/0.60  (assume t25.a0 (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))
% 0.43/0.60  (assume t25.a1 (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))
% 0.43/0.60  (step t25.t1 (cl (=> (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t25.t2)
% 0.43/0.60  (assume t25.t2.a0 (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))
% 0.43/0.60  (assume t25.t2.a1 (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))
% 0.43/0.60  (step t25.t2.t1 (cl (= (= (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) true) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule equiv_simplify)
% 0.43/0.60  (step t25.t2.t2 (cl (not (= (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) true)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule equiv1 :premises (t25.t2.t1))
% 0.43/0.60  (step t25.t2.t3 (cl (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3))) :rule symm :premises (t25.t2.a1))
% 0.43/0.60  (step t25.t2.t4 (cl (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule symm :premises (t25.t2.t3))
% 0.43/0.60  (step t25.t2.t5 (cl (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule refl)
% 0.43/0.60  (step t25.t2.t6 (cl (= (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule cong :premises (t25.t2.t4 t25.t2.t5))
% 0.43/0.60  (step t25.t2.t7 (cl (= (= (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) true) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule equiv_simplify)
% 0.43/0.60  (step t25.t2.t8 (cl (= (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) true) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule equiv2 :premises (t25.t2.t7))
% 0.43/0.60  (step t25.t2.t9 (cl (= (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) true)) :rule resolution :premises (t25.t2.t8 t25.t2.a0))
% 0.43/0.60  (step t25.t2.t10 (cl (= (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) true)) :rule trans :premises (t25.t2.t6 t25.t2.t9))
% 0.43/0.60  (step t25.t2.t11 (cl (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule resolution :premises (t25.t2.t2 t25.t2.t10))
% 0.43/0.60  (step t25.t2 (cl (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule subproof :discharge (t25.t2.a0 t25.t2.a1))
% 0.43/0.60  (step t25.t3 (cl (not (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule and_pos)
% 0.43/0.60  (step t25.t4 (cl (not (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule and_pos)
% 0.43/0.60  (step t25.t5 (cl (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (not (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (not (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))))) :rule resolution :premises (t25.t2 t25.t3 t25.t4))
% 0.43/0.60  (step t25.t6 (cl (not (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (not (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule reordering :premises (t25.t5))
% 0.43/0.60  (step t25.t7 (cl (not (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule contraction :premises (t25.t6))
% 0.43/0.60  (step t25.t8 (cl (=> (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule resolution :premises (t25.t1 t25.t7))
% 0.43/0.60  (step t25.t9 (cl (=> (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule implies_neg2)
% 0.43/0.60  (step t25.t10 (cl (=> (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (=> (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule resolution :premises (t25.t8 t25.t9))
% 0.43/0.60  (step t25.t11 (cl (=> (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule contraction :premises (t25.t10))
% 0.43/0.60  (step t25.t12 (cl (not (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule implies :premises (t25.t11))
% 0.43/0.60  (step t25.t13 (cl (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule and_neg)
% 0.43/0.60  (step t25.t14 (cl (and (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule resolution :premises (t25.t13 t25.a1 t25.a0))
% 0.43/0.60  (step t25.t15 (cl (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule resolution :premises (t25.t12 t25.t14))
% 0.43/0.60  (step t25 (cl (not (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule subproof :discharge (t25.a0 t25.a1))
% 0.43/0.60  (step t26 (cl (not (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule and_pos)
% 0.43/0.60  (step t27 (cl (not (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule and_pos)
% 0.43/0.60  (step t28 (cl (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (not (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (not (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))))) :rule resolution :premises (t25 t26 t27))
% 0.43/0.60  (step t29 (cl (not (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (not (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule reordering :premises (t28))
% 0.43/0.60  (step t30 (cl (not (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule contraction :premises (t29))
% 0.43/0.60  (step t31 (cl (=> (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule resolution :premises (t24 t30))
% 0.43/0.60  (step t32 (cl (=> (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule implies_neg2)
% 0.43/0.60  (step t33 (cl (=> (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (=> (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule resolution :premises (t31 t32))
% 0.43/0.60  (step t34 (cl (=> (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule contraction :premises (t33))
% 0.43/0.60  (step t35 (cl (not (and (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule implies :premises (t34))
% 0.43/0.60  (step t36 (cl (not (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule resolution :premises (t23 t35))
% 0.43/0.60  (step t37 (cl (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (not (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule reordering :premises (t36))
% 0.43/0.60  (step t38 (cl (not (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule or_pos)
% 0.43/0.60  (step t39 (cl (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)) (not (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))))) :rule reordering :premises (t38))
% 0.43/0.60  (step t40 (cl (not (= (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))))) (not (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))))) :rule equiv_pos2)
% 0.43/0.60  (step t41 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))))) :rule refl)
% 0.43/0.60  (step t42 (cl (= (not (tptp.organization tptp.sk1)) (not (tptp.organization tptp.sk1)))) :rule refl)
% 0.43/0.60  (step t43 (cl (= (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule all_simplify)
% 0.43/0.60  (step t44 (cl (= (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))))) :rule cong :premises (t42 t43))
% 0.43/0.60  (step t45 (cl (= (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))))) :rule cong :premises (t41 t44))
% 0.43/0.60  (step t46 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t47)
% 0.43/0.60  (assume t47.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))))
% 0.43/0.60  (step t47.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3))))) :rule forall_inst :args ((:= A tptp.sk1) (:= B tptp.sk2) (:= C tptp.sk3)))
% 0.43/0.60  (step t47.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3)))) :rule or :premises (t47.t1))
% 0.43/0.60  (step t47.t3 (cl (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3)))) :rule resolution :premises (t47.t2 t47.a0))
% 0.43/0.60  (step t47 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3)))) :rule subproof :discharge (t47.a0))
% 0.43/0.60  (step t48 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3)))) :rule resolution :premises (t46 t47))
% 0.43/0.60  (step t49 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3)))) (not (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3))))) :rule implies_neg2)
% 0.43/0.60  (step t50 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3))))) :rule resolution :premises (t48 t49))
% 0.43/0.60  (step t51 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk3))))) :rule contraction :premises (t50))
% 0.43/0.60  (step t52 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))))) :rule resolution :premises (t40 t45 t51))
% 0.43/0.60  (step t53 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))))) (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule implies :premises (t52))
% 0.43/0.60  (step t54 (cl (or (not (tptp.organization tptp.sk1)) (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule resolution :premises (t53 a20))
% 0.43/0.60  (step t55 (cl (= (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule resolution :premises (t39 a23 t54))
% 0.43/0.60  (step t56 (cl (=> (forall ((B $$unsorted)) (tptp.smaller_or_equal B B)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (forall ((B $$unsorted)) (tptp.smaller_or_equal B B))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t57)
% 0.43/0.60  (assume t57.a0 (forall ((B $$unsorted)) (tptp.smaller_or_equal B B)))
% 0.43/0.60  (step t57.t1 (cl (or (not (forall ((B $$unsorted)) (tptp.smaller_or_equal B B))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule forall_inst :args ((:= B (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))))
% 0.43/0.60  (step t57.t2 (cl (not (forall ((B $$unsorted)) (tptp.smaller_or_equal B B))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule or :premises (t57.t1))
% 0.43/0.60  (step t57.t3 (cl (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule resolution :premises (t57.t2 t57.a0))
% 0.43/0.60  (step t57 (cl (not (forall ((B $$unsorted)) (tptp.smaller_or_equal B B))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule subproof :discharge (t57.a0))
% 0.43/0.60  (step t58 (cl (=> (forall ((B $$unsorted)) (tptp.smaller_or_equal B B)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule resolution :premises (t56 t57))
% 0.43/0.60  (step t59 (cl (=> (forall ((B $$unsorted)) (tptp.smaller_or_equal B B)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule implies_neg2)
% 0.43/0.60  (step t60 (cl (=> (forall ((B $$unsorted)) (tptp.smaller_or_equal B B)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (=> (forall ((B $$unsorted)) (tptp.smaller_or_equal B B)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule resolution :premises (t58 t59))
% 0.43/0.60  (step t61 (cl (=> (forall ((B $$unsorted)) (tptp.smaller_or_equal B B)) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2)))) :rule contraction :premises (t60))
% 0.43/0.60  (step t62 (cl (not (forall ((B $$unsorted)) (tptp.smaller_or_equal B B))) (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule implies :premises (t61))
% 0.43/0.60  (step t63 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (= A B)) (tptp.smaller_or_equal A B))) (forall ((B $$unsorted)) (tptp.smaller_or_equal B B)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (= A B)) (tptp.smaller_or_equal A B)))) (forall ((B $$unsorted)) (tptp.smaller_or_equal B B))) :rule equiv_pos2)
% 0.43/0.60  (step t64 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (= A B)) (tptp.smaller_or_equal A B))) (forall ((B $$unsorted)) (or (not (= B B)) (tptp.smaller_or_equal B B))))) :rule all_simplify)
% 0.43/0.60  (anchor :step t65 :args ((B $$unsorted) (:= B B)))
% 0.43/0.60  (step t65.t1 (cl (= B B)) :rule refl)
% 0.43/0.60  (step t65.t2 (cl (= (= B B) true)) :rule all_simplify)
% 0.43/0.60  (step t65.t3 (cl (= (not (= B B)) (not true))) :rule cong :premises (t65.t2))
% 0.43/0.60  (step t65.t4 (cl (= (not true) false)) :rule all_simplify)
% 0.43/0.60  (step t65.t5 (cl (= (not (= B B)) false)) :rule trans :premises (t65.t3 t65.t4))
% 0.43/0.60  (step t65.t6 (cl (= (tptp.smaller_or_equal B B) (tptp.smaller_or_equal B B))) :rule refl)
% 0.43/0.60  (step t65.t7 (cl (= (or (not (= B B)) (tptp.smaller_or_equal B B)) (or false (tptp.smaller_or_equal B B)))) :rule cong :premises (t65.t5 t65.t6))
% 0.43/0.60  (step t65.t8 (cl (= (or false (tptp.smaller_or_equal B B)) (tptp.smaller_or_equal B B))) :rule all_simplify)
% 0.43/0.60  (step t65.t9 (cl (= (or (not (= B B)) (tptp.smaller_or_equal B B)) (tptp.smaller_or_equal B B))) :rule trans :premises (t65.t7 t65.t8))
% 0.43/0.60  (step t65 (cl (= (forall ((B $$unsorted)) (or (not (= B B)) (tptp.smaller_or_equal B B))) (forall ((B $$unsorted)) (tptp.smaller_or_equal B B)))) :rule bind)
% 0.43/0.60  (step t66 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (= A B)) (tptp.smaller_or_equal A B))) (forall ((B $$unsorted)) (tptp.smaller_or_equal B B)))) :rule trans :premises (t64 t65))
% 0.43/0.60  (step t67 (cl (forall ((B $$unsorted)) (tptp.smaller_or_equal B B))) :rule resolution :premises (t63 t66 a2))
% 0.43/0.60  (step t68 (cl (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk2) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule resolution :premises (t62 t67))
% 0.43/0.60  (step t69 (cl (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) :rule resolution :premises (t37 t55 t68))
% 0.43/0.60  (step t70 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C))))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t71)
% 0.43/0.60  (assume t71.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C)))))
% 0.43/0.60  (step t71.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C))))) (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))))) :rule forall_inst :args ((:= A tptp.sk1) (:= B tptp.sk3) (:= C tptp.sk2)))
% 0.43/0.60  (step t71.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C))))) (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2)))) :rule or :premises (t71.t1))
% 0.43/0.60  (step t71.t3 (cl (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2)))) :rule resolution :premises (t71.t2 t71.a0))
% 0.43/0.60  (step t71 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C))))) (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2)))) :rule subproof :discharge (t71.a0))
% 0.43/0.60  (step t72 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2)))) :rule resolution :premises (t70 t71))
% 0.43/0.60  (step t73 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2)))) (not (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))))) :rule implies_neg2)
% 0.43/0.60  (step t74 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))))) :rule resolution :premises (t72 t73))
% 0.43/0.60  (step t75 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C)))) (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))))) :rule contraction :premises (t74))
% 0.43/0.60  (step t76 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge A B) (tptp.stock_of_knowledge A C))) (not (tptp.greater (tptp.internal_friction A B) (tptp.internal_friction A C))) (tptp.smaller (tptp.capability A B) (tptp.capability A C))))) (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2)))) :rule implies :premises (t75))
% 0.43/0.60  (step t77 (cl (or (not (tptp.organization tptp.sk1)) (not (tptp.smaller_or_equal (tptp.stock_of_knowledge tptp.sk1 tptp.sk3) (tptp.stock_of_knowledge tptp.sk1 tptp.sk2))) (not (tptp.greater (tptp.internal_friction tptp.sk1 tptp.sk3) (tptp.internal_friction tptp.sk1 tptp.sk2))) (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2)))) :rule resolution :premises (t76 a16))
% 0.43/0.60  (step t78 (cl (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) :rule resolution :premises (t11 a23 t22 t69 t77))
% 0.43/0.60  (step t79 (cl (not (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)))) (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) :rule or_pos)
% 0.43/0.60  (step t80 (cl (not (tptp.organization tptp.sk1)) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)) (tptp.has_immunity tptp.sk1 tptp.sk3) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (not (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))))) :rule reordering :premises (t79))
% 0.43/0.60  (step t81 (cl (not (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)))) (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2))) :rule or_pos)
% 0.43/0.60  (step t82 (cl (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)) (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (not (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2))))) :rule reordering :premises (t81))
% 0.43/0.60  (step t83 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))) (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A)))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t84)
% 0.43/0.60  (assume t84.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))))
% 0.43/0.60  (step t84.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A)))) (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2))))) :rule forall_inst :args ((:= A (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)) (:= B (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))))
% 0.43/0.60  (step t84.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A)))) (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)))) :rule or :premises (t84.t1))
% 0.43/0.60  (step t84.t3 (cl (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)))) :rule resolution :premises (t84.t2 t84.a0))
% 0.43/0.60  (step t84 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A)))) (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)))) :rule subproof :discharge (t84.a0))
% 0.43/0.60  (step t85 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))) (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)))) (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)))) :rule resolution :premises (t83 t84))
% 0.43/0.60  (step t86 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))) (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)))) (not (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2))))) :rule implies_neg2)
% 0.43/0.60  (step t87 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))) (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))) (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2))))) :rule resolution :premises (t85 t86))
% 0.43/0.60  (step t88 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A))) (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2))))) :rule contraction :premises (t87))
% 0.43/0.60  (step t89 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.smaller A B)) (tptp.greater B A)))) (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)))) :rule implies :premises (t88))
% 0.43/0.60  (step t90 (cl (or (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))) (tptp.greater (tptp.hazard_of_mortality tptp.sk1 tptp.sk3) (tptp.hazard_of_mortality tptp.sk1 tptp.sk2)))) :rule resolution :premises (t89 a6))
% 0.43/0.60  (step t91 (cl (not (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)))) :rule resolution :premises (t82 a26 t90))
% 0.43/0.60  (step t92 (cl (not (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3)))) (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3))) :rule or_pos)
% 0.43/0.60  (step t93 (cl (tptp.has_endowment tptp.sk1) (not (tptp.organization tptp.sk1)) (not (tptp.has_immunity tptp.sk1 tptp.sk3)) (not (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3))))) :rule reordering :premises (t92))
% 0.43/0.60  (step t94 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B))))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t95)
% 0.43/0.60  (assume t95.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))))
% 0.43/0.60  (step t95.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B))))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3))))) :rule forall_inst :args ((:= A tptp.sk1) (:= B tptp.sk3)))
% 0.43/0.60  (step t95.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B))))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3)))) :rule or :premises (t95.t1))
% 0.43/0.60  (step t95.t3 (cl (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3)))) :rule resolution :premises (t95.t2 t95.a0))
% 0.43/0.60  (step t95 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B))))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3)))) :rule subproof :discharge (t95.a0))
% 0.43/0.60  (step t96 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3)))) :rule resolution :premises (t94 t95))
% 0.43/0.60  (step t97 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3)))) (not (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3))))) :rule implies_neg2)
% 0.43/0.60  (step t98 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3))))) :rule resolution :premises (t96 t97))
% 0.43/0.60  (step t99 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3))))) :rule contraction :premises (t98))
% 0.43/0.60  (step t100 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B))))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3)))) :rule implies :premises (t99))
% 0.43/0.60  (step t101 (cl (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk3)))) :rule resolution :premises (t100 a11))
% 0.43/0.60  (step t102 (cl (not (tptp.has_immunity tptp.sk1 tptp.sk3))) :rule resolution :premises (t93 a24 a23 t101))
% 0.43/0.60  (step t103 (cl (not (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2)))) (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2))) :rule or_pos)
% 0.43/0.60  (step t104 (cl (tptp.has_endowment tptp.sk1) (not (tptp.organization tptp.sk1)) (not (tptp.has_immunity tptp.sk1 tptp.sk2)) (not (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2))))) :rule reordering :premises (t103))
% 0.43/0.60  (step t105 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B))))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t106)
% 0.43/0.60  (assume t106.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))))
% 0.43/0.60  (step t106.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B))))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2))))) :rule forall_inst :args ((:= A tptp.sk1) (:= B tptp.sk2)))
% 0.43/0.60  (step t106.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B))))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2)))) :rule or :premises (t106.t1))
% 0.43/0.60  (step t106.t3 (cl (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2)))) :rule resolution :premises (t106.t2 t106.a0))
% 0.43/0.60  (step t106 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B))))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2)))) :rule subproof :discharge (t106.a0))
% 0.43/0.60  (step t107 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2)))) :rule resolution :premises (t105 t106))
% 0.43/0.60  (step t108 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2)))) (not (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2))))) :rule implies_neg2)
% 0.43/0.60  (step t109 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2))))) :rule resolution :premises (t107 t108))
% 0.43/0.60  (step t110 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2))))) :rule contraction :premises (t109))
% 0.43/0.60  (step t111 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organization A)) (tptp.has_endowment A) (not (tptp.has_immunity A B))))) (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2)))) :rule implies :premises (t110))
% 0.43/0.60  (step t112 (cl (or (not (tptp.organization tptp.sk1)) (tptp.has_endowment tptp.sk1) (not (tptp.has_immunity tptp.sk1 tptp.sk2)))) :rule resolution :premises (t111 a11))
% 0.43/0.60  (step t113 (cl (not (tptp.has_immunity tptp.sk1 tptp.sk2))) :rule resolution :premises (t104 a24 a23 t112))
% 0.43/0.60  (step t114 (cl (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (not (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) :rule and_neg)
% 0.43/0.60  (step t115 (cl (=> (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t116)
% 0.43/0.60  (assume t116.a0 (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))
% 0.43/0.60  (assume t116.a1 (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))
% 0.43/0.60  (step t116.t1 (cl (=> (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t116.t2)
% 0.43/0.60  (assume t116.t2.a0 (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))
% 0.43/0.60  (assume t116.t2.a1 (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))
% 0.43/0.60  (step t116.t2.t1 (cl (= (= (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)) true) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)))) :rule equiv_simplify)
% 0.43/0.60  (step t116.t2.t2 (cl (not (= (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)) true)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule equiv1 :premises (t116.t2.t1))
% 0.43/0.60  (step t116.t2.t3 (cl (= (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) :rule refl)
% 0.43/0.60  (step t116.t2.t4 (cl (= (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule symm :premises (t116.t2.a1))
% 0.43/0.60  (step t116.t2.t5 (cl (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) :rule symm :premises (t116.t2.t4))
% 0.43/0.60  (step t116.t2.t6 (cl (= (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) :rule cong :premises (t116.t2.t3 t116.t2.t5))
% 0.43/0.60  (step t116.t2.t7 (cl (= (= (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) true) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) :rule equiv_simplify)
% 0.43/0.60  (step t116.t2.t8 (cl (= (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) true) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) :rule equiv2 :premises (t116.t2.t7))
% 0.43/0.60  (step t116.t2.t9 (cl (= (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) true)) :rule resolution :premises (t116.t2.t8 t116.t2.a0))
% 0.43/0.60  (step t116.t2.t10 (cl (= (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)) true)) :rule trans :premises (t116.t2.t6 t116.t2.t9))
% 0.43/0.60  (step t116.t2.t11 (cl (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule resolution :premises (t116.t2.t2 t116.t2.t10))
% 0.43/0.60  (step t116.t2 (cl (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (not (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule subproof :discharge (t116.t2.a0 t116.t2.a1))
% 0.43/0.60  (step t116.t3 (cl (not (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) :rule and_pos)
% 0.43/0.60  (step t116.t4 (cl (not (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) :rule and_pos)
% 0.43/0.60  (step t116.t5 (cl (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)) (not (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) (not (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))))) :rule resolution :premises (t116.t2 t116.t3 t116.t4))
% 0.43/0.60  (step t116.t6 (cl (not (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) (not (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule reordering :premises (t116.t5))
% 0.43/0.60  (step t116.t7 (cl (not (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule contraction :premises (t116.t6))
% 0.43/0.60  (step t116.t8 (cl (=> (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule resolution :premises (t116.t1 t116.t7))
% 0.43/0.60  (step t116.t9 (cl (=> (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)))) :rule implies_neg2)
% 0.43/0.60  (step t116.t10 (cl (=> (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (=> (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)))) :rule resolution :premises (t116.t8 t116.t9))
% 0.43/0.60  (step t116.t11 (cl (=> (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)))) :rule contraction :premises (t116.t10))
% 0.43/0.60  (step t116.t12 (cl (not (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule implies :premises (t116.t11))
% 0.43/0.60  (step t116.t13 (cl (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (not (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) :rule and_neg)
% 0.43/0.60  (step t116.t14 (cl (and (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) :rule resolution :premises (t116.t13 t116.a1 t116.a0))
% 0.43/0.60  (step t116.t15 (cl (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule resolution :premises (t116.t12 t116.t14))
% 0.43/0.60  (step t116 (cl (not (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule subproof :discharge (t116.a0 t116.a1))
% 0.43/0.60  (step t117 (cl (not (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) :rule and_pos)
% 0.43/0.60  (step t118 (cl (not (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) :rule and_pos)
% 0.43/0.60  (step t119 (cl (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)) (not (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) (not (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))))) :rule resolution :premises (t116 t117 t118))
% 0.43/0.60  (step t120 (cl (not (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) (not (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule reordering :premises (t119))
% 0.43/0.60  (step t121 (cl (not (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule contraction :premises (t120))
% 0.43/0.60  (step t122 (cl (=> (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule resolution :premises (t115 t121))
% 0.43/0.60  (step t123 (cl (=> (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)))) :rule implies_neg2)
% 0.43/0.60  (step t124 (cl (=> (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (=> (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)))) :rule resolution :premises (t122 t123))
% 0.43/0.60  (step t125 (cl (=> (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)))) :rule contraction :premises (t124))
% 0.43/0.60  (step t126 (cl (not (and (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule implies :premises (t125))
% 0.43/0.60  (step t127 (cl (not (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule resolution :premises (t114 t126))
% 0.43/0.60  (step t128 (cl (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3)) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (not (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) :rule reordering :premises (t127))
% 0.43/0.60  (step t129 (cl (=> (forall ((B $$unsorted)) (tptp.greater_or_equal B B)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (forall ((B $$unsorted)) (tptp.greater_or_equal B B))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t130)
% 0.43/0.60  (assume t130.a0 (forall ((B $$unsorted)) (tptp.greater_or_equal B B)))
% 0.43/0.60  (step t130.t1 (cl (or (not (forall ((B $$unsorted)) (tptp.greater_or_equal B B))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) :rule forall_inst :args ((:= B (tptp.position tptp.sk1 tptp.sk2))))
% 0.43/0.60  (step t130.t2 (cl (not (forall ((B $$unsorted)) (tptp.greater_or_equal B B))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) :rule or :premises (t130.t1))
% 0.43/0.60  (step t130.t3 (cl (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) :rule resolution :premises (t130.t2 t130.a0))
% 0.43/0.60  (step t130 (cl (not (forall ((B $$unsorted)) (tptp.greater_or_equal B B))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) :rule subproof :discharge (t130.a0))
% 0.43/0.60  (step t131 (cl (=> (forall ((B $$unsorted)) (tptp.greater_or_equal B B)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) :rule resolution :premises (t129 t130))
% 0.43/0.60  (step t132 (cl (=> (forall ((B $$unsorted)) (tptp.greater_or_equal B B)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) :rule implies_neg2)
% 0.43/0.60  (step t133 (cl (=> (forall ((B $$unsorted)) (tptp.greater_or_equal B B)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) (=> (forall ((B $$unsorted)) (tptp.greater_or_equal B B)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) :rule resolution :premises (t131 t132))
% 0.43/0.60  (step t134 (cl (=> (forall ((B $$unsorted)) (tptp.greater_or_equal B B)) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2)))) :rule contraction :premises (t133))
% 0.43/0.60  (step t135 (cl (not (forall ((B $$unsorted)) (tptp.greater_or_equal B B))) (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) :rule implies :premises (t134))
% 0.43/0.60  (step t136 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (= A B)) (tptp.greater_or_equal A B))) (forall ((B $$unsorted)) (tptp.greater_or_equal B B)))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (= A B)) (tptp.greater_or_equal A B)))) (forall ((B $$unsorted)) (tptp.greater_or_equal B B))) :rule equiv_pos2)
% 0.43/0.60  (step t137 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (= A B)) (tptp.greater_or_equal A B))) (forall ((B $$unsorted)) (or (not (= B B)) (tptp.greater_or_equal B B))))) :rule all_simplify)
% 0.43/0.60  (anchor :step t138 :args ((B $$unsorted) (:= B B)))
% 0.43/0.60  (step t138.t1 (cl (= B B)) :rule refl)
% 0.43/0.60  (step t138.t2 (cl (= (= B B) true)) :rule all_simplify)
% 0.43/0.60  (step t138.t3 (cl (= (not (= B B)) (not true))) :rule cong :premises (t138.t2))
% 0.43/0.60  (step t138.t4 (cl (= (not true) false)) :rule all_simplify)
% 0.43/0.60  (step t138.t5 (cl (= (not (= B B)) false)) :rule trans :premises (t138.t3 t138.t4))
% 0.43/0.60  (step t138.t6 (cl (= (tptp.greater_or_equal B B) (tptp.greater_or_equal B B))) :rule refl)
% 0.43/0.60  (step t138.t7 (cl (= (or (not (= B B)) (tptp.greater_or_equal B B)) (or false (tptp.greater_or_equal B B)))) :rule cong :premises (t138.t5 t138.t6))
% 0.43/0.60  (step t138.t8 (cl (= (or false (tptp.greater_or_equal B B)) (tptp.greater_or_equal B B))) :rule all_simplify)
% 0.43/0.60  (step t138.t9 (cl (= (or (not (= B B)) (tptp.greater_or_equal B B)) (tptp.greater_or_equal B B))) :rule trans :premises (t138.t7 t138.t8))
% 0.43/0.60  (step t138 (cl (= (forall ((B $$unsorted)) (or (not (= B B)) (tptp.greater_or_equal B B))) (forall ((B $$unsorted)) (tptp.greater_or_equal B B)))) :rule bind)
% 0.43/0.60  (step t139 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (= A B)) (tptp.greater_or_equal A B))) (forall ((B $$unsorted)) (tptp.greater_or_equal B B)))) :rule trans :premises (t137 t138))
% 0.43/0.60  (step t140 (cl (forall ((B $$unsorted)) (tptp.greater_or_equal B B))) :rule resolution :premises (t136 t139 a5))
% 0.43/0.60  (step t141 (cl (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk2))) :rule resolution :premises (t135 t140))
% 0.43/0.60  (step t142 (cl (not (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) :rule or_pos)
% 0.43/0.60  (step t143 (cl (not (tptp.organization tptp.sk1)) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (not (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))))) :rule reordering :premises (t142))
% 0.43/0.60  (step t144 (cl (not (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2)))) (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) :rule or_pos)
% 0.43/0.60  (step t145 (cl (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2)) (not (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))))) :rule reordering :premises (t144))
% 0.43/0.60  (step t146 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C))))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t147)
% 0.43/0.60  (assume t147.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C)))))
% 0.43/0.60  (step t147.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C))))) (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))))) :rule forall_inst :args ((:= A tptp.sk1) (:= B tptp.sk3) (:= C tptp.sk2)))
% 0.43/0.60  (step t147.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C))))) (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2)))) :rule or :premises (t147.t1))
% 0.43/0.60  (step t147.t3 (cl (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2)))) :rule resolution :premises (t147.t2 t147.a0))
% 0.43/0.60  (step t147 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C))))) (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2)))) :rule subproof :discharge (t147.a0))
% 0.43/0.60  (step t148 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2)))) :rule resolution :premises (t146 t147))
% 0.43/0.60  (step t149 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2)))) (not (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))))) :rule implies_neg2)
% 0.43/0.60  (step t150 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))))) :rule resolution :premises (t148 t149))
% 0.43/0.60  (step t151 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C)))) (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))))) :rule contraction :premises (t150))
% 0.43/0.60  (step t152 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (= (tptp.external_ties A B) (tptp.external_ties A C))))) (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2)))) :rule implies :premises (t151))
% 0.43/0.60  (step t153 (cl (or (not (tptp.organization tptp.sk1)) (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2)))) :rule resolution :premises (t152 a21))
% 0.43/0.60  (step t154 (cl (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) :rule resolution :premises (t145 a23 t153))
% 0.43/0.60  (step t155 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C)))) (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C))))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t156)
% 0.43/0.60  (assume t156.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C)))))
% 0.43/0.60  (step t156.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C))))) (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))))) :rule forall_inst :args ((:= A tptp.sk1) (:= B tptp.sk3) (:= C tptp.sk2)))
% 0.43/0.60  (step t156.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C))))) (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) :rule or :premises (t156.t1))
% 0.43/0.60  (step t156.t3 (cl (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) :rule resolution :premises (t156.t2 t156.a0))
% 0.43/0.60  (step t156 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C))))) (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) :rule subproof :discharge (t156.a0))
% 0.43/0.60  (step t157 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C)))) (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) :rule resolution :premises (t155 t156))
% 0.43/0.60  (step t158 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C)))) (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) (not (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))))) :rule implies_neg2)
% 0.43/0.60  (step t159 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C)))) (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C)))) (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))))) :rule resolution :premises (t157 t158))
% 0.43/0.60  (step t160 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C)))) (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))))) :rule contraction :premises (t159))
% 0.43/0.60  (step t161 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (not (= (tptp.external_ties A B) (tptp.external_ties A C))) (= (tptp.position A B) (tptp.position A C))))) (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) :rule implies :premises (t160))
% 0.43/0.60  (step t162 (cl (or (not (tptp.organization tptp.sk1)) (not (= (tptp.external_ties tptp.sk1 tptp.sk3) (tptp.external_ties tptp.sk1 tptp.sk2))) (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2)))) :rule resolution :premises (t161 a19))
% 0.43/0.60  (step t163 (cl (= (tptp.position tptp.sk1 tptp.sk3) (tptp.position tptp.sk1 tptp.sk2))) :rule resolution :premises (t143 a23 t154 t162))
% 0.43/0.60  (step t164 (cl (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) :rule resolution :premises (t128 t141 t163))
% 0.43/0.60  (step t165 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B))))) :rule implies_neg1)
% 0.43/0.60  (anchor :step t166)
% 0.43/0.60  (assume t166.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B)))))
% 0.43/0.60  (step t166.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B))))) (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))))) :rule forall_inst :args ((:= A tptp.sk1) (:= B tptp.sk3) (:= C tptp.sk2)))
% 0.43/0.60  (step t166.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B))))) (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)))) :rule or :premises (t166.t1))
% 0.43/0.60  (step t166.t3 (cl (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)))) :rule resolution :premises (t166.t2 t166.a0))
% 0.43/0.60  (step t166 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B))))) (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)))) :rule subproof :discharge (t166.a0))
% 0.43/0.60  (step t167 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)))) :rule resolution :premises (t165 t166))
% 0.43/0.60  (step t168 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)))) (not (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))))) :rule implies_neg2)
% 0.43/0.60  (step t169 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))))) :rule resolution :premises (t167 t168))
% 0.43/0.60  (step t170 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B)))) (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3))))) :rule contraction :premises (t169))
% 0.43/0.60  (step t171 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.organization A)) (tptp.has_immunity A B) (tptp.has_immunity A C) (not (tptp.greater (tptp.capability A C) (tptp.capability A B))) (not (tptp.greater_or_equal (tptp.position A C) (tptp.position A B))) (tptp.smaller (tptp.hazard_of_mortality A C) (tptp.hazard_of_mortality A B))))) (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)))) :rule implies :premises (t170))
% 0.43/0.60  (step t172 (cl (or (not (tptp.organization tptp.sk1)) (tptp.has_immunity tptp.sk1 tptp.sk3) (tptp.has_immunity tptp.sk1 tptp.sk2) (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))) (not (tptp.greater_or_equal (tptp.position tptp.sk1 tptp.sk2) (tptp.position tptp.sk1 tptp.sk3))) (tptp.smaller (tptp.hazard_of_mortality tptp.sk1 tptp.sk2) (tptp.hazard_of_mortality tptp.sk1 tptp.sk3)))) :rule resolution :premises (t171 a12))
% 0.43/0.60  (step t173 (cl (not (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3)))) :rule resolution :premises (t80 a23 t91 t102 t113 t164 t172))
% 0.43/0.60  (step t174 (cl (not (or (not (tptp.smaller (tptp.capability tptp.sk1 tptp.sk3) (tptp.capability tptp.sk1 tptp.sk2))) (tptp.greater (tptp.capability tptp.sk1 tptp.sk2) (tptp.capability tptp.sk1 tptp.sk3))))) :rule resolution :premises (t9 t78 t173))
% 0.43/0.60  (step t175 (cl) :rule resolution :premises (t7 t174 a6))
% 0.43/0.60  
% 0.43/0.60  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.oGRnoHF6AV/cvc5---1.0.5_14446.smt2
% 0.43/0.60  % cvc5---1.0.5 exiting
% 0.43/0.60  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------