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

% Computer : n025.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:35 EDT 2024

% Result   : Unsatisfiable 0.41s 0.70s
% Output   : Proof 0.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14  % Problem    : SWC339-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.15  % Command    : do_cvc5 %s %d
% 0.16/0.36  % Computer : n025.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 300
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Sun May 26 15:30:24 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.23/0.55  %----Proving TF0_NAR, FOF, or CNF
% 0.23/0.56  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.41/0.70  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.LsJi05KdQQ/cvc5---1.0.5_22608.smt2
% 0.41/0.70  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.LsJi05KdQQ/cvc5---1.0.5_22608.smt2
% 0.41/0.71  (assume a0 (tptp.equalelemsP tptp.nil))
% 0.41/0.71  (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.41/0.71  (assume a2 (tptp.strictorderedP tptp.nil))
% 0.41/0.71  (assume a3 (tptp.totalorderedP tptp.nil))
% 0.41/0.71  (assume a4 (tptp.strictorderP tptp.nil))
% 0.41/0.71  (assume a5 (tptp.totalorderP tptp.nil))
% 0.41/0.71  (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.41/0.71  (assume a7 (tptp.ssList tptp.nil))
% 0.41/0.71  (assume a8 (tptp.ssItem tptp.skac3))
% 0.41/0.71  (assume a9 (tptp.ssItem tptp.skac2))
% 0.41/0.71  (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.41/0.71  (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.41/0.71  (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.41/0.71  (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.41/0.71  (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.41/0.71  (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.41/0.71  (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.41/0.71  (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.41/0.71  (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.41/0.71  (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.41/0.71  (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.41/0.71  (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.41/0.71  (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.41/0.71  (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.41/0.71  (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.41/0.71  (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.41/0.71  (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.41/0.71  (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.41/0.71  (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.41/0.71  (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.41/0.71  (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.41/0.71  (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.41/0.71  (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.41/0.71  (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.41/0.71  (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.41/0.71  (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.41/0.71  (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.41/0.71  (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.41/0.71  (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.41/0.71  (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.41/0.71  (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.41/0.71  (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.41/0.71  (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.41/0.71  (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.41/0.71  (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.41/0.71  (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.41/0.71  (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.41/0.71  (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.41/0.71  (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.41/0.71  (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.41/0.71  (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.41/0.71  (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.41/0.71  (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.41/0.71  (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.41/0.71  (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.41/0.71  (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.41/0.71  (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.41/0.71  (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.41/0.71  (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.41/0.71  (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.41/0.71  (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.41/0.71  (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.41/0.71  (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.41/0.71  (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.41/0.71  (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.41/0.71  (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.41/0.71  (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.41/0.71  (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.41/0.71  (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.41/0.71  (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.41/0.71  (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.41/0.71  (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.41/0.71  (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.41/0.71  (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.41/0.71  (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.41/0.71  (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.41/0.71  (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.41/0.71  (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.41/0.71  (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.41/0.71  (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.41/0.71  (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.41/0.71  (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.41/0.71  (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.41/0.71  (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.41/0.71  (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.41/0.71  (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.41/0.71  (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.41/0.71  (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.41/0.71  (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.41/0.71  (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.41/0.71  (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.41/0.71  (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.41/0.71  (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.41/0.71  (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.41/0.71  (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.41/0.71  (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.41/0.71  (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.41/0.71  (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.41/0.71  (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.41/0.71  (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.41/0.71  (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.41/0.71  (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.41/0.71  (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.41/0.71  (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (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.41/0.71  (assume a185 (tptp.ssList tptp.sk1))
% 0.41/0.71  (assume a186 (tptp.ssList tptp.sk2))
% 0.41/0.71  (assume a187 (tptp.ssList tptp.sk3))
% 0.41/0.71  (assume a188 (tptp.ssList tptp.sk4))
% 0.41/0.71  (assume a189 (= tptp.sk2 tptp.sk4))
% 0.41/0.71  (assume a190 (= tptp.sk1 tptp.sk3))
% 0.41/0.71  (assume a191 (tptp.ssList tptp.sk5))
% 0.41/0.71  (assume a192 (tptp.ssList tptp.sk6))
% 0.41/0.71  (assume a193 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk4))
% 0.41/0.71  (assume a194 (tptp.totalorderedP tptp.sk3))
% 0.41/0.71  (assume a195 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app (tptp.cons C tptp.nil) D) tptp.sk3)) (not (tptp.leq A C)))))
% 0.41/0.71  (assume a196 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk6)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.leq C A)))))
% 0.41/0.71  (assume a197 (or (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))))
% 0.41/0.71  (assume a198 (or (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.totalorderedP tptp.sk1))))
% 0.41/0.71  (step t1 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) :rule or_pos)
% 0.41/0.71  (step t2 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule reordering :premises (t1))
% 0.41/0.71  (step t3 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule and_neg)
% 0.41/0.71  (step t4 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule implies_neg1)
% 0.41/0.71  (anchor :step t5)
% 0.41/0.71  (assume t5.a0 (tptp.ssList tptp.sk2))
% 0.41/0.71  (assume t5.a1 (= tptp.sk2 tptp.sk4))
% 0.41/0.71  (assume t5.a2 (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 0.41/0.71  (step t5.t1 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule implies_neg1)
% 0.41/0.71  (anchor :step t5.t2)
% 0.41/0.71  (assume t5.t2.a0 (tptp.ssList tptp.sk2))
% 0.41/0.71  (assume t5.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.41/0.71  (assume t5.t2.a2 (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 0.41/0.71  (step t5.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) true) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule equiv_simplify)
% 0.41/0.71  (step t5.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) true)) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule equiv1 :premises (t5.t2.t1))
% 0.41/0.71  (step t5.t2.t3 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk4)) :rule symm :premises (t5.t2.a2))
% 0.41/0.71  (step t5.t2.t4 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t5.t2.a1))
% 0.41/0.71  (step t5.t2.t5 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk2)) :rule trans :premises (t5.t2.t3 t5.t2.t4))
% 0.41/0.71  (step t5.t2.t6 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.ssList tptp.sk2))) :rule cong :premises (t5.t2.t5))
% 0.41/0.71  (step t5.t2.t7 (cl (= (= (tptp.ssList tptp.sk2) true) (tptp.ssList tptp.sk2))) :rule equiv_simplify)
% 0.41/0.71  (step t5.t2.t8 (cl (= (tptp.ssList tptp.sk2) true) (not (tptp.ssList tptp.sk2))) :rule equiv2 :premises (t5.t2.t7))
% 0.41/0.71  (step t5.t2.t9 (cl (= (tptp.ssList tptp.sk2) true)) :rule resolution :premises (t5.t2.t8 t5.t2.a0))
% 0.41/0.71  (step t5.t2.t10 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) true)) :rule trans :premises (t5.t2.t6 t5.t2.t9))
% 0.41/0.71  (step t5.t2.t11 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule resolution :premises (t5.t2.t2 t5.t2.t10))
% 0.41/0.71  (step t5.t2 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule subproof :discharge (t5.t2.a0 t5.t2.a1 t5.t2.a2))
% 0.41/0.71  (step t5.t3 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 0.41/0.71  (step t5.t4 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.41/0.71  (step t5.t5 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 0.41/0.71  (step t5.t6 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule resolution :premises (t5.t2 t5.t3 t5.t4 t5.t5))
% 0.41/0.71  (step t5.t7 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule reordering :premises (t5.t6))
% 0.41/0.71  (step t5.t8 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule contraction :premises (t5.t7))
% 0.41/0.71  (step t5.t9 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule resolution :premises (t5.t1 t5.t8))
% 0.41/0.71  (step t5.t10 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule implies_neg2)
% 0.41/0.71  (step t5.t11 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t5.t9 t5.t10))
% 0.41/0.71  (step t5.t12 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule contraction :premises (t5.t11))
% 0.41/0.71  (step t5.t13 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule implies :premises (t5.t12))
% 0.41/0.71  (step t5.t14 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule and_neg)
% 0.41/0.71  (step t5.t15 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t5.t14 t5.a0 t5.a1 t5.a2))
% 0.41/0.71  (step t5.t16 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule resolution :premises (t5.t13 t5.t15))
% 0.41/0.71  (step t5 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule subproof :discharge (t5.a0 t5.a1 t5.a2))
% 0.41/0.71  (step t6 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 0.41/0.71  (step t7 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.41/0.71  (step t8 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 0.41/0.71  (step t9 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule resolution :premises (t5 t6 t7 t8))
% 0.41/0.71  (step t10 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule reordering :premises (t9))
% 0.41/0.71  (step t11 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule contraction :premises (t10))
% 0.41/0.71  (step t12 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule resolution :premises (t4 t11))
% 0.41/0.71  (step t13 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule implies_neg2)
% 0.41/0.71  (step t14 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t12 t13))
% 0.41/0.71  (step t15 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule contraction :premises (t14))
% 0.41/0.71  (step t16 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule implies :premises (t15))
% 0.41/0.71  (step t17 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule resolution :premises (t3 t16))
% 0.41/0.71  (step t18 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (a193))
% 0.41/0.71  (step t19 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule resolution :premises (t17 a186 a189 t18))
% 0.41/0.71  (step t20 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule equiv_pos2)
% 0.41/0.71  (step t21 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 0.41/0.71  (step t22 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 0.41/0.71  (step t23 (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.41/0.71  (step t24 (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 (t23))
% 0.41/0.71  (step t25 (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.41/0.71  (step t26 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule refl)
% 0.41/0.71  (step t27 (cl (= (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule all_simplify)
% 0.41/0.71  (step t28 (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 (t26 t27))
% 0.41/0.71  (step t29 (cl (= (= (tptp.segmentP tptp.sk2 tptp.sk1) (tptp.segmentP tptp.sk2 tptp.sk1)) true)) :rule all_simplify)
% 0.41/0.71  (step t30 (cl (= (= (tptp.segmentP tptp.sk2 tptp.sk1) (not (not (tptp.segmentP tptp.sk2 tptp.sk1)))) true)) :rule trans :premises (t28 t29))
% 0.41/0.71  (step t31 (cl (= (= (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (tptp.segmentP tptp.sk2 tptp.sk1)) true)) :rule trans :premises (t25 t30))
% 0.41/0.71  (step t32 (cl (= (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule resolution :premises (t24 t31))
% 0.41/0.71  (step t33 (cl (= (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule refl)
% 0.41/0.71  (step t34 (cl (= (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule refl)
% 0.41/0.71  (step t35 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))))) :rule cong :premises (t21 t22 t32 t33 t34))
% 0.41/0.71  (step t36 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule and_neg)
% 0.41/0.71  (step t37 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule implies_neg1)
% 0.41/0.71  (anchor :step t38)
% 0.41/0.71  (assume t38.a0 (= tptp.sk2 tptp.sk4))
% 0.41/0.71  (assume t38.a1 (= tptp.sk1 tptp.sk3))
% 0.41/0.71  (assume t38.a2 (not (tptp.segmentP tptp.sk2 tptp.sk1)))
% 0.41/0.71  (assume t38.a3 (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 0.41/0.71  (step t38.t1 (cl (=> (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.41/0.71  (anchor :step t38.t2)
% 0.41/0.71  (assume t38.t2.a0 (not (tptp.segmentP tptp.sk2 tptp.sk1)))
% 0.41/0.71  (assume t38.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.41/0.71  (assume t38.t2.a2 (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 0.41/0.71  (assume t38.t2.a3 (= tptp.sk1 tptp.sk3))
% 0.41/0.71  (step t38.t2.t1 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) false) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule equiv_simplify)
% 0.41/0.71  (step t38.t2.t2 (cl (not (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) false)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule equiv1 :premises (t38.t2.t1))
% 0.41/0.71  (step t38.t2.t3 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk4)) :rule symm :premises (t38.t2.a2))
% 0.41/0.71  (step t38.t2.t4 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t38.t2.a1))
% 0.41/0.71  (step t38.t2.t5 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk2)) :rule trans :premises (t38.t2.t3 t38.t2.t4))
% 0.41/0.71  (step t38.t2.t6 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t38.t2.a3))
% 0.41/0.71  (step t38.t2.t7 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule cong :premises (t38.t2.t5 t38.t2.t6))
% 0.41/0.71  (step t38.t2.t8 (cl (= (= (tptp.segmentP tptp.sk2 tptp.sk1) false) (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule equiv_simplify)
% 0.41/0.71  (step t38.t2.t9 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) false) (not (not (tptp.segmentP tptp.sk2 tptp.sk1)))) :rule equiv2 :premises (t38.t2.t8))
% 0.41/0.71  (step t38.t2.t10 (cl (not (not (not (tptp.segmentP tptp.sk2 tptp.sk1)))) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule not_not)
% 0.41/0.71  (step t38.t2.t11 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) false) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule resolution :premises (t38.t2.t9 t38.t2.t10))
% 0.41/0.71  (step t38.t2.t12 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) false)) :rule resolution :premises (t38.t2.t11 t38.t2.a0))
% 0.41/0.71  (step t38.t2.t13 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) false)) :rule trans :premises (t38.t2.t7 t38.t2.t12))
% 0.41/0.71  (step t38.t2.t14 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule resolution :premises (t38.t2.t2 t38.t2.t13))
% 0.41/0.71  (step t38.t2 (cl (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule subproof :discharge (t38.t2.a0 t38.t2.a1 t38.t2.a2 t38.t2.a3))
% 0.41/0.71  (step t38.t3 (cl (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (tptp.segmentP tptp.sk2 tptp.sk1))) :rule and_pos)
% 0.41/0.71  (step t38.t4 (cl (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.41/0.71  (step t38.t5 (cl (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 0.41/0.71  (step t38.t6 (cl (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.41/0.71  (step t38.t7 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t38.t2 t38.t3 t38.t4 t38.t5 t38.t6))
% 0.41/0.71  (step t38.t8 (cl (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule reordering :premises (t38.t7))
% 0.41/0.71  (step t38.t9 (cl (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule contraction :premises (t38.t8))
% 0.41/0.71  (step t38.t10 (cl (=> (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule resolution :premises (t38.t1 t38.t9))
% 0.41/0.71  (step t38.t11 (cl (=> (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule implies_neg2)
% 0.41/0.71  (step t38.t12 (cl (=> (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (=> (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule resolution :premises (t38.t10 t38.t11))
% 0.41/0.71  (step t38.t13 (cl (=> (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule contraction :premises (t38.t12))
% 0.41/0.71  (step t38.t14 (cl (not (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule implies :premises (t38.t13))
% 0.41/0.71  (step t38.t15 (cl (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.41/0.71  (step t38.t16 (cl (and (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t38.t15 t38.a2 t38.a0 t38.a3 t38.a1))
% 0.41/0.71  (step t38.t17 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule resolution :premises (t38.t14 t38.t16))
% 0.41/0.71  (step t38 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule subproof :discharge (t38.a0 t38.a1 t38.a2 t38.a3))
% 0.41/0.71  (step t39 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.41/0.71  (step t40 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.41/0.71  (step t41 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (tptp.segmentP tptp.sk2 tptp.sk1))) :rule and_pos)
% 0.41/0.71  (step t42 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 0.41/0.71  (step t43 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule resolution :premises (t38 t39 t40 t41 t42))
% 0.41/0.71  (step t44 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule reordering :premises (t43))
% 0.41/0.71  (step t45 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule contraction :premises (t44))
% 0.41/0.71  (step t46 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule resolution :premises (t37 t45))
% 0.41/0.71  (step t47 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule implies_neg2)
% 0.41/0.71  (step t48 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule resolution :premises (t46 t47))
% 0.41/0.71  (step t49 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule contraction :premises (t48))
% 0.41/0.71  (step t50 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule implies :premises (t49))
% 0.41/0.71  (step t51 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule resolution :premises (t36 t50))
% 0.41/0.71  (step t52 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 0.41/0.71  (step t53 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 0.41/0.71  (step t54 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (not (not (tptp.segmentP tptp.sk2 tptp.sk1))))) :rule or_neg)
% 0.41/0.71  (step t55 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule or_neg)
% 0.41/0.71  (step t56 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule or_neg)
% 0.41/0.71  (step t57 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule resolution :premises (t51 t52 t53 t54 t55 t56))
% 0.41/0.71  (step t58 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.segmentP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule contraction :premises (t57))
% 0.41/0.71  (step t59 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule resolution :premises (t20 t35 t58))
% 0.41/0.71  (step t60 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule or :premises (t59))
% 0.41/0.71  (step t61 (cl (tptp.segmentP tptp.sk2 tptp.sk1) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule reordering :premises (t60))
% 0.41/0.71  (step t62 (cl (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.totalorderedP tptp.sk1))) :rule or :premises (a198))
% 0.41/0.71  (step t63 (cl (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (tptp.totalorderedP tptp.sk3))) :rule and_neg)
% 0.41/0.71  (step t64 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP tptp.sk1)) (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3))) :rule implies_neg1)
% 0.41/0.71  (anchor :step t65)
% 0.41/0.71  (assume t65.a0 (= tptp.sk1 tptp.sk3))
% 0.41/0.71  (assume t65.a1 (tptp.totalorderedP tptp.sk3))
% 0.41/0.71  (step t65.t1 (cl (=> (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3)) (tptp.totalorderedP tptp.sk1)) (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.41/0.71  (anchor :step t65.t2)
% 0.41/0.71  (assume t65.t2.a0 (tptp.totalorderedP tptp.sk3))
% 0.41/0.71  (assume t65.t2.a1 (= tptp.sk1 tptp.sk3))
% 0.41/0.71  (step t65.t2.t1 (cl (= (= (tptp.totalorderedP tptp.sk1) true) (tptp.totalorderedP tptp.sk1))) :rule equiv_simplify)
% 0.41/0.71  (step t65.t2.t2 (cl (not (= (tptp.totalorderedP tptp.sk1) true)) (tptp.totalorderedP tptp.sk1)) :rule equiv1 :premises (t65.t2.t1))
% 0.41/0.71  (step t65.t2.t3 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t65.t2.a1))
% 0.41/0.71  (step t65.t2.t4 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t65.t2.t3))
% 0.41/0.71  (step t65.t2.t5 (cl (= (tptp.totalorderedP tptp.sk1) (tptp.totalorderedP tptp.sk3))) :rule cong :premises (t65.t2.t4))
% 0.41/0.71  (step t65.t2.t6 (cl (= (= (tptp.totalorderedP tptp.sk3) true) (tptp.totalorderedP tptp.sk3))) :rule equiv_simplify)
% 0.41/0.71  (step t65.t2.t7 (cl (= (tptp.totalorderedP tptp.sk3) true) (not (tptp.totalorderedP tptp.sk3))) :rule equiv2 :premises (t65.t2.t6))
% 0.41/0.71  (step t65.t2.t8 (cl (= (tptp.totalorderedP tptp.sk3) true)) :rule resolution :premises (t65.t2.t7 t65.t2.a0))
% 0.41/0.71  (step t65.t2.t9 (cl (= (tptp.totalorderedP tptp.sk1) true)) :rule trans :premises (t65.t2.t5 t65.t2.t8))
% 0.41/0.71  (step t65.t2.t10 (cl (tptp.totalorderedP tptp.sk1)) :rule resolution :premises (t65.t2.t2 t65.t2.t9))
% 0.41/0.71  (step t65.t2 (cl (not (tptp.totalorderedP tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (tptp.totalorderedP tptp.sk1)) :rule subproof :discharge (t65.t2.a0 t65.t2.a1))
% 0.41/0.71  (step t65.t3 (cl (not (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3))) (tptp.totalorderedP tptp.sk3)) :rule and_pos)
% 0.41/0.71  (step t65.t4 (cl (not (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.41/0.71  (step t65.t5 (cl (tptp.totalorderedP tptp.sk1) (not (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3))) (not (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t65.t2 t65.t3 t65.t4))
% 0.41/0.71  (step t65.t6 (cl (not (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3))) (not (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3))) (tptp.totalorderedP tptp.sk1)) :rule reordering :premises (t65.t5))
% 0.41/0.71  (step t65.t7 (cl (not (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3))) (tptp.totalorderedP tptp.sk1)) :rule contraction :premises (t65.t6))
% 0.41/0.71  (step t65.t8 (cl (=> (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3)) (tptp.totalorderedP tptp.sk1)) (tptp.totalorderedP tptp.sk1)) :rule resolution :premises (t65.t1 t65.t7))
% 0.41/0.71  (step t65.t9 (cl (=> (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3)) (tptp.totalorderedP tptp.sk1)) (not (tptp.totalorderedP tptp.sk1))) :rule implies_neg2)
% 0.41/0.71  (step t65.t10 (cl (=> (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3)) (tptp.totalorderedP tptp.sk1)) (=> (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3)) (tptp.totalorderedP tptp.sk1))) :rule resolution :premises (t65.t8 t65.t9))
% 0.41/0.71  (step t65.t11 (cl (=> (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3)) (tptp.totalorderedP tptp.sk1))) :rule contraction :premises (t65.t10))
% 0.41/0.71  (step t65.t12 (cl (not (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3))) (tptp.totalorderedP tptp.sk1)) :rule implies :premises (t65.t11))
% 0.41/0.71  (step t65.t13 (cl (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3)) (not (tptp.totalorderedP tptp.sk3)) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.41/0.71  (step t65.t14 (cl (and (tptp.totalorderedP tptp.sk3) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t65.t13 t65.a1 t65.a0))
% 0.41/0.71  (step t65.t15 (cl (tptp.totalorderedP tptp.sk1)) :rule resolution :premises (t65.t12 t65.t14))
% 0.41/0.71  (step t65 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP tptp.sk1)) :rule subproof :discharge (t65.a0 t65.a1))
% 0.41/0.71  (step t66 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.41/0.71  (step t67 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3))) (tptp.totalorderedP tptp.sk3)) :rule and_pos)
% 0.41/0.71  (step t68 (cl (tptp.totalorderedP tptp.sk1) (not (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3))) (not (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3)))) :rule resolution :premises (t65 t66 t67))
% 0.41/0.71  (step t69 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3))) (not (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3))) (tptp.totalorderedP tptp.sk1)) :rule reordering :premises (t68))
% 0.41/0.71  (step t70 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3))) (tptp.totalorderedP tptp.sk1)) :rule contraction :premises (t69))
% 0.41/0.71  (step t71 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP tptp.sk1)) (tptp.totalorderedP tptp.sk1)) :rule resolution :premises (t64 t70))
% 0.41/0.71  (step t72 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP tptp.sk1)) (not (tptp.totalorderedP tptp.sk1))) :rule implies_neg2)
% 0.41/0.71  (step t73 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP tptp.sk1)) (=> (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP tptp.sk1))) :rule resolution :premises (t71 t72))
% 0.41/0.71  (step t74 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP tptp.sk1))) :rule contraction :premises (t73))
% 0.41/0.71  (step t75 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.totalorderedP tptp.sk3))) (tptp.totalorderedP tptp.sk1)) :rule implies :premises (t74))
% 0.41/0.71  (step t76 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP tptp.sk1)) :rule resolution :premises (t63 t75))
% 0.41/0.71  (step t77 (cl (tptp.totalorderedP tptp.sk1) (not (= tptp.sk1 tptp.sk3)) (not (tptp.totalorderedP tptp.sk3))) :rule reordering :premises (t76))
% 0.41/0.71  (step t78 (cl (tptp.totalorderedP tptp.sk1)) :rule resolution :premises (t77 a190 a194))
% 0.41/0.71  (step t79 (cl (not (tptp.segmentP tptp.sk2 tptp.sk1))) :rule resolution :premises (t62 t78))
% 0.41/0.71  (step t80 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (a193))
% 0.41/0.71  (step t81 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule resolution :premises (t61 t79 a189 a190 t80))
% 0.41/0.71  (step t82 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule implies_neg1)
% 0.41/0.71  (anchor :step t83)
% 0.41/0.71  (assume t83.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))
% 0.41/0.71  (step t83.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.sk3) (:= W tptp.sk6)))
% 0.41/0.71  (step t83.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule or :premises (t83.t1))
% 0.41/0.71  (step t83.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule resolution :premises (t83.t2 t83.a0))
% 0.41/0.71  (step t83 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule subproof :discharge (t83.a0))
% 0.41/0.71  (step t84 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule resolution :premises (t82 t83))
% 0.41/0.71  (step t85 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule implies_neg2)
% 0.41/0.71  (step t86 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule resolution :premises (t84 t85))
% 0.41/0.71  (step t87 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule contraction :premises (t86))
% 0.41/0.71  (step t88 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule implies :premises (t87))
% 0.41/0.71  (step t89 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule equiv_pos2)
% 0.41/0.71  (anchor :step t90 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X)))
% 0.41/0.71  (step t90.t1 (cl (= U U)) :rule refl)
% 0.41/0.71  (step t90.t2 (cl (= V V)) :rule refl)
% 0.41/0.71  (step t90.t3 (cl (= W W)) :rule refl)
% 0.41/0.71  (step t90.t4 (cl (= X X)) :rule refl)
% 0.41/0.71  (step t90.t5 (cl (= (= (tptp.app (tptp.app U V) W) X) (= X (tptp.app (tptp.app U V) W)))) :rule all_simplify)
% 0.41/0.71  (step t90.t6 (cl (= (not (= (tptp.app (tptp.app U V) W) X)) (not (= X (tptp.app (tptp.app U V) W))))) :rule cong :premises (t90.t5))
% 0.41/0.71  (step t90.t7 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 0.41/0.71  (step t90.t8 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.41/0.71  (step t90.t9 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.41/0.71  (step t90.t10 (cl (= (not (tptp.ssList X)) (not (tptp.ssList X)))) :rule refl)
% 0.41/0.71  (step t90.t11 (cl (= (tptp.segmentP X V) (tptp.segmentP X V))) :rule refl)
% 0.41/0.71  (step t90.t12 (cl (= (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)) (or (not (= X (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V)))) :rule cong :premises (t90.t6 t90.t7 t90.t8 t90.t9 t90.t10 t90.t11))
% 0.41/0.71  (step t90 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= X (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))) :rule bind)
% 0.41/0.71  (step t91 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= X (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) :rule all_simplify)
% 0.41/0.71  (anchor :step t92 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W)))
% 0.41/0.71  (step t92.t1 (cl (= U U)) :rule refl)
% 0.41/0.71  (step t92.t2 (cl (= V V)) :rule refl)
% 0.41/0.71  (step t92.t3 (cl (= W W)) :rule refl)
% 0.41/0.71  (step t92.t4 (cl (= (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W)) true)) :rule all_simplify)
% 0.41/0.71  (step t92.t5 (cl (= (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not true))) :rule cong :premises (t92.t4))
% 0.41/0.71  (step t92.t6 (cl (= (not true) false)) :rule all_simplify)
% 0.41/0.71  (step t92.t7 (cl (= (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) false)) :rule trans :premises (t92.t5 t92.t6))
% 0.41/0.71  (step t92.t8 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 0.41/0.71  (step t92.t9 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.41/0.71  (step t92.t10 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.41/0.71  (step t92.t11 (cl (= (not (tptp.ssList (tptp.app (tptp.app U V) W))) (not (tptp.ssList (tptp.app (tptp.app U V) W))))) :rule refl)
% 0.41/0.71  (step t92.t12 (cl (= (tptp.segmentP (tptp.app (tptp.app U V) W) V) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) :rule refl)
% 0.41/0.71  (step t92.t13 (cl (= (or (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)) (or false (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule cong :premises (t92.t7 t92.t8 t92.t9 t92.t10 t92.t11 t92.t12))
% 0.41/0.71  (step t92.t14 (cl (= (or false (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule all_simplify)
% 0.41/0.71  (step t92.t15 (cl (= (or (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule trans :premises (t92.t13 t92.t14))
% 0.41/0.71  (step t92 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) :rule bind)
% 0.41/0.71  (step t93 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= X (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) :rule trans :premises (t91 t92))
% 0.41/0.71  (step t94 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) :rule trans :premises (t90 t93))
% 0.41/0.71  (step t95 (cl (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule resolution :premises (t89 t94 a172))
% 0.41/0.71  (step t96 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule resolution :premises (t88 t95))
% 0.41/0.71  (step t97 (cl) :rule resolution :premises (t2 t19 t81 t96 a192 a191 a187))
% 0.41/0.71  
% 0.41/0.71  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.LsJi05KdQQ/cvc5---1.0.5_22608.smt2
% 0.41/0.72  % cvc5---1.0.5 exiting
% 0.41/0.72  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------