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

% Computer : n016.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 16:45:03 EDT 2024

% Result   : Unsatisfiable 41.40s 41.60s
% Output   : Proof 41.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15  % Problem    : GEO088-1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.17  % Command    : do_cvc5 %s %d
% 0.16/0.38  % Computer : n016.cluster.edu
% 0.16/0.38  % Model    : x86_64 x86_64
% 0.16/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38  % Memory   : 8042.1875MB
% 0.16/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38  % CPULimit   : 300
% 0.16/0.38  % WCLimit    : 300
% 0.16/0.38  % DateTime   : Mon May 27 07:29:54 EDT 2024
% 0.16/0.39  % CPUTime    : 
% 0.23/0.56  %----Proving TF0_NAR, FOF, or CNF
% 0.23/0.57  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.54/10.76  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.54/15.80  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.61/20.83  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.65/25.86  --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 30.70/30.95  --- Run --trigger-sel=max --full-saturate-quant at 5...
% 35.83/36.03  --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 5...
% 40.85/41.10  --- Run --multi-trigger-cache --full-saturate-quant at 5...
% 41.40/41.60  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.RfTpxzUuRo/cvc5---1.0.5_14411.smt2
% 41.40/41.60  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.RfTpxzUuRo/cvc5---1.0.5_14411.smt2
% 41.40/41.61  (assume a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))))
% 41.40/41.61  (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))))
% 41.40/41.61  (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))))
% 41.40/41.61  (assume a3 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (= A (tptp.sum B C))) (not (tptp.incident_c D A)) (tptp.incident_c D B) (tptp.incident_c D C))))
% 41.40/41.61  (assume a4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (= A (tptp.sum B C))) (not (tptp.incident_c D B)) (tptp.incident_c D A))))
% 41.40/41.61  (assume a5 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (= A (tptp.sum B C))) (not (tptp.incident_c D C)) (tptp.incident_c D A))))
% 41.40/41.61  (assume a6 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk2 A B C) C) (tptp.incident_c (tptp.ax0_sk2 A B C) B) (tptp.incident_c (tptp.ax0_sk2 A B C) A) (= C (tptp.sum B A)))))
% 41.40/41.61  (assume a7 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk2 A B C) C) (not (tptp.incident_c (tptp.ax0_sk2 A B C) C)) (= C (tptp.sum B A)))))
% 41.40/41.61  (assume a8 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk2 A B C) B)) (tptp.incident_c (tptp.ax0_sk2 A B C) B) (tptp.incident_c (tptp.ax0_sk2 A B C) A) (= C (tptp.sum B A)))))
% 41.40/41.61  (assume a9 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk2 A B C) A)) (tptp.incident_c (tptp.ax0_sk2 A B C) B) (tptp.incident_c (tptp.ax0_sk2 A B C) A) (= C (tptp.sum B A)))))
% 41.40/41.61  (assume a10 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk2 A B C) B)) (not (tptp.incident_c (tptp.ax0_sk2 A B C) C)) (= C (tptp.sum B A)))))
% 41.40/41.61  (assume a11 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk2 A B C) A)) (not (tptp.incident_c (tptp.ax0_sk2 A B C) C)) (= C (tptp.sum B A)))))
% 41.40/41.61  (assume a12 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.end_point A B)) (tptp.incident_c A B))))
% 41.40/41.61  (assume a13 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C))))
% 41.40/41.61  (assume a14 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B))))
% 41.40/41.61  (assume a15 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B))))
% 41.40/41.61  (assume a16 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B))))
% 41.40/41.61  (assume a17 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B))))
% 41.40/41.61  (assume a18 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B))))
% 41.40/41.61  (assume a19 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B))))
% 41.40/41.61  (assume a20 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.inner_point A B)) (tptp.incident_c A B))))
% 41.40/41.61  (assume a21 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.inner_point A B)) (not (tptp.end_point A B)))))
% 41.40/41.61  (assume a22 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.end_point A B) (tptp.inner_point A B))))
% 41.40/41.61  (assume a23 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.meet A B C)) (tptp.incident_c A B))))
% 41.40/41.61  (assume a24 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.meet A B C)) (tptp.incident_c A C))))
% 41.40/41.61  (assume a25 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.meet A B C)) (not (tptp.incident_c D B)) (not (tptp.incident_c D C)) (tptp.end_point D B))))
% 41.40/41.61  (assume a26 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.meet A B C)) (not (tptp.incident_c D B)) (not (tptp.incident_c D C)) (tptp.end_point D C))))
% 41.40/41.61  (assume a27 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.incident_c A C)) (tptp.incident_c (tptp.ax0_sk5 C B A) B) (tptp.meet A B C))))
% 41.40/41.61  (assume a28 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.incident_c A C)) (tptp.incident_c (tptp.ax0_sk5 C B A) C) (tptp.meet A B C))))
% 41.40/41.61  (assume a29 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.incident_c A C)) (not (tptp.end_point (tptp.ax0_sk5 C B A) B)) (not (tptp.end_point (tptp.ax0_sk5 C B A) C)) (tptp.meet A B C))))
% 41.40/41.61  (assume a30 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.closed A)) (not (tptp.end_point B A)))))
% 41.40/41.61  (assume a31 (forall ((A $$unsorted)) (or (tptp.end_point (tptp.ax0_sk6 A) A) (tptp.closed A))))
% 41.40/41.61  (assume a32 (forall ((A $$unsorted)) (or (not (tptp.open A)) (tptp.end_point (tptp.ax0_sk7 A) A))))
% 41.40/41.61  (assume a33 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.end_point A B)) (tptp.open B))))
% 41.40/41.61  (assume a34 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.part_of A B)) (= A B) (tptp.open A))))
% 41.40/41.61  (assume a35 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.end_point E A)) (not (tptp.end_point E C)) (not (tptp.end_point E D)) (tptp.part_of C D) (tptp.part_of D C) (tptp.part_of A C) (tptp.part_of C A) (tptp.part_of A D) (tptp.part_of D A))))
% 41.40/41.61  (assume a36 (forall ((A $$unsorted)) (tptp.inner_point (tptp.ax0_sk8 A) A)))
% 41.40/41.61  (assume a37 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.inner_point A B)) (tptp.meet A (tptp.ax0_sk9 A B) (tptp.ax0_sk10 A B)))))
% 41.40/41.61  (assume a38 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.inner_point A B)) (= B (tptp.sum (tptp.ax0_sk9 A B) (tptp.ax0_sk10 A B))))))
% 41.40/41.61  (assume a39 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.end_point C B)) (not (tptp.end_point D B)) (= A C) (= A D) (= C D))))
% 41.40/41.61  (assume a40 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.end_point A B)) (tptp.end_point (tptp.ax0_sk11 A B) B))))
% 41.40/41.61  (assume a41 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.end_point A B)) (not (= A (tptp.ax0_sk11 A B))))))
% 41.40/41.61  (assume a42 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.closed A)) (not (tptp.meet B C D)) (not (= A (tptp.sum C D))) (not (tptp.end_point E C)) (tptp.meet E C D))))
% 41.40/41.61  (assume a43 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.meet A B C)) (= (tptp.ax0_sk12 C B) (tptp.sum B C)))))
% 41.40/41.61  (assume a44 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk13 A B) B) (tptp.incident_c (tptp.ax0_sk13 A B) A) (= B A))))
% 41.40/41.61  (assume a45 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk13 A B) B) (not (tptp.incident_c (tptp.ax0_sk13 A B) B)) (= B A))))
% 41.40/41.61  (assume a46 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk13 A B) A)) (tptp.incident_c (tptp.ax0_sk13 A B) A) (= B A))))
% 41.40/41.61  (assume a47 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk13 A B) A)) (not (tptp.incident_c (tptp.ax0_sk13 A B) B)) (= B A))))
% 41.40/41.61  (assume a48 (tptp.part_of tptp.sk15 tptp.sk14))
% 41.40/41.61  (assume a49 (tptp.end_point tptp.sk16 tptp.sk14))
% 41.40/41.61  (assume a50 (tptp.incident_c tptp.sk16 tptp.sk15))
% 41.40/41.61  (assume a51 (not (tptp.end_point tptp.sk16 tptp.sk15)))
% 41.40/41.61  (step t1 (cl (not (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) :rule or_pos)
% 41.40/41.61  (step t2 (cl (not (tptp.part_of tptp.sk15 tptp.sk14)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (not (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)))) :rule reordering :premises (t1))
% 41.40/41.61  (step t3 (cl (not (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) :rule or_pos)
% 41.40/41.61  (step t4 (cl (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15) (not (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)))) :rule reordering :premises (t3))
% 41.40/41.61  (step t5 (cl (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15)) :rule or_pos)
% 41.40/41.61  (step t6 (cl (tptp.end_point tptp.sk16 tptp.sk15) (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule reordering :premises (t5))
% 41.40/41.61  (step t7 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t8)
% 41.40/41.61  (assume t8.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B))))
% 41.40/41.61  (step t8.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule forall_inst :args ((:= A tptp.sk16) (:= B tptp.sk15)))
% 41.40/41.61  (step t8.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) :rule or :premises (t8.t1))
% 41.40/41.61  (step t8.t3 (cl (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t8.t2 t8.a0))
% 41.40/41.61  (step t8 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) :rule subproof :discharge (t8.a0))
% 41.40/41.61  (step t9 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t7 t8))
% 41.40/41.61  (step t10 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule implies_neg2)
% 41.40/41.61  (step t11 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule resolution :premises (t9 t10))
% 41.40/41.61  (step t12 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule contraction :premises (t11))
% 41.40/41.61  (step t13 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) :rule implies :premises (t12))
% 41.40/41.61  (step t14 (cl (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t13 a14))
% 41.40/41.61  (step t15 (cl (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) :rule resolution :premises (t6 a51 a50 t14))
% 41.40/41.61  (step t16 (cl (not (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) :rule or_pos)
% 41.40/41.61  (step t17 (cl (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (not (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule reordering :premises (t16))
% 41.40/41.61  (step t18 (cl (not (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)))) (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) :rule or_pos)
% 41.40/41.61  (step t19 (cl (not (tptp.end_point tptp.sk16 tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))))) :rule reordering :premises (t18))
% 41.40/41.61  (step t20 (cl (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15)) :rule or_pos)
% 41.40/41.61  (step t21 (cl (tptp.end_point tptp.sk16 tptp.sk15) (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule reordering :premises (t20))
% 41.40/41.61  (step t22 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t23)
% 41.40/41.61  (assume t23.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B))))
% 41.40/41.61  (step t23.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule forall_inst :args ((:= A tptp.sk16) (:= B tptp.sk15)))
% 41.40/41.61  (step t23.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) :rule or :premises (t23.t1))
% 41.40/41.61  (step t23.t3 (cl (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t23.t2 t23.a0))
% 41.40/41.61  (step t23 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) :rule subproof :discharge (t23.a0))
% 41.40/41.61  (step t24 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t22 t23))
% 41.40/41.61  (step t25 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule implies_neg2)
% 41.40/41.61  (step t26 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule resolution :premises (t24 t25))
% 41.40/41.61  (step t27 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule contraction :premises (t26))
% 41.40/41.61  (step t28 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) :rule implies :premises (t27))
% 41.40/41.61  (step t29 (cl (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t28 a18))
% 41.40/41.61  (step t30 (cl (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)))) :rule resolution :premises (t21 a51 a50 t29))
% 41.40/41.61  (step t31 (cl (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15)) :rule or_pos)
% 41.40/41.61  (step t32 (cl (tptp.end_point tptp.sk16 tptp.sk15) (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule reordering :premises (t31))
% 41.40/41.61  (step t33 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t34)
% 41.40/41.61  (assume t34.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B))))
% 41.40/41.61  (step t34.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule forall_inst :args ((:= A tptp.sk16) (:= B tptp.sk15)))
% 41.40/41.61  (step t34.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) :rule or :premises (t34.t1))
% 41.40/41.61  (step t34.t3 (cl (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t34.t2 t34.a0))
% 41.40/41.61  (step t34 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) :rule subproof :discharge (t34.a0))
% 41.40/41.61  (step t35 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t33 t34))
% 41.40/41.61  (step t36 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule implies_neg2)
% 41.40/41.61  (step t37 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule resolution :premises (t35 t36))
% 41.40/41.61  (step t38 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule contraction :premises (t37))
% 41.40/41.61  (step t39 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) :rule implies :premises (t38))
% 41.40/41.61  (step t40 (cl (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t39 a19))
% 41.40/41.61  (step t41 (cl (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)))) :rule resolution :premises (t32 a51 a50 t40))
% 41.40/41.61  (step t42 (cl (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15)) :rule or_pos)
% 41.40/41.61  (step t43 (cl (tptp.end_point tptp.sk16 tptp.sk15) (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule reordering :premises (t42))
% 41.40/41.61  (step t44 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t45)
% 41.40/41.61  (assume t45.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B))))
% 41.40/41.61  (step t45.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule forall_inst :args ((:= A tptp.sk16) (:= B tptp.sk15)))
% 41.40/41.61  (step t45.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) :rule or :premises (t45.t1))
% 41.40/41.61  (step t45.t3 (cl (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t45.t2 t45.a0))
% 41.40/41.61  (step t45 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) :rule subproof :discharge (t45.a0))
% 41.40/41.61  (step t46 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t44 t45))
% 41.40/41.61  (step t47 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule implies_neg2)
% 41.40/41.61  (step t48 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule resolution :premises (t46 t47))
% 41.40/41.61  (step t49 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule contraction :premises (t48))
% 41.40/41.61  (step t50 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) :rule implies :premises (t49))
% 41.40/41.61  (step t51 (cl (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t50 a16))
% 41.40/41.61  (step t52 (cl (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) :rule resolution :premises (t43 a51 a50 t51))
% 41.40/41.61  (step t53 (cl (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15)) :rule or_pos)
% 41.40/41.61  (step t54 (cl (tptp.end_point tptp.sk16 tptp.sk15) (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule reordering :premises (t53))
% 41.40/41.61  (step t55 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t56)
% 41.40/41.61  (assume t56.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B))))
% 41.40/41.61  (step t56.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule forall_inst :args ((:= A tptp.sk16) (:= B tptp.sk15)))
% 41.40/41.61  (step t56.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) :rule or :premises (t56.t1))
% 41.40/41.61  (step t56.t3 (cl (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t56.t2 t56.a0))
% 41.40/41.61  (step t56 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) :rule subproof :discharge (t56.a0))
% 41.40/41.61  (step t57 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t55 t56))
% 41.40/41.61  (step t58 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule implies_neg2)
% 41.40/41.61  (step t59 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule resolution :premises (t57 t58))
% 41.40/41.61  (step t60 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule contraction :premises (t59))
% 41.40/41.61  (step t61 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) :rule implies :premises (t60))
% 41.40/41.61  (step t62 (cl (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t61 a17))
% 41.40/41.61  (step t63 (cl (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) :rule resolution :premises (t54 a51 a50 t62))
% 41.40/41.61  (step t64 (cl (not (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) :rule or_pos)
% 41.40/41.61  (step t65 (cl (not (tptp.part_of tptp.sk15 tptp.sk14)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (not (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)))) :rule reordering :premises (t64))
% 41.40/41.61  (step t66 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t67)
% 41.40/41.61  (assume t67.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))))
% 41.40/41.61  (step t67.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)))) :rule forall_inst :args ((:= A tptp.sk15) (:= B tptp.sk14) (:= C (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))))
% 41.40/41.61  (step t67.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule or :premises (t67.t1))
% 41.40/41.61  (step t67.t3 (cl (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule resolution :premises (t67.t2 t67.a0))
% 41.40/41.61  (step t67 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule subproof :discharge (t67.a0))
% 41.40/41.61  (step t68 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule resolution :premises (t66 t67))
% 41.40/41.61  (step t69 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) (not (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)))) :rule implies_neg2)
% 41.40/41.61  (step t70 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)))) :rule resolution :premises (t68 t69))
% 41.40/41.61  (step t71 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)))) :rule contraction :premises (t70))
% 41.40/41.61  (step t72 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule implies :premises (t71))
% 41.40/41.61  (step t73 (cl (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule resolution :premises (t72 a0))
% 41.40/41.61  (step t74 (cl (not (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) :rule or_pos)
% 41.40/41.61  (step t75 (cl (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15) (not (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)))) :rule reordering :premises (t74))
% 41.40/41.61  (step t76 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t77)
% 41.40/41.61  (assume t77.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))))
% 41.40/41.61  (step t77.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)))) :rule forall_inst :args ((:= A (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (:= B tptp.sk15) (:= C (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))))
% 41.40/41.61  (step t77.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) :rule or :premises (t77.t1))
% 41.40/41.61  (step t77.t3 (cl (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) :rule resolution :premises (t77.t2 t77.a0))
% 41.40/41.61  (step t77 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) :rule subproof :discharge (t77.a0))
% 41.40/41.61  (step t78 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) :rule resolution :premises (t76 t77))
% 41.40/41.61  (step t79 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) (not (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)))) :rule implies_neg2)
% 41.40/41.61  (step t80 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)))) :rule resolution :premises (t78 t79))
% 41.40/41.61  (step t81 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)))) :rule contraction :premises (t80))
% 41.40/41.61  (step t82 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) :rule implies :premises (t81))
% 41.40/41.61  (step t83 (cl (or (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) :rule resolution :premises (t82 a0))
% 41.40/41.61  (step t84 (cl (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15)) :rule or_pos)
% 41.40/41.61  (step t85 (cl (tptp.end_point tptp.sk16 tptp.sk15) (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule reordering :premises (t84))
% 41.40/41.61  (step t86 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t87)
% 41.40/41.61  (assume t87.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B))))
% 41.40/41.61  (step t87.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule forall_inst :args ((:= A tptp.sk16) (:= B tptp.sk15)))
% 41.40/41.61  (step t87.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) :rule or :premises (t87.t1))
% 41.40/41.61  (step t87.t3 (cl (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t87.t2 t87.a0))
% 41.40/41.61  (step t87 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) :rule subproof :discharge (t87.a0))
% 41.40/41.61  (step t88 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t86 t87))
% 41.40/41.61  (step t89 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) (not (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule implies_neg2)
% 41.40/41.61  (step t90 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule resolution :premises (t88 t89))
% 41.40/41.61  (step t91 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15)))) :rule contraction :premises (t90))
% 41.40/41.61  (step t92 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B)))) (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) :rule implies :premises (t91))
% 41.40/41.61  (step t93 (cl (or (not (tptp.incident_c tptp.sk16 tptp.sk15)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15) (tptp.end_point tptp.sk16 tptp.sk15))) :rule resolution :premises (t92 a15))
% 41.40/41.61  (step t94 (cl (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk15)) :rule resolution :premises (t85 a51 a50 t93))
% 41.40/41.61  (step t95 (cl (not (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) :rule or_pos)
% 41.40/41.61  (step t96 (cl (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (not (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule reordering :premises (t95))
% 41.40/41.61  (step t97 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t98)
% 41.40/41.61  (assume t98.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))))
% 41.40/41.61  (step t98.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B)))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule forall_inst :args ((:= A (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (:= B tptp.sk14)))
% 41.40/41.61  (step t98.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B)))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) :rule or :premises (t98.t1))
% 41.40/41.61  (step t98.t3 (cl (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t98.t2 t98.a0))
% 41.40/41.61  (step t98 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B)))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) :rule subproof :discharge (t98.a0))
% 41.40/41.61  (step t99 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t97 t98))
% 41.40/41.61  (step t100 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) (not (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule implies_neg2)
% 41.40/41.61  (step t101 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule resolution :premises (t99 t100))
% 41.40/41.61  (step t102 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule contraction :premises (t101))
% 41.40/41.61  (step t103 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B)))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) :rule implies :premises (t102))
% 41.40/41.61  (step t104 (cl (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t103 a2))
% 41.40/41.61  (step t105 (cl (not (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) :rule or_pos)
% 41.40/41.61  (step t106 (cl (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (not (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule reordering :premises (t105))
% 41.40/41.61  (step t107 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t108)
% 41.40/41.61  (assume t108.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))))
% 41.40/41.61  (step t108.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B)))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule forall_inst :args ((:= A (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (:= B tptp.sk14)))
% 41.40/41.61  (step t108.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B)))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) :rule or :premises (t108.t1))
% 41.40/41.61  (step t108.t3 (cl (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t108.t2 t108.a0))
% 41.40/41.61  (step t108 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B)))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) :rule subproof :discharge (t108.a0))
% 41.40/41.61  (step t109 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t107 t108))
% 41.40/41.61  (step t110 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) (not (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule implies_neg2)
% 41.40/41.61  (step t111 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule resolution :premises (t109 t110))
% 41.40/41.61  (step t112 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule contraction :premises (t111))
% 41.40/41.61  (step t113 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B)))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) :rule implies :premises (t112))
% 41.40/41.61  (step t114 (cl (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t113 a1))
% 41.40/41.61  (step t115 (cl (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) :rule resolution :premises (t65 t73 a48 t75 t83 t94 t96 t104 t106 t114))
% 41.40/41.61  (step t116 (cl (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) :rule contraction :premises (t115))
% 41.40/41.61  (step t117 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C))) (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t118)
% 41.40/41.61  (assume t118.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C))))
% 41.40/41.61  (step t118.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C)))) (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))))) :rule forall_inst :args ((:= A tptp.sk16) (:= B tptp.sk14) (:= C (tptp.ax0_sk4 tptp.sk15 tptp.sk16)) (:= D (tptp.ax0_sk3 tptp.sk15 tptp.sk16))))
% 41.40/41.61  (step t118.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C)))) (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)))) :rule or :premises (t118.t1))
% 41.40/41.61  (step t118.t3 (cl (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)))) :rule resolution :premises (t118.t2 t118.a0))
% 41.40/41.61  (step t118 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C)))) (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)))) :rule subproof :discharge (t118.a0))
% 41.40/41.61  (step t119 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C))) (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)))) (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)))) :rule resolution :premises (t117 t118))
% 41.40/41.61  (step t120 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C))) (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)))) (not (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))))) :rule implies_neg2)
% 41.40/41.61  (step t121 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C))) (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C))) (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))))) :rule resolution :premises (t119 t120))
% 41.40/41.61  (step t122 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C))) (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16))))) :rule contraction :premises (t121))
% 41.40/41.61  (step t123 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C)))) (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)))) :rule implies :premises (t122))
% 41.40/41.61  (step t124 (cl (or (not (tptp.end_point tptp.sk16 tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk4 tptp.sk15 tptp.sk16))) (not (tptp.incident_c tptp.sk16 (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.part_of (tptp.ax0_sk4 tptp.sk15 tptp.sk16) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) (tptp.ax0_sk4 tptp.sk15 tptp.sk16)))) :rule resolution :premises (t123 a13))
% 41.40/41.61  (step t125 (cl (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t19 a49 t30 t41 t52 t63 t116 t124))
% 41.40/41.61  (step t126 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t127)
% 41.40/41.61  (assume t127.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))))
% 41.40/41.61  (step t127.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B)))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule forall_inst :args ((:= A (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (:= B tptp.sk14)))
% 41.40/41.61  (step t127.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B)))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule or :premises (t127.t1))
% 41.40/41.61  (step t127.t3 (cl (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t127.t2 t127.a0))
% 41.40/41.61  (step t127 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B)))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule subproof :discharge (t127.a0))
% 41.40/41.61  (step t128 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t126 t127))
% 41.40/41.61  (step t129 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) (not (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule implies_neg2)
% 41.40/41.61  (step t130 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule resolution :premises (t128 t129))
% 41.40/41.61  (step t131 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule contraction :premises (t130))
% 41.40/41.61  (step t132 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B)))) (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule implies :premises (t131))
% 41.40/41.61  (step t133 (cl (or (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t132 a1))
% 41.40/41.61  (step t134 (cl (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) :rule resolution :premises (t17 t125 t133))
% 41.40/41.61  (step t135 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t136)
% 41.40/41.61  (assume t136.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))))
% 41.40/41.61  (step t136.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)))) :rule forall_inst :args ((:= A (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (:= B tptp.sk15) (:= C (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))))
% 41.40/41.61  (step t136.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) :rule or :premises (t136.t1))
% 41.40/41.61  (step t136.t3 (cl (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) :rule resolution :premises (t136.t2 t136.a0))
% 41.40/41.61  (step t136 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) :rule subproof :discharge (t136.a0))
% 41.40/41.61  (step t137 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) :rule resolution :premises (t135 t136))
% 41.40/41.61  (step t138 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) (not (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)))) :rule implies_neg2)
% 41.40/41.61  (step t139 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)))) :rule resolution :premises (t137 t138))
% 41.40/41.61  (step t140 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)))) :rule contraction :premises (t139))
% 41.40/41.61  (step t141 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) :rule implies :premises (t140))
% 41.40/41.61  (step t142 (cl (or (not (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk15)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (tptp.ax0_sk3 tptp.sk15 tptp.sk16))) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15))) :rule resolution :premises (t141 a0))
% 41.40/41.61  (step t143 (cl (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) :rule resolution :premises (t4 t15 t134 t142))
% 41.40/41.61  (step t144 (cl (not (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)) :rule or_pos)
% 41.40/41.61  (step t145 (cl (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (not (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule reordering :premises (t144))
% 41.40/41.61  (step t146 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t147)
% 41.40/41.61  (assume t147.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))))
% 41.40/41.61  (step t147.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B)))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule forall_inst :args ((:= A (tptp.ax0_sk3 tptp.sk15 tptp.sk16)) (:= B tptp.sk14)))
% 41.40/41.61  (step t147.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B)))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule or :premises (t147.t1))
% 41.40/41.61  (step t147.t3 (cl (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t147.t2 t147.a0))
% 41.40/41.61  (step t147 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B)))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule subproof :discharge (t147.a0))
% 41.40/41.61  (step t148 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t146 t147))
% 41.40/41.61  (step t149 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) (not (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule implies_neg2)
% 41.40/41.61  (step t150 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule resolution :premises (t148 t149))
% 41.40/41.61  (step t151 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14)))) :rule contraction :premises (t150))
% 41.40/41.61  (step t152 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B)))) (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule implies :premises (t151))
% 41.40/41.61  (step t153 (cl (or (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)) (tptp.part_of (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))) :rule resolution :premises (t152 a2))
% 41.40/41.61  (step t154 (cl (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule resolution :premises (t145 t125 t153))
% 41.40/41.61  (step t155 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) :rule implies_neg1)
% 41.40/41.61  (anchor :step t156)
% 41.40/41.61  (assume t156.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))))
% 41.40/41.61  (step t156.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)))) :rule forall_inst :args ((:= A tptp.sk15) (:= B tptp.sk14) (:= C (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14))))
% 41.40/41.61  (step t156.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule or :premises (t156.t1))
% 41.40/41.61  (step t156.t3 (cl (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule resolution :premises (t156.t2 t156.a0))
% 41.40/41.61  (step t156 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule subproof :discharge (t156.a0))
% 41.40/41.61  (step t157 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule resolution :premises (t155 t156))
% 41.40/41.61  (step t158 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) (not (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)))) :rule implies_neg2)
% 41.40/41.61  (step t159 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)))) :rule resolution :premises (t157 t158))
% 41.40/41.61  (step t160 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14)))) :rule contraction :premises (t159))
% 41.40/41.61  (step t161 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B)))) (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule implies :premises (t160))
% 41.40/41.61  (step t162 (cl (or (not (tptp.part_of tptp.sk15 tptp.sk14)) (not (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk15)) (tptp.incident_c (tptp.ax0_sk1 (tptp.ax0_sk3 tptp.sk15 tptp.sk16) tptp.sk14) tptp.sk14))) :rule resolution :premises (t161 a0))
% 41.40/41.61  (step t163 (cl) :rule resolution :premises (t2 t143 t154 t162 a48))
% 41.40/41.61  
% 41.40/41.61  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.RfTpxzUuRo/cvc5---1.0.5_14411.smt2
% 41.44/41.62  % cvc5---1.0.5 exiting
% 41.44/41.62  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------