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

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

% Result   : Unsatisfiable 0.60s 0.82s
% Output   : Proof 0.60s
% Verified : 
% SZS Type : -

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