TSTP Solution File: NUM393+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% Computer : n004.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 : Mon Jul 18 14:42:08 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.13 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.13/0.34 % Computer : n004.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 : Wed Jul 6 00:20:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 (* PROOF-FOUND *)
% 0.20/0.44 (* BEGIN-PROOF *)
% 0.20/0.44 % SZS output start Proof
% 0.20/0.44 1. (ordinal T_0) (-. (ordinal T_0)) ### Axiom
% 0.20/0.44 2. (ordinal T_1) (-. (ordinal T_1)) ### Axiom
% 0.20/0.44 3. (ordinal T_1) (-. (ordinal T_1)) ### Axiom
% 0.20/0.44 4. (ordinal T_0) (-. (ordinal T_0)) ### Axiom
% 0.20/0.44 5. (ordinal T_1) (-. (ordinal T_1)) ### Axiom
% 0.20/0.44 6. (ordinal T_0) (-. (ordinal T_0)) ### Axiom
% 0.20/0.44 7. (-. (ordinal_subset T_1 T_0)) (ordinal_subset T_1 T_0) ### Axiom
% 0.20/0.44 8. (-. (ordinal_subset T_0 T_1)) (ordinal_subset T_0 T_1) ### Axiom
% 0.20/0.44 9. (((ordinal T_1) /\ (ordinal T_0)) => ((ordinal_subset T_1 T_0) \/ (ordinal_subset T_0 T_1))) (-. (ordinal_subset T_0 T_1)) (-. (ordinal_subset T_1 T_0)) (ordinal T_0) (ordinal T_1) ### DisjTree 5 6 7 8
% 0.20/0.44 10. (All B, (((ordinal T_1) /\ (ordinal B)) => ((ordinal_subset T_1 B) \/ (ordinal_subset B T_1)))) (ordinal T_1) (ordinal T_0) (-. (ordinal_subset T_1 T_0)) (-. (ordinal_subset T_0 T_1)) ### All 9
% 0.20/0.44 11. (-. (subset T_1 T_0)) (subset T_1 T_0) ### Axiom
% 0.20/0.44 12. ((ordinal_subset T_1 T_0) <=> (subset T_1 T_0)) (-. (subset T_1 T_0)) (-. (ordinal_subset T_0 T_1)) (ordinal T_0) (ordinal T_1) (All B, (((ordinal T_1) /\ (ordinal B)) => ((ordinal_subset T_1 B) \/ (ordinal_subset B T_1)))) ### Equiv 10 11
% 0.20/0.44 13. (((ordinal T_1) /\ (ordinal T_0)) => ((ordinal_subset T_1 T_0) <=> (subset T_1 T_0))) (All B, (((ordinal T_1) /\ (ordinal B)) => ((ordinal_subset T_1 B) \/ (ordinal_subset B T_1)))) (-. (ordinal_subset T_0 T_1)) (-. (subset T_1 T_0)) (ordinal T_0) (ordinal T_1) ### DisjTree 3 4 12
% 0.20/0.44 14. (All B, (((ordinal T_1) /\ (ordinal B)) => ((ordinal_subset T_1 B) <=> (subset T_1 B)))) (ordinal T_1) (ordinal T_0) (-. (subset T_1 T_0)) (-. (ordinal_subset T_0 T_1)) (All B, (((ordinal T_1) /\ (ordinal B)) => ((ordinal_subset T_1 B) \/ (ordinal_subset B T_1)))) ### All 13
% 0.20/0.44 15. (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) <=> (subset A B))))) (All B, (((ordinal T_1) /\ (ordinal B)) => ((ordinal_subset T_1 B) \/ (ordinal_subset B T_1)))) (-. (ordinal_subset T_0 T_1)) (-. (subset T_1 T_0)) (ordinal T_0) (ordinal T_1) ### All 14
% 0.20/0.44 16. (-. (subset T_0 T_1)) (subset T_0 T_1) ### Axiom
% 0.20/0.44 17. ((ordinal_subset T_0 T_1) <=> (subset T_0 T_1)) (-. (subset T_0 T_1)) (ordinal T_1) (ordinal T_0) (-. (subset T_1 T_0)) (All B, (((ordinal T_1) /\ (ordinal B)) => ((ordinal_subset T_1 B) \/ (ordinal_subset B T_1)))) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) <=> (subset A B))))) ### Equiv 15 16
% 0.20/0.44 18. (((ordinal T_0) /\ (ordinal T_1)) => ((ordinal_subset T_0 T_1) <=> (subset T_0 T_1))) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) <=> (subset A B))))) (All B, (((ordinal T_1) /\ (ordinal B)) => ((ordinal_subset T_1 B) \/ (ordinal_subset B T_1)))) (-. (subset T_1 T_0)) (-. (subset T_0 T_1)) (ordinal T_1) (ordinal T_0) ### DisjTree 1 2 17
% 0.20/0.44 19. (All B, (((ordinal T_0) /\ (ordinal B)) => ((ordinal_subset T_0 B) <=> (subset T_0 B)))) (ordinal T_0) (ordinal T_1) (-. (subset T_0 T_1)) (-. (subset T_1 T_0)) (All B, (((ordinal T_1) /\ (ordinal B)) => ((ordinal_subset T_1 B) \/ (ordinal_subset B T_1)))) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) <=> (subset A B))))) ### All 18
% 0.20/0.44 20. (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) <=> (subset A B))))) (All B, (((ordinal T_1) /\ (ordinal B)) => ((ordinal_subset T_1 B) \/ (ordinal_subset B T_1)))) (-. (subset T_1 T_0)) (-. (subset T_0 T_1)) (ordinal T_1) (ordinal T_0) ### All 19
% 0.20/0.44 21. (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) \/ (ordinal_subset B A))))) (ordinal T_0) (ordinal T_1) (-. (subset T_0 T_1)) (-. (subset T_1 T_0)) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) <=> (subset A B))))) ### All 20
% 0.20/0.44 22. (-. ((subset T_1 T_0) \/ (subset T_0 T_1))) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) <=> (subset A B))))) (ordinal T_1) (ordinal T_0) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) \/ (ordinal_subset B A))))) ### NotOr 21
% 0.20/0.44 23. (-. (inclusion_comparable T_1 T_0)) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) \/ (ordinal_subset B A))))) (ordinal T_0) (ordinal T_1) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) <=> (subset A B))))) ### Definition-Pseudo(inclusion_comparable) 22
% 0.20/0.44 24. (-. ((ordinal T_0) => (inclusion_comparable T_1 T_0))) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) <=> (subset A B))))) (ordinal T_1) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) \/ (ordinal_subset B A))))) ### NotImply 23
% 0.20/0.44 25. (-. (All B, ((ordinal B) => (inclusion_comparable T_1 B)))) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) \/ (ordinal_subset B A))))) (ordinal T_1) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) <=> (subset A B))))) ### NotAllEx 24
% 0.20/0.44 26. (-. ((ordinal T_1) => (All B, ((ordinal B) => (inclusion_comparable T_1 B))))) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) <=> (subset A B))))) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) \/ (ordinal_subset B A))))) ### NotImply 25
% 0.20/0.44 27. (-. (All A, ((ordinal A) => (All B, ((ordinal B) => (inclusion_comparable A B)))))) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) \/ (ordinal_subset B A))))) (All A, (All B, (((ordinal A) /\ (ordinal B)) => ((ordinal_subset A B) <=> (subset A B))))) ### NotAllEx 26
% 0.20/0.44 % SZS output end Proof
% 0.20/0.44 (* END-PROOF *)
%------------------------------------------------------------------------------