%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SWC129+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 : n008.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 1.35s 1.52s % Output : Proof 1.35s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWC129+1 : TPTP v8.1.0. Released v2.4.0. % 0.06/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % 0.12/0.33 % Computer : n008.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun Jun 12 09:03:37 EDT 2022 % 0.12/0.33 % CPUTime : % 1.35/1.52 % SZS status Theorem % 1.35/1.52 (* PROOF-FOUND *) % 1.35/1.52 (* BEGIN-PROOF *) % 1.35/1.52 % SZS output start Proof % 1.35/1.52 1. (ssList T_0) (-. (ssList T_0)) ### Axiom % 1.35/1.52 2. (ssList (nil)) (-. (ssList (nil))) ### Axiom % 1.35/1.52 3. (ssList T_1) (-. (ssList T_1)) ### Axiom % 1.35/1.52 4. (ssList T_1) (-. (ssList T_1)) ### Axiom % 1.35/1.52 5. (-. (T_1 != T_1)) (T_1 != T_1) ### Axiom % 1.35/1.52 6. (T_0 = (nil)) (T_0 != (nil)) ### Axiom % 1.35/1.52 7. ((nil) != T_1) (T_1 = T_0) (T_0 = (nil)) (-. (T_1 != T_1)) ### Trans-sym 5 6 % 1.35/1.52 8. (T_1 != T_1) ### Refl(=) % 1.35/1.52 9. ((neq T_1 T_1) <=> (T_1 != T_1)) (T_0 = (nil)) (T_1 = T_0) ((nil) != T_1) ### Equiv 7 8 % 1.35/1.52 10. ((ssList T_1) => ((neq T_1 T_1) <=> (T_1 != T_1))) ((nil) != T_1) (T_1 = T_0) (T_0 = (nil)) (ssList T_1) ### Imply 4 9 % 1.35/1.52 11. (All V, ((ssList V) => ((neq T_1 V) <=> (T_1 != V)))) (ssList T_1) (T_0 = (nil)) (T_1 = T_0) ((nil) != T_1) ### All 10 % 1.35/1.52 12. ((ssList T_1) => (All V, ((ssList V) => ((neq T_1 V) <=> (T_1 != V))))) ((nil) != T_1) (T_1 = T_0) (T_0 = (nil)) (ssList T_1) ### Imply 3 11 % 1.35/1.52 13. (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (T_0 = (nil)) (T_1 = T_0) ((nil) != T_1) ### All 12 % 1.35/1.52 14. (-. (T_0 != (nil))) ((nil) != T_1) (T_1 = T_0) (ssList T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) ### NotNot 13 % 1.35/1.52 15. (-. (neq T_0 (nil))) (neq T_0 (nil)) ### Axiom % 1.35/1.52 16. ((neq T_0 (nil)) <=> (T_0 != (nil))) (-. (neq T_0 (nil))) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (T_1 = T_0) ((nil) != T_1) ### Equiv 14 15 % 1.35/1.52 17. ((ssList (nil)) => ((neq T_0 (nil)) <=> (T_0 != (nil)))) ((nil) != T_1) (T_1 = T_0) (ssList T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (-. (neq T_0 (nil))) (ssList (nil)) ### Imply 2 16 % 1.35/1.52 18. (All V, ((ssList V) => ((neq T_0 V) <=> (T_0 != V)))) (ssList (nil)) (-. (neq T_0 (nil))) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (T_1 = T_0) ((nil) != T_1) ### All 17 % 1.35/1.52 19. ((ssList T_0) => (All V, ((ssList V) => ((neq T_0 V) <=> (T_0 != V))))) ((nil) != T_1) (T_1 = T_0) (ssList T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (-. (neq T_0 (nil))) (ssList (nil)) (ssList T_0) ### Imply 1 18 % 1.35/1.52 20. (ssList T_0) (ssList (nil)) (-. (neq T_0 (nil))) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (T_1 = T_0) ((nil) != T_1) ### All 19 % 1.35/1.52 21. (-. (cyclefreeP T_1)) (cyclefreeP (nil)) (T_1 = T_0) (ssList T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (-. (neq T_0 (nil))) (ssList (nil)) (ssList T_0) ### P-NotP 20 % 1.35/1.52 22. (-. ((ssList T_0) => ((T_1 != T_0) \/ ((T_2 != T_3) \/ ((neq T_0 (nil)) \/ (cyclefreeP T_1)))))) (ssList (nil)) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (cyclefreeP (nil)) ### ConjTree 21 % 1.35/1.52 23. (-. (All X, ((ssList X) => ((T_1 != X) \/ ((T_2 != T_3) \/ ((neq X (nil)) \/ (cyclefreeP T_1))))))) (cyclefreeP (nil)) (ssList T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList (nil)) ### NotAllEx 22 % 1.35/1.52 24. (-. ((ssList T_3) => (All X, ((ssList X) => ((T_1 != X) \/ ((T_2 != T_3) \/ ((neq X (nil)) \/ (cyclefreeP T_1)))))))) (ssList (nil)) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList T_1) (cyclefreeP (nil)) ### NotImply 23 % 1.35/1.52 25. (-. (All W, ((ssList W) => (All X, ((ssList X) => ((T_1 != X) \/ ((T_2 != W) \/ ((neq X (nil)) \/ (cyclefreeP T_1))))))))) (cyclefreeP (nil)) (ssList T_1) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList (nil)) ### NotAllEx 24 % 1.35/1.52 26. (-. ((ssList T_1) => (All W, ((ssList W) => (All X, ((ssList X) => ((T_1 != X) \/ ((T_2 != W) \/ ((neq X (nil)) \/ (cyclefreeP T_1)))))))))) (ssList (nil)) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (cyclefreeP (nil)) ### NotImply 25 % 1.35/1.52 27. (-. (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((T_2 != W) \/ ((neq X (nil)) \/ (cyclefreeP V))))))))))) (cyclefreeP (nil)) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList (nil)) ### NotAllEx 26 % 1.35/1.52 28. (-. ((ssList T_2) => (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((T_2 != W) \/ ((neq X (nil)) \/ (cyclefreeP V)))))))))))) (ssList (nil)) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (cyclefreeP (nil)) ### NotImply 27 % 1.35/1.52 29. (-. (All U, ((ssList U) => (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((U != W) \/ ((neq X (nil)) \/ (cyclefreeP V))))))))))))) (cyclefreeP (nil)) (All U, ((ssList U) => (All V, ((ssList V) => ((neq U V) <=> (U != V)))))) (ssList (nil)) ### NotAllEx 28 % 1.35/1.52 % SZS output end Proof % 1.35/1.52 (* END-PROOF *) %------------------------------------------------------------------------------