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