TSTP Solution File: SWC116+1 by SuperZenon---0.0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : SWC116+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_super_zenon -p0 -itptp -om -max-time %d %s

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 22:06:39 EDT 2022

% Result   : Theorem 0.54s 0.75s
% Output   : Proof 0.54s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWC116+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13  % Command  : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 12 07:55:08 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.54/0.75  % SZS status Theorem
% 0.54/0.75  (* PROOF-FOUND *)
% 0.54/0.75  (* BEGIN-PROOF *)
% 0.54/0.75  % SZS output start Proof
% 0.54/0.75  1. (T_0 != T_0)   ### Refl(=)
% 0.54/0.75  2. (ssList T_1) (-. (ssList T_1))   ### Axiom
% 0.54/0.75  3. (ssList (nil)) (-. (ssList (nil)))   ### Axiom
% 0.54/0.75  4. (T_1 != (nil)) (T_1 = (nil))   ### Axiom
% 0.54/0.75  5. (-. (T_1 != (nil))) (T_1 != (nil))   ### NotNot 4
% 0.54/0.75  6. (-. (neq T_1 (nil))) (neq T_1 (nil))   ### Axiom
% 0.54/0.75  7. ((neq T_1 (nil)) <=> (T_1 != (nil))) (-. (neq T_1 (nil))) (T_1 != (nil))   ### Equiv 5 6
% 0.54/0.75  8. ((ssList (nil)) => ((neq T_1 (nil)) <=> (T_1 != (nil)))) (T_1 != (nil)) (-. (neq T_1 (nil))) (ssList (nil))   ### Imply 3 7
% 0.54/0.75  9. (All V, ((ssList V) => ((neq T_1 V) <=> (T_1 != V)))) (ssList (nil)) (-. (neq T_1 (nil))) (T_1 != (nil))   ### All 8
% 0.54/0.75  10. ((ssList T_1) => (All V, ((ssList V) => ((neq T_1 V) <=> (T_1 != V))))) (T_1 != (nil)) (-. (neq T_1 (nil))) (ssList (nil)) (ssList T_1)   ### Imply 2 9
% 0.54/0.75  11. (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (ssList (nil)) (-. (neq T_1 (nil))) (T_1 != (nil))   ### All 10
% 0.54/0.75  12. ((nil) != T_0) (T_0 = T_1) (-. (neq T_1 (nil))) (ssList (nil)) (ssList T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V))))))   ### Trans-sym 1 11
% 0.54/0.75  13. (T_2 = T_3) (T_3 != T_2)   ### Sym(=)
% 0.54/0.75  14. ((nil) != (nil))   ### NotEqual
% 0.54/0.75  15. (-. (neq T_2 (nil))) (neq T_3 (nil)) (T_2 = T_3)   ### P-NotP 13 14
% 0.54/0.75  16. (-. (-. (neq T_3 (nil)))) (T_2 = T_3) (-. (neq T_2 (nil)))   ### NotNot 15
% 0.54/0.75  17. (-. ((-. (neq T_3 (nil))) \/ (-. (segmentP T_1 T_3)))) (-. (neq T_2 (nil))) (T_2 = T_3)   ### NotOr 16
% 0.54/0.75  18. (-. ((neq T_1 (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (segmentP T_1 T_3))))) (T_2 = T_3) (-. (neq T_2 (nil))) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (ssList (nil)) (T_0 = T_1) ((nil) != T_0)   ### NotAnd 12 17
% 0.54/0.75  19. (T_0 = T_1) (T_1 != T_0)   ### Sym(=)
% 0.54/0.75  20. (T_2 = T_3) (T_3 != T_2)   ### Sym(=)
% 0.54/0.75  21. (-. (segmentP T_0 T_2)) (segmentP T_1 T_3) (T_2 = T_3) (T_0 = T_1)   ### P-NotP 19 20
% 0.54/0.75  22. (-. (-. (segmentP T_1 T_3))) (T_0 = T_1) (T_2 = T_3) (-. (segmentP T_0 T_2))   ### NotNot 21
% 0.54/0.75  23. (-. ((-. (neq T_3 (nil))) \/ (-. (segmentP T_1 T_3)))) (-. (segmentP T_0 T_2)) (T_2 = T_3) (T_0 = T_1)   ### NotOr 22
% 0.54/0.75  24. (-. ((neq T_1 (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (segmentP T_1 T_3))))) (T_2 = T_3) (-. (segmentP T_0 T_2)) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (ssList (nil)) (T_0 = T_1) ((nil) != T_0)   ### NotAnd 12 23
% 0.54/0.75  25. (-. ((neq T_2 (nil)) /\ (segmentP T_0 T_2))) ((nil) != T_0) (T_0 = T_1) (ssList (nil)) (ssList T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (T_2 = T_3) (-. ((neq T_1 (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (segmentP T_1 T_3)))))   ### NotAnd 18 24
% 0.54/0.75  26. (T_2 = T_3) (T_3 != T_2)   ### Sym(=)
% 0.54/0.75  27. ((nil) != T_2) ((nil) = T_3) (T_2 = T_3)   ### Trans 14 26
% 0.54/0.75  28. (-. (((nil) = T_0) /\ ((nil) = T_2))) ((nil) = T_3) (-. ((neq T_1 (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (segmentP T_1 T_3))))) (T_2 = T_3) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (ssList (nil)) (T_0 = T_1) (-. ((neq T_2 (nil)) /\ (segmentP T_0 T_2)))   ### NotAnd 25 27
% 0.54/0.75  29. (-. ((nil) != T_3)) (-. ((neq T_2 (nil)) /\ (segmentP T_0 T_2))) (T_0 = T_1) (ssList (nil)) (ssList T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (T_2 = T_3) (-. ((neq T_1 (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (segmentP T_1 T_3))))) (-. (((nil) = T_0) /\ ((nil) = T_2)))   ### NotNot 28
% 0.54/0.75  30. (ssList T_1) (-. (ssList T_1))   ### Axiom
% 0.54/0.75  31. (ssList (nil)) (-. (ssList (nil)))   ### Axiom
% 0.54/0.75  32. ((nil) != T_1) (T_1 = (nil))   ### Sym(=)
% 0.54/0.75  33. (-. (T_1 != (nil))) ((nil) != T_1)   ### NotNot 32
% 0.54/0.75  34. (-. (neq T_1 (nil))) (neq T_1 (nil))   ### Axiom
% 0.54/0.75  35. ((neq T_1 (nil)) <=> (T_1 != (nil))) (-. (neq T_1 (nil))) ((nil) != T_1)   ### Equiv 33 34
% 0.54/0.75  36. ((ssList (nil)) => ((neq T_1 (nil)) <=> (T_1 != (nil)))) ((nil) != T_1) (-. (neq T_1 (nil))) (ssList (nil))   ### Imply 31 35
% 0.54/0.75  37. (All V, ((ssList V) => ((neq T_1 V) <=> (T_1 != V)))) (ssList (nil)) (-. (neq T_1 (nil))) ((nil) != T_1)   ### All 36
% 0.54/0.75  38. ((ssList T_1) => (All V, ((ssList V) => ((neq T_1 V) <=> (T_1 != V))))) ((nil) != T_1) (-. (neq T_1 (nil))) (ssList (nil)) (ssList T_1)   ### Imply 30 37
% 0.54/0.75  39. (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (ssList (nil)) (-. (neq T_1 (nil))) ((nil) != T_1)   ### All 38
% 0.54/0.75  40. (-. ((neq T_1 (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (segmentP T_1 T_3))))) (T_2 = T_3) (-. (neq T_2 (nil))) ((nil) != T_1) (ssList (nil)) (ssList T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V))))))   ### NotAnd 39 17
% 0.54/0.75  41. (-. ((neq T_1 (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (segmentP T_1 T_3))))) (T_0 = T_1) (T_2 = T_3) (-. (segmentP T_0 T_2)) ((nil) != T_1) (ssList (nil)) (ssList T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V))))))   ### NotAnd 39 23
% 0.54/0.75  42. (-. ((neq T_2 (nil)) /\ (segmentP T_0 T_2))) (T_0 = T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (ssList (nil)) ((nil) != T_1) (T_2 = T_3) (-. ((neq T_1 (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (segmentP T_1 T_3)))))   ### NotAnd 40 41
% 0.54/0.75  43. (-. (((nil) != T_3) /\ ((nil) = T_1))) (-. (((nil) = T_0) /\ ((nil) = T_2))) (-. ((neq T_1 (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (segmentP T_1 T_3))))) (T_2 = T_3) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (ssList (nil)) (T_0 = T_1) (-. ((neq T_2 (nil)) /\ (segmentP T_0 T_2)))   ### NotAnd 29 42
% 0.54/0.75  44. (-. ((ssList T_1) => ((T_0 != T_1) \/ ((T_2 != T_3) \/ ((((nil) != T_3) /\ ((nil) = T_1)) \/ ((((nil) = T_0) /\ ((nil) = T_2)) \/ (((neq T_2 (nil)) /\ (segmentP T_0 T_2)) \/ ((neq T_1 (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (segmentP T_1 T_3))))))))))) (ssList (nil)) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V))))))   ### ConjTree 43
% 0.54/0.75  45. (-. (All X, ((ssList X) => ((T_0 != X) \/ ((T_2 != T_3) \/ ((((nil) != T_3) /\ ((nil) = X)) \/ ((((nil) = T_0) /\ ((nil) = T_2)) \/ (((neq T_2 (nil)) /\ (segmentP T_0 T_2)) \/ ((neq X (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (segmentP X T_3)))))))))))) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList (nil))   ### NotAllEx 44
% 0.54/0.75  46. (-. ((ssList T_3) => (All X, ((ssList X) => ((T_0 != X) \/ ((T_2 != T_3) \/ ((((nil) != T_3) /\ ((nil) = X)) \/ ((((nil) = T_0) /\ ((nil) = T_2)) \/ (((neq T_2 (nil)) /\ (segmentP T_0 T_2)) \/ ((neq X (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (segmentP X T_3))))))))))))) (ssList (nil)) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V))))))   ### NotImply 45
% 0.54/0.75  47. (-. (All W, ((ssList W) => (All X, ((ssList X) => ((T_0 != X) \/ ((T_2 != W) \/ ((((nil) != W) /\ ((nil) = X)) \/ ((((nil) = T_0) /\ ((nil) = T_2)) \/ (((neq T_2 (nil)) /\ (segmentP T_0 T_2)) \/ ((neq X (nil)) /\ ((-. (neq W (nil))) \/ (-. (segmentP X W)))))))))))))) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList (nil))   ### NotAllEx 46
% 0.54/0.75  48. (-. ((ssList T_0) => (All W, ((ssList W) => (All X, ((ssList X) => ((T_0 != X) \/ ((T_2 != W) \/ ((((nil) != W) /\ ((nil) = X)) \/ ((((nil) = T_0) /\ ((nil) = T_2)) \/ (((neq T_2 (nil)) /\ (segmentP T_0 T_2)) \/ ((neq X (nil)) /\ ((-. (neq W (nil))) \/ (-. (segmentP X W))))))))))))))) (ssList (nil)) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V))))))   ### NotImply 47
% 0.54/0.75  49. (-. (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((T_2 != W) \/ ((((nil) != W) /\ ((nil) = X)) \/ ((((nil) = V) /\ ((nil) = T_2)) \/ (((neq T_2 (nil)) /\ (segmentP V T_2)) \/ ((neq X (nil)) /\ ((-. (neq W (nil))) \/ (-. (segmentP X W)))))))))))))))) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList (nil))   ### NotAllEx 48
% 0.54/0.75  50. (-. ((ssList T_2) => (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((T_2 != W) \/ ((((nil) != W) /\ ((nil) = X)) \/ ((((nil) = V) /\ ((nil) = T_2)) \/ (((neq T_2 (nil)) /\ (segmentP V T_2)) \/ ((neq X (nil)) /\ ((-. (neq W (nil))) \/ (-. (segmentP X W))))))))))))))))) (ssList (nil)) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V))))))   ### NotImply 49
% 0.54/0.75  51. (-. (All U, ((ssList U) => (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((U != W) \/ ((((nil) != W) /\ ((nil) = X)) \/ ((((nil) = V) /\ ((nil) = U)) \/ (((neq U (nil)) /\ (segmentP V U)) \/ ((neq X (nil)) /\ ((-. (neq W (nil))) \/ (-. (segmentP X W)))))))))))))))))) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList (nil))   ### NotAllEx 50
% 0.54/0.75  % SZS output end Proof
% 0.54/0.75  (* END-PROOF *)
%------------------------------------------------------------------------------