TSTP Solution File: SEU239+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SEU239+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% Computer : n016.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 14:49:33 EDT 2022
% Result : Theorem 17.13s 17.32s
% Output : Proof 17.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU239+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.33 % Computer : n016.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 : Mon Jun 20 00:10:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 17.13/17.32 % SZS status Theorem
% 17.13/17.32 (* PROOF-FOUND *)
% 17.13/17.32 (* BEGIN-PROOF *)
% 17.13/17.32 % SZS output start Proof
% 17.13/17.32 1. (relation T_0) (-. (relation T_0)) ### Axiom
% 17.13/17.32 2. (relation T_0) (-. (relation T_0)) ### Axiom
% 17.13/17.32 3. (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0))) (-. (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0)))) ### Axiom
% 17.13/17.32 4. (-. (is_reflexive_in T_0 (relation_field T_0))) (is_reflexive_in T_0 (relation_field T_0)) ### Axiom
% 17.13/17.32 5. ((is_reflexive_in T_0 (relation_field T_0)) <=> (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0)))) (-. (is_reflexive_in T_0 (relation_field T_0))) (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0))) ### Equiv 3 4
% 17.13/17.32 6. (All B, ((is_reflexive_in T_0 B) <=> (All C, ((in C B) => (in (ordered_pair C C) T_0))))) (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0))) (-. (is_reflexive_in T_0 (relation_field T_0))) ### All 5
% 17.13/17.32 7. ((relation T_0) => (All B, ((is_reflexive_in T_0 B) <=> (All C, ((in C B) => (in (ordered_pair C C) T_0)))))) (-. (is_reflexive_in T_0 (relation_field T_0))) (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0))) (relation T_0) ### Imply 2 6
% 17.13/17.32 8. (All A, ((relation A) => (All B, ((is_reflexive_in A B) <=> (All C, ((in C B) => (in (ordered_pair C C) A))))))) (relation T_0) (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0))) (-. (is_reflexive_in T_0 (relation_field T_0))) ### All 7
% 17.13/17.32 9. (-. (reflexive T_0)) (reflexive T_0) ### Axiom
% 17.13/17.32 10. ((reflexive T_0) <=> (is_reflexive_in T_0 (relation_field T_0))) (-. (reflexive T_0)) (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0))) (relation T_0) (All A, ((relation A) => (All B, ((is_reflexive_in A B) <=> (All C, ((in C B) => (in (ordered_pair C C) A))))))) ### Equiv 8 9
% 17.13/17.32 11. ((relation T_0) => ((reflexive T_0) <=> (is_reflexive_in T_0 (relation_field T_0)))) (All A, ((relation A) => (All B, ((is_reflexive_in A B) <=> (All C, ((in C B) => (in (ordered_pair C C) A))))))) (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0))) (-. (reflexive T_0)) (relation T_0) ### Imply 1 10
% 17.13/17.32 12. (All A, ((relation A) => ((reflexive A) <=> (is_reflexive_in A (relation_field A))))) (relation T_0) (-. (reflexive T_0)) (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0))) (All A, ((relation A) => (All B, ((is_reflexive_in A B) <=> (All C, ((in C B) => (in (ordered_pair C C) A))))))) ### All 11
% 17.13/17.32 13. (relation T_0) (-. (relation T_0)) ### Axiom
% 17.13/17.32 14. (relation T_0) (-. (relation T_0)) ### Axiom
% 17.13/17.32 15. (reflexive T_0) (-. (reflexive T_0)) ### Axiom
% 17.13/17.32 16. (-. (is_reflexive_in T_0 (relation_field T_0))) (is_reflexive_in T_0 (relation_field T_0)) ### Axiom
% 17.13/17.32 17. ((reflexive T_0) <=> (is_reflexive_in T_0 (relation_field T_0))) (-. (is_reflexive_in T_0 (relation_field T_0))) (reflexive T_0) ### Equiv 15 16
% 17.13/17.32 18. ((relation T_0) => ((reflexive T_0) <=> (is_reflexive_in T_0 (relation_field T_0)))) (reflexive T_0) (-. (is_reflexive_in T_0 (relation_field T_0))) (relation T_0) ### Imply 14 17
% 17.13/17.32 19. (All A, ((relation A) => ((reflexive A) <=> (is_reflexive_in A (relation_field A))))) (relation T_0) (-. (is_reflexive_in T_0 (relation_field T_0))) (reflexive T_0) ### All 18
% 17.13/17.32 20. (-. (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0)))) (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0))) ### Axiom
% 17.13/17.32 21. ((is_reflexive_in T_0 (relation_field T_0)) <=> (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0)))) (-. (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0)))) (reflexive T_0) (relation T_0) (All A, ((relation A) => ((reflexive A) <=> (is_reflexive_in A (relation_field A))))) ### Equiv 19 20
% 17.13/17.32 22. (All B, ((is_reflexive_in T_0 B) <=> (All C, ((in C B) => (in (ordered_pair C C) T_0))))) (All A, ((relation A) => ((reflexive A) <=> (is_reflexive_in A (relation_field A))))) (relation T_0) (reflexive T_0) (-. (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0)))) ### All 21
% 17.13/17.32 23. ((relation T_0) => (All B, ((is_reflexive_in T_0 B) <=> (All C, ((in C B) => (in (ordered_pair C C) T_0)))))) (-. (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0)))) (reflexive T_0) (All A, ((relation A) => ((reflexive A) <=> (is_reflexive_in A (relation_field A))))) (relation T_0) ### Imply 13 22
% 17.13/17.32 24. (All A, ((relation A) => (All B, ((is_reflexive_in A B) <=> (All C, ((in C B) => (in (ordered_pair C C) A))))))) (relation T_0) (All A, ((relation A) => ((reflexive A) <=> (is_reflexive_in A (relation_field A))))) (reflexive T_0) (-. (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0)))) ### All 23
% 17.13/17.32 25. (-. ((reflexive T_0) <=> (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0))))) (All A, ((relation A) => (All B, ((is_reflexive_in A B) <=> (All C, ((in C B) => (in (ordered_pair C C) A))))))) (relation T_0) (All A, ((relation A) => ((reflexive A) <=> (is_reflexive_in A (relation_field A))))) ### NotEquiv 12 24
% 17.13/17.32 26. (-. ((relation T_0) => ((reflexive T_0) <=> (All B, ((in B (relation_field T_0)) => (in (ordered_pair B B) T_0)))))) (All A, ((relation A) => ((reflexive A) <=> (is_reflexive_in A (relation_field A))))) (All A, ((relation A) => (All B, ((is_reflexive_in A B) <=> (All C, ((in C B) => (in (ordered_pair C C) A))))))) ### NotImply 25
% 17.13/17.32 27. (-. (All A, ((relation A) => ((reflexive A) <=> (All B, ((in B (relation_field A)) => (in (ordered_pair B B) A))))))) (All A, ((relation A) => (All B, ((is_reflexive_in A B) <=> (All C, ((in C B) => (in (ordered_pair C C) A))))))) (All A, ((relation A) => ((reflexive A) <=> (is_reflexive_in A (relation_field A))))) ### NotAllEx 26
% 17.13/17.32 % SZS output end Proof
% 17.13/17.32 (* END-PROOF *)
%------------------------------------------------------------------------------