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

% Computer : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 29 18:01:42 EDT 2024

% Result   : Unsatisfiable 0.74s 0.92s
% Output   : Proof 0.76s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13  % Problem    : SWC357-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.34  % Computer : n012.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sun May 26 15:46:24 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.53  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.54  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.74/0.92  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.Ok10FFwG2G/cvc5---1.0.5_21904.smt2
% 0.74/0.92  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.Ok10FFwG2G/cvc5---1.0.5_21904.smt2
% 0.76/0.94  (assume a0 (tptp.equalelemsP tptp.nil))
% 0.76/0.94  (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.76/0.94  (assume a2 (tptp.strictorderedP tptp.nil))
% 0.76/0.94  (assume a3 (tptp.totalorderedP tptp.nil))
% 0.76/0.94  (assume a4 (tptp.strictorderP tptp.nil))
% 0.76/0.94  (assume a5 (tptp.totalorderP tptp.nil))
% 0.76/0.94  (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.76/0.94  (assume a7 (tptp.ssList tptp.nil))
% 0.76/0.94  (assume a8 (tptp.ssItem tptp.skac3))
% 0.76/0.94  (assume a9 (tptp.ssItem tptp.skac2))
% 0.76/0.94  (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.76/0.94  (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.76/0.94  (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.76/0.94  (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.76/0.94  (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.76/0.94  (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.76/0.94  (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.76/0.94  (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.76/0.94  (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.76/0.94  (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.76/0.94  (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.76/0.94  (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.76/0.94  (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.76/0.94  (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.76/0.94  (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.76/0.94  (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.76/0.94  (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.76/0.94  (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.76/0.94  (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.76/0.94  (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.76/0.94  (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.76/0.94  (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.76/0.94  (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.76/0.94  (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.76/0.94  (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.76/0.94  (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.76/0.94  (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.76/0.94  (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.76/0.94  (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.76/0.94  (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.76/0.94  (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.76/0.94  (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.76/0.94  (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.76/0.94  (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.76/0.94  (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.76/0.94  (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.76/0.94  (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.76/0.94  (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.76/0.94  (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.76/0.94  (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.76/0.94  (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.76/0.94  (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.76/0.94  (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.76/0.94  (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.76/0.94  (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.76/0.94  (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.76/0.94  (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.76/0.94  (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.76/0.94  (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.76/0.94  (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.76/0.94  (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.76/0.94  (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.76/0.94  (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.76/0.94  (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.76/0.94  (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.76/0.94  (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.76/0.94  (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.76/0.94  (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.76/0.94  (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.76/0.94  (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.76/0.94  (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.76/0.94  (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.76/0.94  (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.76/0.94  (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.76/0.94  (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.76/0.94  (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.76/0.94  (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.76/0.94  (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.76/0.94  (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.76/0.94  (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.76/0.94  (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.76/0.94  (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.76/0.94  (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.76/0.94  (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.76/0.94  (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.76/0.94  (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.76/0.94  (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.76/0.94  (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.76/0.94  (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.76/0.94  (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.76/0.94  (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.76/0.94  (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.76/0.94  (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.76/0.94  (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.76/0.94  (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.76/0.94  (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.76/0.94  (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.76/0.94  (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.76/0.94  (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.76/0.94  (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.76/0.94  (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.76/0.94  (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.76/0.94  (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 0.76/0.94  (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.76/0.94  (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 0.76/0.94  (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 0.76/0.94  (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 0.76/0.94  (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 0.76/0.94  (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.76/0.94  (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 0.76/0.94  (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.76/0.94  (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 0.76/0.94  (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 0.76/0.94  (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 0.76/0.94  (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 0.76/0.94  (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 0.76/0.94  (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.76/0.94  (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.76/0.94  (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 0.76/0.94  (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 0.76/0.94  (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 0.76/0.94  (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 0.76/0.94  (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 0.76/0.94  (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 0.76/0.94  (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 0.76/0.94  (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 0.76/0.94  (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.76/0.94  (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.76/0.94  (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.76/0.94  (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 0.76/0.94  (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 0.76/0.94  (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 0.76/0.94  (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 0.76/0.94  (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 0.76/0.94  (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 0.76/0.94  (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 0.76/0.94  (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 0.76/0.94  (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 0.76/0.94  (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 0.76/0.94  (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 0.76/0.94  (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 0.76/0.94  (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 0.76/0.94  (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 0.76/0.94  (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 0.76/0.94  (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 0.76/0.94  (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 0.76/0.94  (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 0.76/0.94  (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 0.76/0.94  (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 0.76/0.94  (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 0.76/0.94  (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 0.76/0.94  (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 0.76/0.94  (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 0.76/0.94  (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 0.76/0.94  (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 0.76/0.94  (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 0.76/0.94  (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 0.76/0.94  (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 0.76/0.94  (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 0.76/0.94  (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 0.76/0.94  (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 0.76/0.94  (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 0.76/0.94  (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 0.76/0.94  (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 0.76/0.94  (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 0.76/0.94  (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 0.76/0.94  (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 0.76/0.94  (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 0.76/0.94  (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 0.76/0.94  (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 0.76/0.94  (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 0.76/0.94  (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 0.76/0.94  (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 0.76/0.94  (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 0.76/0.94  (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 0.76/0.94  (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 0.76/0.94  (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 0.76/0.94  (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 0.76/0.94  (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 0.76/0.94  (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 0.76/0.94  (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 0.76/0.94  (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 0.76/0.94  (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 0.76/0.94  (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 0.76/0.94  (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 0.76/0.94  (assume a185 (tptp.ssList tptp.sk1))
% 0.76/0.94  (assume a186 (tptp.ssList tptp.sk2))
% 0.76/0.94  (assume a187 (tptp.ssList tptp.sk3))
% 0.76/0.94  (assume a188 (tptp.ssList tptp.sk4))
% 0.76/0.94  (assume a189 (= tptp.sk2 tptp.sk4))
% 0.76/0.94  (assume a190 (= tptp.sk1 tptp.sk3))
% 0.76/0.94  (assume a191 (tptp.neq tptp.sk2 tptp.nil))
% 0.76/0.94  (assume a192 (not (tptp.segmentP tptp.sk2 tptp.sk1)))
% 0.76/0.94  (assume a193 (or (= tptp.nil tptp.sk4) (tptp.neq tptp.sk3 tptp.nil)))
% 0.76/0.94  (assume a194 (or (= tptp.nil tptp.sk4) (tptp.frontsegP tptp.sk4 tptp.sk3)))
% 0.76/0.94  (assume a195 (or (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil)))
% 0.76/0.94  (assume a196 (or (= tptp.nil tptp.sk3) (tptp.frontsegP tptp.sk4 tptp.sk3)))
% 0.76/0.94  (step t1 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule equiv_pos2)
% 0.76/0.94  (step t2 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 0.76/0.94  (step t3 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 0.76/0.94  (step t4 (cl (= (= (= (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (tptp.segmentP tptp.sk2 tptp.sk1)) true) (= (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule equiv_simplify)
% 0.76/0.94  (step t5 (cl (not (= (= (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (tptp.segmentP tptp.sk2 tptp.sk1)) true)) (= (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule equiv1 :premises (t4))
% 0.76/0.94  (step t6 (cl (= (= (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (tptp.segmentP tptp.sk2 tptp.sk1)) (= (tptp.segmentP tptp.sk2 tptp.sk1) (not (not (tptp.segmentP tptp.sk2 tptp.sk1)))))) :rule all_simplify)
% 0.76/0.94  (step t7 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule refl)
% 0.76/0.94  (step t8 (cl (= (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule all_simplify)
% 0.76/0.94  (step t9 (cl (= (= (tptp.segmentP tptp.sk2 tptp.sk1) (not (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (= (tptp.segmentP tptp.sk2 tptp.sk1) (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule cong :premises (t7 t8))
% 0.76/0.94  (step t10 (cl (= (= (tptp.segmentP tptp.sk2 tptp.sk1) (tptp.segmentP tptp.sk2 tptp.sk1)) true)) :rule all_simplify)
% 0.76/0.94  (step t11 (cl (= (= (tptp.segmentP tptp.sk2 tptp.sk1) (not (not (tptp.segmentP tptp.sk2 tptp.sk1)))) true)) :rule trans :premises (t9 t10))
% 0.76/0.94  (step t12 (cl (= (= (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (tptp.segmentP tptp.sk2 tptp.sk1)) true)) :rule trans :premises (t6 t11))
% 0.76/0.94  (step t13 (cl (= (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule resolution :premises (t5 t12))
% 0.76/0.94  (step t14 (cl (= (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))))) :rule refl)
% 0.76/0.94  (step t15 (cl (= (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule refl)
% 0.76/0.94  (step t16 (cl (= (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule refl)
% 0.76/0.94  (step t17 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))))) :rule cong :premises (t2 t3 t13 t14 t15 t16))
% 0.76/0.94  (step t18 (cl (not (= (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))))) (not (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule equiv_pos2)
% 0.76/0.94  (step t19 (cl (= (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule refl)
% 0.76/0.94  (step t20 (cl (= (= (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) false) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))))) :rule equiv_simplify)
% 0.76/0.94  (step t21 (cl (= (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) false) (not (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))))) :rule equiv2 :premises (t20))
% 0.76/0.94  (step t22 (cl (not (not (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))))) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule not_not)
% 0.76/0.94  (step t23 (cl (= (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) false) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule resolution :premises (t21 t22))
% 0.76/0.94  (step t24 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) false) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule implies_neg1)
% 0.76/0.94  (anchor :step t25)
% 0.76/0.94  (assume t25.a0 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))
% 0.76/0.94  (assume t25.a1 (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))
% 0.76/0.94  (assume t25.a2 (= tptp.sk1 tptp.sk3))
% 0.76/0.94  (assume t25.a3 (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))
% 0.76/0.94  (assume t25.a4 (= tptp.sk2 tptp.sk4))
% 0.76/0.94  (assume t25.a5 (not (tptp.segmentP tptp.sk2 tptp.sk1)))
% 0.76/0.94  (step t25.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 0.76/0.94  (step t25.t2 (cl (= (= false true) false)) :rule all_simplify)
% 0.76/0.94  (step t25.t3 (cl (= (= (tptp.segmentP tptp.sk2 tptp.sk1) false) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule equiv_simplify)
% 0.76/0.94  (step t25.t4 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) false) (not (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule equiv2 :premises (t25.t3))
% 0.76/0.94  (step t25.t5 (cl (not (not (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule not_not)
% 0.76/0.94  (step t25.t6 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) false) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule resolution :premises (t25.t4 t25.t5))
% 0.76/0.94  (step t25.t7 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) false)) :rule resolution :premises (t25.t6 t25.a5))
% 0.76/0.94  (step t25.t8 (cl (= false (tptp.segmentP tptp.sk2 tptp.sk1))) :rule symm :premises (t25.t7))
% 0.76/0.94  (step t25.t9 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t25.a4))
% 0.76/0.94  (step t25.t10 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t25.t9))
% 0.76/0.94  (step t25.t11 (cl (= (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk4)) :rule symm :premises (t25.a3))
% 0.76/0.94  (step t25.t12 (cl (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule symm :premises (t25.t11))
% 0.76/0.94  (step t25.t13 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t25.a2))
% 0.76/0.94  (step t25.t14 (cl (= (tptp.app tptp.nil tptp.sk1) tptp.sk1)) :rule symm :premises (t25.a1))
% 0.76/0.94  (step t25.t15 (cl (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) :rule symm :premises (t25.t14))
% 0.76/0.94  (step t25.t16 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk1))) :rule trans :premises (t25.t13 t25.t15))
% 0.76/0.94  (step t25.t17 (cl (= (tptp.skaf45 tptp.sk4 tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule refl)
% 0.76/0.94  (step t25.t18 (cl (= (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)) (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule cong :premises (t25.t16 t25.t17))
% 0.76/0.94  (step t25.t19 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule trans :premises (t25.t10 t25.t12 t25.t18))
% 0.76/0.94  (step t25.t20 (cl (= tptp.sk1 tptp.sk1)) :rule refl)
% 0.76/0.94  (step t25.t21 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule cong :premises (t25.t19 t25.t20))
% 0.76/0.94  (step t25.t22 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) true) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule equiv_simplify)
% 0.76/0.94  (step t25.t23 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) true) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule equiv2 :premises (t25.t22))
% 0.76/0.94  (step t25.t24 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) true)) :rule resolution :premises (t25.t23 t25.a0))
% 0.76/0.94  (step t25.t25 (cl (= false true)) :rule trans :premises (t25.t8 t25.t21 t25.t24))
% 0.76/0.94  (step t25.t26 (cl false) :rule resolution :premises (t25.t1 t25.t2 t25.t25))
% 0.76/0.94  (step t25 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) false) :rule subproof :discharge (t25.a0 t25.a1 t25.a2 t25.a3 t25.a4 t25.a5))
% 0.76/0.94  (step t26 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) :rule and_pos)
% 0.76/0.94  (step t27 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) :rule and_pos)
% 0.76/0.94  (step t28 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.76/0.94  (step t29 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule and_pos)
% 0.76/0.94  (step t30 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.76/0.94  (step t31 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (tptp.segmentP tptp.sk2 tptp.sk1))) :rule and_pos)
% 0.76/0.94  (step t32 (cl false (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))))) :rule resolution :premises (t25 t26 t27 t28 t29 t30 t31))
% 0.76/0.94  (step t33 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) false) :rule reordering :premises (t32))
% 0.76/0.94  (step t34 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) false) :rule contraction :premises (t33))
% 0.76/0.94  (step t35 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) false) false) :rule resolution :premises (t24 t34))
% 0.76/0.94  (step t36 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) false) (not false)) :rule implies_neg2)
% 0.76/0.94  (step t37 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) false) (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) false)) :rule resolution :premises (t35 t36))
% 0.76/0.94  (step t38 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) false)) :rule contraction :premises (t37))
% 0.76/0.94  (step t39 (cl (= (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) false) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))))) :rule implies_simplify)
% 0.76/0.94  (step t40 (cl (not (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) false)) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))))) :rule equiv1 :premises (t39))
% 0.76/0.94  (step t41 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))))) :rule resolution :premises (t38 t40))
% 0.76/0.94  (step t42 (cl (= (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) false)) :rule resolution :premises (t23 t41))
% 0.76/0.94  (step t43 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) false))) :rule cong :premises (t19 t42))
% 0.76/0.94  (step t44 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) false) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))))) :rule all_simplify)
% 0.76/0.94  (step t45 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))))) :rule trans :premises (t43 t44))
% 0.76/0.94  (step t46 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule implies_neg1)
% 0.76/0.94  (anchor :step t47)
% 0.76/0.94  (assume t47.a0 (= tptp.sk2 tptp.sk4))
% 0.76/0.94  (assume t47.a1 (= tptp.sk1 tptp.sk3))
% 0.76/0.94  (assume t47.a2 (not (tptp.segmentP tptp.sk2 tptp.sk1)))
% 0.76/0.94  (assume t47.a3 (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))
% 0.76/0.94  (assume t47.a4 (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))
% 0.76/0.94  (assume t47.a5 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))
% 0.76/0.94  (step t47.t1 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule and_neg)
% 0.76/0.94  (step t47.t2 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule resolution :premises (t47.t1 t47.a5 t47.a3 t47.a1 t47.a4 t47.a0 t47.a2))
% 0.76/0.94  (step t47 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule subproof :discharge (t47.a0 t47.a1 t47.a2 t47.a3 t47.a4 t47.a5))
% 0.76/0.94  (step t48 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.76/0.94  (step t49 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.76/0.94  (step t50 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (tptp.segmentP tptp.sk2 tptp.sk1))) :rule and_pos)
% 0.76/0.94  (step t51 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) :rule and_pos)
% 0.76/0.94  (step t52 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule and_pos)
% 0.76/0.94  (step t53 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) :rule and_pos)
% 0.76/0.94  (step t54 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule resolution :premises (t47 t48 t49 t50 t51 t52 t53))
% 0.76/0.94  (step t55 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule reordering :premises (t54))
% 0.76/0.94  (step t56 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule contraction :premises (t55))
% 0.76/0.94  (step t57 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule resolution :premises (t46 t56))
% 0.76/0.94  (step t58 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))))) :rule implies_neg2)
% 0.76/0.94  (step t59 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))))) :rule resolution :premises (t57 t58))
% 0.76/0.94  (step t60 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4) (not (tptp.segmentP tptp.sk2 tptp.sk1))))) :rule contraction :premises (t59))
% 0.76/0.94  (step t61 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule resolution :premises (t18 t45 t60))
% 0.76/0.94  (step t62 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule not_and :premises (t61))
% 0.76/0.94  (step t63 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 0.76/0.94  (step t64 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 0.76/0.94  (step t65 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (not (not (tptp.segmentP tptp.sk2 tptp.sk1))))) :rule or_neg)
% 0.76/0.94  (step t66 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))))) :rule or_neg)
% 0.76/0.94  (step t67 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule or_neg)
% 0.76/0.94  (step t68 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule or_neg)
% 0.76/0.94  (step t69 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule resolution :premises (t62 t63 t64 t65 t66 t67 t68))
% 0.76/0.94  (step t70 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule contraction :premises (t69))
% 0.76/0.94  (step t71 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule resolution :premises (t1 t17 t70))
% 0.76/0.94  (step t72 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule or :premises (t71))
% 0.76/0.94  (step t73 (cl (tptp.segmentP tptp.sk2 tptp.sk1) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule reordering :premises (t72))
% 0.76/0.94  (step t74 (cl (not (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) :rule or_pos)
% 0.76/0.94  (step t75 (cl (not (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) :rule contraction :premises (t74))
% 0.76/0.94  (step t76 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1) (not (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule reordering :premises (t75))
% 0.76/0.94  (step t77 (cl (not (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)) :rule or_pos)
% 0.76/0.94  (step t78 (cl (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1) (not (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule reordering :premises (t77))
% 0.76/0.94  (step t79 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 0.76/0.94  (anchor :step t80)
% 0.76/0.94  (assume t80.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.76/0.94  (step t80.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 0.76/0.94  (step t80.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule or :premises (t80.t1))
% 0.76/0.94  (step t80.t3 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t80.t2 t80.a0))
% 0.76/0.94  (step t80 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule subproof :discharge (t80.a0))
% 0.76/0.94  (step t81 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t79 t80))
% 0.76/0.94  (step t82 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule implies_neg2)
% 0.76/0.94  (step t83 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t81 t82))
% 0.76/0.94  (step t84 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule contraction :premises (t83))
% 0.76/0.94  (step t85 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule implies :premises (t84))
% 0.76/0.94  (step t86 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t85 a56))
% 0.76/0.94  (step t87 (cl (tptp.segmentP tptp.sk1 tptp.sk1)) :rule resolution :premises (t78 a185 t86))
% 0.76/0.94  (step t88 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) :rule implies_neg1)
% 0.76/0.94  (anchor :step t89)
% 0.76/0.94  (assume t89.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.76/0.94  (step t89.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk3)))
% 0.76/0.94  (step t89.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule or :premises (t89.t1))
% 0.76/0.94  (step t89.t3 (cl (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule resolution :premises (t89.t2 t89.a0))
% 0.76/0.94  (step t89 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule subproof :discharge (t89.a0))
% 0.76/0.94  (step t90 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule resolution :premises (t88 t89))
% 0.76/0.94  (step t91 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule implies_neg2)
% 0.76/0.94  (step t92 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule resolution :premises (t90 t91))
% 0.76/0.94  (step t93 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule contraction :premises (t92))
% 0.76/0.94  (step t94 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule implies :premises (t93))
% 0.76/0.94  (step t95 (cl (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule resolution :premises (t94 a50))
% 0.76/0.94  (step t96 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))) (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V)))) :rule implies_neg1)
% 0.76/0.94  (anchor :step t97)
% 0.76/0.94  (assume t97.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 0.76/0.94  (step t97.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V)))) (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1) (:= V tptp.sk1) (:= W (tptp.skaf45 tptp.sk4 tptp.sk3)) (:= X tptp.nil)))
% 0.76/0.94  (step t97.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V)))) (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule or :premises (t97.t1))
% 0.76/0.94  (step t97.t3 (cl (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule resolution :premises (t97.t2 t97.a0))
% 0.76/0.94  (step t97 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V)))) (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule subproof :discharge (t97.a0))
% 0.76/0.94  (step t98 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))) (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule resolution :premises (t96 t97))
% 0.76/0.94  (step t99 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))) (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (not (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule implies_neg2)
% 0.76/0.94  (step t100 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))) (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))) (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule resolution :premises (t98 t99))
% 0.76/0.94  (step t101 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))) (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)))) :rule contraction :premises (t100))
% 0.76/0.94  (step t102 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V)))) (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule implies :premises (t101))
% 0.76/0.94  (step t103 (cl (or (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1))) :rule resolution :premises (t102 a171))
% 0.76/0.94  (step t104 (cl (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk1) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk1)) :rule resolution :premises (t76 a7 a185 t87 t95 t103))
% 0.76/0.94  (step t105 (cl (not (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule or_pos)
% 0.76/0.94  (step t106 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule reordering :premises (t105))
% 0.76/0.94  (step t107 (cl (= tptp.nil tptp.sk4) (tptp.frontsegP tptp.sk4 tptp.sk3)) :rule or :premises (a194))
% 0.76/0.94  (step t108 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.sk2 tptp.sk2)))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2))))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.sk2 tptp.sk2))) :rule equiv_pos2)
% 0.76/0.94  (step t109 (cl (= (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule refl)
% 0.76/0.94  (step t110 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 0.76/0.94  (step t111 (cl (= (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) true) (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)))) :rule equiv_simplify)
% 0.76/0.94  (step t112 (cl (not (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) true)) (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2))) :rule equiv1 :premises (t111))
% 0.76/0.94  (step t113 (cl (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) (= (tptp.neq tptp.sk2 tptp.sk2) (not (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule all_simplify)
% 0.76/0.94  (step t114 (cl (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.sk2))) :rule refl)
% 0.76/0.94  (step t115 (cl (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2))) :rule all_simplify)
% 0.76/0.94  (step t116 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.sk2)))) :rule cong :premises (t114 t115))
% 0.76/0.94  (step t117 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.sk2)) true)) :rule all_simplify)
% 0.76/0.94  (step t118 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) true)) :rule trans :premises (t116 t117))
% 0.76/0.94  (step t119 (cl (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) true)) :rule trans :premises (t113 t118))
% 0.76/0.94  (step t120 (cl (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2))) :rule resolution :premises (t112 t119))
% 0.76/0.94  (step t121 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.sk2 tptp.sk2)))) :rule cong :premises (t2 t109 t110 t120))
% 0.76/0.94  (step t122 (cl (not (= (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) (not (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule equiv_pos2)
% 0.76/0.94  (step t123 (cl (= (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule refl)
% 0.76/0.94  (step t124 (cl (= (= (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule equiv_simplify)
% 0.76/0.94  (step t125 (cl (= (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule equiv2 :premises (t124))
% 0.76/0.94  (step t126 (cl (not (not (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule not_not)
% 0.76/0.94  (step t127 (cl (= (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule resolution :premises (t125 t126))
% 0.76/0.94  (step t128 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule implies_neg1)
% 0.76/0.94  (anchor :step t129)
% 0.76/0.94  (assume t129.a0 (tptp.neq tptp.sk2 tptp.nil))
% 0.76/0.94  (assume t129.a1 (= tptp.nil tptp.sk4))
% 0.76/0.94  (assume t129.a2 (= tptp.sk2 tptp.sk4))
% 0.76/0.94  (assume t129.a3 (not (tptp.neq tptp.sk2 tptp.sk2)))
% 0.76/0.94  (step t129.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 0.76/0.94  (step t129.t2 (cl (= (= false true) false)) :rule all_simplify)
% 0.76/0.94  (step t129.t3 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) false) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule equiv_simplify)
% 0.76/0.94  (step t129.t4 (cl (= (tptp.neq tptp.sk2 tptp.sk2) false) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule equiv2 :premises (t129.t3))
% 0.76/0.94  (step t129.t5 (cl (not (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (tptp.neq tptp.sk2 tptp.sk2)) :rule not_not)
% 0.76/0.94  (step t129.t6 (cl (= (tptp.neq tptp.sk2 tptp.sk2) false) (tptp.neq tptp.sk2 tptp.sk2)) :rule resolution :premises (t129.t4 t129.t5))
% 0.76/0.94  (step t129.t7 (cl (= (tptp.neq tptp.sk2 tptp.sk2) false)) :rule resolution :premises (t129.t6 t129.a3))
% 0.76/0.94  (step t129.t8 (cl (= false (tptp.neq tptp.sk2 tptp.sk2))) :rule symm :premises (t129.t7))
% 0.76/0.94  (step t129.t9 (cl (= tptp.sk2 tptp.sk2)) :rule refl)
% 0.76/0.94  (step t129.t10 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t129.a2))
% 0.76/0.94  (step t129.t11 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t129.t10))
% 0.76/0.94  (step t129.t12 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t129.a1))
% 0.76/0.94  (step t129.t13 (cl (= tptp.sk2 tptp.nil)) :rule trans :premises (t129.t11 t129.t12))
% 0.76/0.94  (step t129.t14 (cl (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) :rule cong :premises (t129.t9 t129.t13))
% 0.76/0.94  (step t129.t15 (cl (= (= (tptp.neq tptp.sk2 tptp.nil) true) (tptp.neq tptp.sk2 tptp.nil))) :rule equiv_simplify)
% 0.76/0.94  (step t129.t16 (cl (= (tptp.neq tptp.sk2 tptp.nil) true) (not (tptp.neq tptp.sk2 tptp.nil))) :rule equiv2 :premises (t129.t15))
% 0.76/0.94  (step t129.t17 (cl (= (tptp.neq tptp.sk2 tptp.nil) true)) :rule resolution :premises (t129.t16 t129.a0))
% 0.76/0.94  (step t129.t18 (cl (= false true)) :rule trans :premises (t129.t8 t129.t14 t129.t17))
% 0.76/0.94  (step t129.t19 (cl false) :rule resolution :premises (t129.t1 t129.t2 t129.t18))
% 0.76/0.94  (step t129 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2))) false) :rule subproof :discharge (t129.a0 t129.a1 t129.a2 t129.a3))
% 0.76/0.94  (step t130 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 0.76/0.94  (step t131 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 0.76/0.94  (step t132 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.76/0.94  (step t133 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (tptp.neq tptp.sk2 tptp.sk2))) :rule and_pos)
% 0.76/0.94  (step t134 (cl false (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t129 t130 t131 t132 t133))
% 0.76/0.94  (step t135 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) false) :rule reordering :premises (t134))
% 0.76/0.94  (step t136 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) false) :rule contraction :premises (t135))
% 0.76/0.94  (step t137 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) false) :rule resolution :premises (t128 t136))
% 0.76/0.94  (step t138 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not false)) :rule implies_neg2)
% 0.76/0.94  (step t139 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false)) :rule resolution :premises (t137 t138))
% 0.76/0.94  (step t140 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false)) :rule contraction :premises (t139))
% 0.76/0.94  (step t141 (cl (= (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule implies_simplify)
% 0.76/0.94  (step t142 (cl (not (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false)) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule equiv1 :premises (t141))
% 0.76/0.94  (step t143 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t140 t142))
% 0.76/0.94  (step t144 (cl (= (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false)) :rule resolution :premises (t127 t143))
% 0.76/0.94  (step t145 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false))) :rule cong :premises (t123 t144))
% 0.76/0.94  (step t146 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule all_simplify)
% 0.76/0.94  (step t147 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule trans :premises (t145 t146))
% 0.76/0.94  (step t148 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule implies_neg1)
% 0.76/0.94  (anchor :step t149)
% 0.76/0.94  (assume t149.a0 (= tptp.sk2 tptp.sk4))
% 0.76/0.94  (assume t149.a1 (tptp.neq tptp.sk2 tptp.nil))
% 0.76/0.94  (assume t149.a2 (= tptp.nil tptp.sk4))
% 0.76/0.94  (assume t149.a3 (not (tptp.neq tptp.sk2 tptp.sk2)))
% 0.76/0.94  (step t149.t1 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule and_neg)
% 0.76/0.94  (step t149.t2 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule resolution :premises (t149.t1 t149.a1 t149.a2 t149.a0 t149.a3))
% 0.76/0.94  (step t149 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule subproof :discharge (t149.a0 t149.a1 t149.a2 t149.a3))
% 0.76/0.94  (step t150 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.76/0.94  (step t151 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 0.76/0.94  (step t152 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 0.76/0.94  (step t153 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (tptp.neq tptp.sk2 tptp.sk2))) :rule and_pos)
% 0.76/0.94  (step t154 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t149 t150 t151 t152 t153))
% 0.76/0.94  (step t155 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule reordering :premises (t154))
% 0.76/0.94  (step t156 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule contraction :premises (t155))
% 0.76/0.94  (step t157 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule resolution :premises (t148 t156))
% 0.76/0.94  (step t158 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule implies_neg2)
% 0.76/0.94  (step t159 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t157 t158))
% 0.76/0.94  (step t160 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule contraction :premises (t159))
% 0.76/0.94  (step t161 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t122 t147 t160))
% 0.76/0.94  (step t162 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule not_and :premises (t161))
% 0.76/0.94  (step t163 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 0.76/0.94  (step t164 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule or_neg)
% 0.76/0.94  (step t165 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 0.76/0.94  (step t166 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule or_neg)
% 0.76/0.94  (step t167 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t162 t163 t164 t165 t166))
% 0.76/0.94  (step t168 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule contraction :premises (t167))
% 0.76/0.94  (step t169 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.sk2 tptp.sk2))) :rule resolution :premises (t108 t121 t168))
% 0.76/0.94  (step t170 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.sk2 tptp.sk2)) :rule or :premises (t169))
% 0.76/0.94  (step t171 (cl (not (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))) :rule or_pos)
% 0.76/0.94  (step t172 (cl (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.sk2)) (not (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule reordering :premises (t171))
% 0.76/0.94  (step t173 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule implies_neg1)
% 0.76/0.94  (anchor :step t174)
% 0.76/0.94  (assume t174.a0 (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))
% 0.76/0.94  (step t174.t1 (cl (or (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule forall_inst :args ((:= V tptp.sk2)))
% 0.76/0.94  (step t174.t2 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule or :premises (t174.t1))
% 0.76/0.94  (step t174.t3 (cl (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule resolution :premises (t174.t2 t174.a0))
% 0.76/0.94  (step t174 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule subproof :discharge (t174.a0))
% 0.76/0.94  (step t175 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule resolution :premises (t173 t174))
% 0.76/0.94  (step t176 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (not (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule implies_neg2)
% 0.76/0.94  (step t177 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule resolution :premises (t175 t176))
% 0.76/0.94  (step t178 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule contraction :premises (t177))
% 0.76/0.94  (step t179 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule implies :premises (t178))
% 0.76/0.94  (step t180 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U))))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 0.76/0.94  (step t181 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))))) :rule all_simplify)
% 0.76/0.94  (anchor :step t182 :args ((V $$unsorted) (:= V V)))
% 0.76/0.94  (step t182.t1 (cl (= V V)) :rule refl)
% 0.76/0.94  (step t182.t2 (cl (= (= V V) true)) :rule all_simplify)
% 0.76/0.94  (step t182.t3 (cl (= (not (= V V)) (not true))) :rule cong :premises (t182.t2))
% 0.76/0.94  (step t182.t4 (cl (= (not true) false)) :rule all_simplify)
% 0.76/0.94  (step t182.t5 (cl (= (not (= V V)) false)) :rule trans :premises (t182.t3 t182.t4))
% 0.76/0.94  (step t182.t6 (cl (= (not (tptp.neq V V)) (not (tptp.neq V V)))) :rule refl)
% 0.76/0.94  (step t182.t7 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.76/0.94  (step t182.t8 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))))) :rule cong :premises (t182.t5 t182.t6 t182.t7 t182.t7))
% 0.76/0.94  (step t182.t9 (cl (= (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule all_simplify)
% 0.76/0.94  (step t182.t10 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule trans :premises (t182.t8 t182.t9))
% 0.76/0.94  (step t182 (cl (= (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule bind)
% 0.76/0.94  (step t183 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule trans :premises (t181 t182))
% 0.76/0.94  (step t184 (cl (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule resolution :premises (t180 t183 a114))
% 0.76/0.94  (step t185 (cl (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule resolution :premises (t179 t184))
% 0.76/0.94  (step t186 (cl (not (tptp.neq tptp.sk2 tptp.sk2))) :rule resolution :premises (t172 a186 t185))
% 0.76/0.94  (step t187 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t170 a189 a191 t186))
% 0.76/0.94  (step t188 (cl (tptp.frontsegP tptp.sk4 tptp.sk3)) :rule resolution :premises (t107 t187))
% 0.76/0.94  (step t189 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule implies_neg1)
% 0.76/0.94  (anchor :step t190)
% 0.76/0.94  (assume t190.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))))
% 0.76/0.94  (step t190.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk3)))
% 0.76/0.94  (step t190.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule or :premises (t190.t1))
% 0.76/0.94  (step t190.t3 (cl (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule resolution :premises (t190.t2 t190.a0))
% 0.76/0.94  (step t190 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule subproof :discharge (t190.a0))
% 0.76/0.94  (step t191 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule resolution :premises (t189 t190))
% 0.76/0.94  (step t192 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (not (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule implies_neg2)
% 0.76/0.94  (step t193 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule resolution :premises (t191 t192))
% 0.76/0.94  (step t194 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule contraction :premises (t193))
% 0.76/0.94  (step t195 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule implies :premises (t194))
% 0.76/0.94  (step t196 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule equiv_pos2)
% 0.76/0.94  (anchor :step t197 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.76/0.94  (step t197.t1 (cl (= U U)) :rule refl)
% 0.76/0.94  (step t197.t2 (cl (= V V)) :rule refl)
% 0.76/0.94  (step t197.t3 (cl (= (not (tptp.frontsegP U V)) (not (tptp.frontsegP U V)))) :rule refl)
% 0.76/0.94  (step t197.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.76/0.94  (step t197.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.76/0.94  (step t197.t6 (cl (= (= (tptp.app V (tptp.skaf45 U V)) U) (= U (tptp.app V (tptp.skaf45 U V))))) :rule all_simplify)
% 0.76/0.94  (step t197.t7 (cl (= (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule cong :premises (t197.t3 t197.t4 t197.t5 t197.t6))
% 0.76/0.94  (step t197 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))))) :rule bind)
% 0.76/0.94  (step t198 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule resolution :premises (t196 t197 a131))
% 0.76/0.94  (step t199 (cl (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule resolution :premises (t195 t198))
% 0.76/0.94  (step t200 (cl (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule resolution :premises (t106 a187 a188 t188 t199))
% 0.76/0.94  (step t201 (cl (not (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) :rule or_pos)
% 0.76/0.94  (step t202 (cl (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)) (not (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))))) :rule reordering :premises (t201))
% 0.76/0.94  (step t203 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 0.76/0.94  (anchor :step t204)
% 0.76/0.94  (assume t204.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 0.76/0.94  (step t204.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))))) :rule forall_inst :args ((:= U tptp.sk1)))
% 0.76/0.94  (step t204.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))) :rule or :premises (t204.t1))
% 0.76/0.94  (step t204.t3 (cl (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))) :rule resolution :premises (t204.t2 t204.a0))
% 0.76/0.94  (step t204 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))) :rule subproof :discharge (t204.a0))
% 0.76/0.94  (step t205 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))) (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))) :rule resolution :premises (t203 t204))
% 0.76/0.94  (step t206 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))) (not (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))))) :rule implies_neg2)
% 0.76/0.94  (step t207 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))))) :rule resolution :premises (t205 t206))
% 0.76/0.94  (step t208 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))))) :rule contraction :premises (t207))
% 0.76/0.94  (step t209 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))) :rule implies :premises (t208))
% 0.76/0.94  (step t210 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule equiv_pos2)
% 0.76/0.94  (anchor :step t211 :args ((U $$unsorted) (:= U U)))
% 0.76/0.94  (step t211.t1 (cl (= U U)) :rule refl)
% 0.76/0.94  (step t211.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.76/0.94  (step t211.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 0.76/0.94  (step t211.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule cong :premises (t211.t2 t211.t3))
% 0.76/0.94  (step t211 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) :rule bind)
% 0.76/0.94  (step t212 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t210 t211 a73))
% 0.76/0.94  (step t213 (cl (or (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil tptp.sk1)))) :rule resolution :premises (t209 t212))
% 0.76/0.94  (step t214 (cl (= tptp.sk1 (tptp.app tptp.nil tptp.sk1))) :rule resolution :premises (t202 a185 t213))
% 0.76/0.94  (step t215 (cl) :rule resolution :premises (t73 t104 t200 t214 a192 a190 a189))
% 0.76/0.94  
% 0.76/0.95  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.Ok10FFwG2G/cvc5---1.0.5_21904.smt2
% 0.76/0.95  % cvc5---1.0.5 exiting
% 0.76/0.95  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------