TSTP Solution File: SET801+4 by SuperZenon---0.0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : SET801+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 : n011.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.41s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SET801+4 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12  % Command  : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.13/0.33  % Computer : n011.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul 11 03:30:12 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  (* PROOF-FOUND *)
% 0.19/0.41  (* BEGIN-PROOF *)
% 0.19/0.41  % SZS output start Proof
% 0.19/0.41  1. (member T_0 T_1) (-. (member T_0 T_1))   ### Axiom
% 0.19/0.41  2. (member T_2 T_1) (-. (member T_2 T_1))   ### Axiom
% 0.19/0.41  3. (-. (apply T_3 T_2 T_0)) (apply T_3 T_2 T_0)   ### Axiom
% 0.19/0.41  4. (upper_bound T_0 T_3 T_1) (-. (apply T_3 T_2 T_0)) (member T_2 T_1)   ### Extension/test/upper_bound_inst 2 3
% 0.19/0.41  5. (-. (greatest T_0 T_3 T_1)) (upper_bound T_0 T_3 T_1) (member T_0 T_1)   ### Extension/test/not_greatest 1 4
% 0.19/0.41  6. (least_upper_bound T_0 T_1 T_3 T_4) (member T_0 T_1) (-. (greatest T_0 T_3 T_1))   ### Extension/test/least_upper_bound 5 5 5
% 0.19/0.41  7. ((member T_0 T_1) /\ (least_upper_bound T_0 T_1 T_3 T_4)) (-. (greatest T_0 T_3 T_1))   ### And 6
% 0.19/0.41  8. (member T_0 T_1) (-. (member T_0 T_1))   ### Axiom
% 0.19/0.41  9. (member T_2 T_1) (-. (member T_2 T_1))   ### Axiom
% 0.19/0.41  10. (-. (apply T_3 T_2 T_0)) (apply T_3 T_2 T_0)   ### Axiom
% 0.19/0.41  11. (greatest T_0 T_3 T_1) (-. (apply T_3 T_2 T_0)) (member T_2 T_1)   ### Extension/test/greatest_inst 9 10
% 0.19/0.41  12. (-. (upper_bound T_0 T_3 T_1)) (greatest T_0 T_3 T_1)   ### Extension/test/not_upper_bound 11
% 0.19/0.41  13. (member T_0 T_1) (-. (member T_0 T_1))   ### Axiom
% 0.19/0.41  14. (member T_0 T_1) (-. (member T_0 T_1))   ### Axiom
% 0.19/0.41  15. (-. (apply T_3 T_0 T_5)) (apply T_3 T_0 T_5)   ### Axiom
% 0.19/0.41  16. (upper_bound T_5 T_3 T_1) (-. (apply T_3 T_0 T_5)) (member T_0 T_1)   ### Extension/test/upper_bound_inst 14 15
% 0.19/0.41  17. (-. (least_upper_bound T_0 T_1 T_3 T_4)) (member T_0 T_1) (greatest T_0 T_3 T_1)   ### Extension/test/not_least_upper_bound 12 13 16
% 0.19/0.41  18. (-. ((member T_0 T_1) /\ (least_upper_bound T_0 T_1 T_3 T_4))) (greatest T_0 T_3 T_1) (member T_0 T_1)   ### NotAnd 8 17
% 0.19/0.41  19. (greatest T_0 T_3 T_1) (-. ((member T_0 T_1) /\ (least_upper_bound T_0 T_1 T_3 T_4)))   ### Extension/test/greatest 18 18
% 0.19/0.41  20. (-. ((greatest T_0 T_3 T_1) <=> ((member T_0 T_1) /\ (least_upper_bound T_0 T_1 T_3 T_4))))   ### NotEquiv 7 19
% 0.19/0.41  21. (-. (All M, ((greatest M T_3 T_1) <=> ((member M T_1) /\ (least_upper_bound M T_1 T_3 T_4)))))   ### NotAllEx 20
% 0.19/0.41  22. (-. ((subset T_1 T_4) => (All M, ((greatest M T_3 T_1) <=> ((member M T_1) /\ (least_upper_bound M T_1 T_3 T_4))))))   ### NotImply 21
% 0.19/0.41  23. (-. (All X, ((subset X T_4) => (All M, ((greatest M T_3 X) <=> ((member M X) /\ (least_upper_bound M X T_3 T_4)))))))   ### NotAllEx 22
% 0.19/0.41  24. (-. ((order T_3 T_4) => (All X, ((subset X T_4) => (All M, ((greatest M T_3 X) <=> ((member M X) /\ (least_upper_bound M X T_3 T_4))))))))   ### NotImply 23
% 0.19/0.41  25. (-. (All E, ((order T_3 E) => (All X, ((subset X E) => (All M, ((greatest M T_3 X) <=> ((member M X) /\ (least_upper_bound M X T_3 E)))))))))   ### NotAllEx 24
% 0.19/0.41  26. (-. (All R, (All E, ((order R E) => (All X, ((subset X E) => (All M, ((greatest M R X) <=> ((member M X) /\ (least_upper_bound M X R E))))))))))   ### NotAllEx 25
% 0.19/0.41  % SZS output end Proof
% 0.19/0.41  (* END-PROOF *)
%------------------------------------------------------------------------------