%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SET802+4 : 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 : n005.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 05:44:04 EDT 2022 % Result : Theorem 0.19s 0.42s % Output : Proof 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SET802+4 : TPTP v8.1.0. Released v3.2.0. % 0.11/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % 0.13/0.34 % Computer : n005.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 : Mon Jul 11 09:07:52 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.42 % SZS status Theorem % 0.19/0.42 (* PROOF-FOUND *) % 0.19/0.42 (* BEGIN-PROOF *) % 0.19/0.42 % SZS output start Proof % 0.19/0.42 1. (member T_0 T_1) (-. (member T_0 T_1)) ### Axiom % 0.19/0.42 2. (member T_2 T_1) (-. (member T_2 T_1)) ### Axiom % 0.19/0.42 3. (-. (apply T_3 T_0 T_2)) (apply T_3 T_0 T_2) ### Axiom % 0.19/0.42 4. (lower_bound T_0 T_3 T_1) (-. (apply T_3 T_0 T_2)) (member T_2 T_1) ### Extension/test/lower_bound_inst 2 3 % 0.19/0.42 5. (-. (least T_0 T_3 T_1)) (lower_bound T_0 T_3 T_1) (member T_0 T_1) ### Extension/test/not_least 1 4 % 0.19/0.42 6. (greatest_lower_bound T_0 T_1 T_3 T_4) (member T_0 T_1) (-. (least T_0 T_3 T_1)) ### Extension/test/greatest_lower_bound 5 5 5 % 0.19/0.42 7. ((member T_0 T_1) /\ (greatest_lower_bound T_0 T_1 T_3 T_4)) (-. (least T_0 T_3 T_1)) ### And 6 % 0.19/0.42 8. (member T_0 T_1) (-. (member T_0 T_1)) ### Axiom % 0.19/0.42 9. (member T_2 T_1) (-. (member T_2 T_1)) ### Axiom % 0.19/0.42 10. (-. (apply T_3 T_0 T_2)) (apply T_3 T_0 T_2) ### Axiom % 0.19/0.42 11. (least T_0 T_3 T_1) (-. (apply T_3 T_0 T_2)) (member T_2 T_1) ### Extension/test/least_inst 9 10 % 0.19/0.42 12. (-. (lower_bound T_0 T_3 T_1)) (least T_0 T_3 T_1) ### Extension/test/not_lower_bound 11 % 0.19/0.42 13. (member T_0 T_1) (-. (member T_0 T_1)) ### Axiom % 0.19/0.42 14. (member T_0 T_1) (-. (member T_0 T_1)) ### Axiom % 0.19/0.42 15. (-. (apply T_3 T_5 T_0)) (apply T_3 T_5 T_0) ### Axiom % 0.19/0.42 16. (lower_bound T_5 T_3 T_1) (-. (apply T_3 T_5 T_0)) (member T_0 T_1) ### Extension/test/lower_bound_inst 14 15 % 0.19/0.42 17. (-. (greatest_lower_bound T_0 T_1 T_3 T_4)) (member T_0 T_1) (least T_0 T_3 T_1) ### Extension/test/not_greatest_lower_bound 12 13 16 % 0.19/0.42 18. (-. ((member T_0 T_1) /\ (greatest_lower_bound T_0 T_1 T_3 T_4))) (least T_0 T_3 T_1) (member T_0 T_1) ### NotAnd 8 17 % 0.19/0.42 19. (least T_0 T_3 T_1) (-. ((member T_0 T_1) /\ (greatest_lower_bound T_0 T_1 T_3 T_4))) ### Extension/test/least 18 18 % 0.19/0.42 20. (-. ((least T_0 T_3 T_1) <=> ((member T_0 T_1) /\ (greatest_lower_bound T_0 T_1 T_3 T_4)))) ### NotEquiv 7 19 % 0.19/0.42 21. (-. (All M, ((least M T_3 T_1) <=> ((member M T_1) /\ (greatest_lower_bound M T_1 T_3 T_4))))) ### NotAllEx 20 % 0.19/0.42 22. (-. ((subset T_1 T_4) => (All M, ((least M T_3 T_1) <=> ((member M T_1) /\ (greatest_lower_bound M T_1 T_3 T_4)))))) ### NotImply 21 % 0.19/0.42 23. (-. (All X, ((subset X T_4) => (All M, ((least M T_3 X) <=> ((member M X) /\ (greatest_lower_bound M X T_3 T_4))))))) ### NotAllEx 22 % 0.19/0.42 24. (-. ((order T_3 T_4) => (All X, ((subset X T_4) => (All M, ((least M T_3 X) <=> ((member M X) /\ (greatest_lower_bound M X T_3 T_4)))))))) ### NotImply 23 % 0.19/0.42 25. (-. (All E, ((order T_3 E) => (All X, ((subset X E) => (All M, ((least M T_3 X) <=> ((member M X) /\ (greatest_lower_bound M X T_3 E))))))))) ### NotAllEx 24 % 0.19/0.42 26. (-. (All R, (All E, ((order R E) => (All X, ((subset X E) => (All M, ((least M R X) <=> ((member M X) /\ (greatest_lower_bound M X R E)))))))))) ### NotAllEx 25 % 0.19/0.42 % SZS output end Proof % 0.19/0.42 (* END-PROOF *) %------------------------------------------------------------------------------