%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SWC127+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 : n015.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:43 EDT 2022 % Result : Theorem 5.26s 5.41s % Output : Proof 5.26s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWC127+1 : TPTP v8.1.0. Released v2.4.0. % 0.03/0.13 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % 0.13/0.34 % Computer : n015.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 15:44:37 EDT 2022 % 0.13/0.34 % CPUTime : % 5.26/5.41 % SZS status Theorem % 5.26/5.41 (* PROOF-FOUND *) % 5.26/5.41 (* BEGIN-PROOF *) % 5.26/5.41 % SZS output start Proof % 5.26/5.41 1. (ssList T_0) (-. (ssList T_0)) ### Axiom % 5.26/5.41 2. (ssList (nil)) (-. (ssList (nil))) ### Axiom % 5.26/5.41 3. ((nil) != T_0) (T_0 = (nil)) ### Sym(=) % 5.26/5.41 4. (-. (T_0 != (nil))) ((nil) != T_0) ### NotNot 3 % 5.26/5.41 5. (-. (neq T_0 (nil))) (neq T_0 (nil)) ### Axiom % 5.26/5.41 6. ((neq T_0 (nil)) <=> (T_0 != (nil))) (-. (neq T_0 (nil))) ((nil) != T_0) ### Equiv 4 5 % 5.26/5.41 7. ((ssList (nil)) => ((neq T_0 (nil)) <=> (T_0 != (nil)))) ((nil) != T_0) (-. (neq T_0 (nil))) (ssList (nil)) ### Imply 2 6 % 5.26/5.41 8. (All V, ((ssList V) => ((neq T_0 V) <=> (T_0 != V)))) (ssList (nil)) (-. (neq T_0 (nil))) ((nil) != T_0) ### All 7 % 5.26/5.41 9. (T_1 != T_1) ### Refl(=) % 5.26/5.41 10. (T_1 != (nil)) (T_0 = T_1) (-. (neq T_0 (nil))) (ssList (nil)) (All V, ((ssList V) => ((neq T_0 V) <=> (T_0 != V)))) ### Trans-sym 8 9 % 5.26/5.41 11. ((ssList T_0) => (All V, ((ssList V) => ((neq T_0 V) <=> (T_0 != V))))) (ssList (nil)) (-. (neq T_0 (nil))) (T_0 = T_1) (T_1 != (nil)) (ssList T_0) ### Imply 1 10 % 5.26/5.41 12. (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_0) (T_1 != (nil)) (T_0 = T_1) (-. (neq T_0 (nil))) (ssList (nil)) ### All 11 % 5.26/5.41 13. (-. (singletonP (nil))) (singletonP T_1) (ssList (nil)) (-. (neq T_0 (nil))) (T_0 = T_1) (ssList T_0) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) ### P-NotP 12 % 5.26/5.41 14. (T_2 = T_3) (T_3 != T_2) ### Sym(=) % 5.26/5.41 15. (T_0 = T_1) (T_1 != T_0) ### Sym(=) % 5.26/5.41 16. (-. (segmentP T_2 T_0)) (segmentP T_3 T_1) (T_0 = T_1) (T_2 = T_3) ### P-NotP 14 15 % 5.26/5.41 17. (-. ((neq T_0 (nil)) /\ (segmentP T_2 T_0))) (T_2 = T_3) (segmentP T_3 T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_0) (T_0 = T_1) (ssList (nil)) (singletonP T_1) (-. (singletonP (nil))) ### NotAnd 13 16 % 5.26/5.41 18. (-. (-. (singletonP T_1))) (-. (singletonP (nil))) (ssList (nil)) (T_0 = T_1) (ssList T_0) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (segmentP T_3 T_1) (T_2 = T_3) (-. ((neq T_0 (nil)) /\ (segmentP T_2 T_0))) ### NotNot 17 % 5.26/5.41 19. (T_2 = T_3) (T_2 != T_3) ### Axiom % 5.26/5.41 20. ((nil) != (nil)) ### NotEqual % 5.26/5.41 21. (-. (neq T_3 (nil))) (neq T_2 (nil)) (T_2 = T_3) ### P-NotP 19 20 % 5.26/5.41 22. (-. ((-. (singletonP T_1)) /\ (neq T_3 (nil)))) (neq T_2 (nil)) (-. ((neq T_0 (nil)) /\ (segmentP T_2 T_0))) (T_2 = T_3) (segmentP T_3 T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_0) (T_0 = T_1) (ssList (nil)) (-. (singletonP (nil))) ### NotAnd 18 21 % 5.26/5.41 23. (-. ((ssList T_3) => ((T_2 != T_3) \/ ((T_0 != T_1) \/ ((-. (neq T_2 (nil))) \/ ((-. (segmentP T_3 T_1)) \/ (((-. (singletonP T_1)) /\ (neq T_3 (nil))) \/ ((neq T_0 (nil)) /\ (segmentP T_2 T_0))))))))) (-. (singletonP (nil))) (ssList (nil)) (ssList T_0) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) ### ConjTree 22 % 5.26/5.41 24. (-. (All X, ((ssList X) => ((T_2 != X) \/ ((T_0 != T_1) \/ ((-. (neq T_2 (nil))) \/ ((-. (segmentP X T_1)) \/ (((-. (singletonP T_1)) /\ (neq X (nil))) \/ ((neq T_0 (nil)) /\ (segmentP T_2 T_0)))))))))) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_0) (ssList (nil)) (-. (singletonP (nil))) ### NotAllEx 23 % 5.26/5.41 25. (-. ((ssList T_1) => (All X, ((ssList X) => ((T_2 != X) \/ ((T_0 != T_1) \/ ((-. (neq T_2 (nil))) \/ ((-. (segmentP X T_1)) \/ (((-. (singletonP T_1)) /\ (neq X (nil))) \/ ((neq T_0 (nil)) /\ (segmentP T_2 T_0))))))))))) (-. (singletonP (nil))) (ssList (nil)) (ssList T_0) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) ### NotImply 24 % 5.26/5.41 26. (-. (All W, ((ssList W) => (All X, ((ssList X) => ((T_2 != X) \/ ((T_0 != W) \/ ((-. (neq T_2 (nil))) \/ ((-. (segmentP X W)) \/ (((-. (singletonP W)) /\ (neq X (nil))) \/ ((neq T_0 (nil)) /\ (segmentP T_2 T_0)))))))))))) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_0) (ssList (nil)) (-. (singletonP (nil))) ### NotAllEx 25 % 5.26/5.41 27. (-. ((ssList T_2) => (All W, ((ssList W) => (All X, ((ssList X) => ((T_2 != X) \/ ((T_0 != W) \/ ((-. (neq T_2 (nil))) \/ ((-. (segmentP X W)) \/ (((-. (singletonP W)) /\ (neq X (nil))) \/ ((neq T_0 (nil)) /\ (segmentP T_2 T_0))))))))))))) (-. (singletonP (nil))) (ssList (nil)) (ssList T_0) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) ### NotImply 26 % 5.26/5.41 28. (-. (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((T_0 != W) \/ ((-. (neq V (nil))) \/ ((-. (segmentP X W)) \/ (((-. (singletonP W)) /\ (neq X (nil))) \/ ((neq T_0 (nil)) /\ (segmentP V T_0)))))))))))))) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_0) (ssList (nil)) (-. (singletonP (nil))) ### NotAllEx 27 % 5.26/5.41 29. (-. ((ssList T_0) => (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((T_0 != W) \/ ((-. (neq V (nil))) \/ ((-. (segmentP X W)) \/ (((-. (singletonP W)) /\ (neq X (nil))) \/ ((neq T_0 (nil)) /\ (segmentP V T_0))))))))))))))) (-. (singletonP (nil))) (ssList (nil)) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) ### NotImply 28 % 5.26/5.41 30. (-. (All U, ((ssList U) => (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((U != W) \/ ((-. (neq V (nil))) \/ ((-. (segmentP X W)) \/ (((-. (singletonP W)) /\ (neq X (nil))) \/ ((neq U (nil)) /\ (segmentP V U)))))))))))))))) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList (nil)) (-. (singletonP (nil))) ### NotAllEx 29 % 5.26/5.41 % SZS output end Proof % 5.26/5.41 (* END-PROOF *) %------------------------------------------------------------------------------