TSTP Solution File: MGT041+2 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : MGT041+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% Computer : n020.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 : Sun Jul 17 22:27:03 EDT 2022
% Result : Theorem 0.18s 0.40s
% Output : Proof 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT041+2 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.33 % Computer : n020.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 : Thu Jun 9 08:01:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.40 % SZS status Theorem
% 0.18/0.40 (* PROOF-FOUND *)
% 0.18/0.40 (* BEGIN-PROOF *)
% 0.18/0.40 % SZS output start Proof
% 0.18/0.40 1. (organisation_at_time T_0 T_1) (-. (organisation_at_time T_0 T_1)) ### Axiom
% 0.18/0.40 2. (organisation_at_time T_0 T_1) (-. (organisation_at_time T_0 T_1)) ### Axiom
% 0.18/0.40 3. (organisation_at_time T_0 T_1) (-. (organisation_at_time T_0 T_1)) ### Axiom
% 0.18/0.40 4. (first_mover T_0) (-. (first_mover T_0)) ### Axiom
% 0.18/0.40 5. (founding_time T_0 T_1) (-. (founding_time T_0 T_1)) ### Axiom
% 0.18/0.40 6. (-. (number_of_routines T_0 T_1 (low))) (number_of_routines T_0 T_1 (low)) ### Axiom
% 0.18/0.40 7. (((organisation_at_time T_0 T_1) /\ ((first_mover T_0) /\ (founding_time T_0 T_1))) => (number_of_routines T_0 T_1 (low))) (-. (number_of_routines T_0 T_1 (low))) (founding_time T_0 T_1) (first_mover T_0) (organisation_at_time T_0 T_1) ### DisjTree 3 4 5 6
% 0.18/0.40 8. (All T, (((organisation_at_time T_0 T) /\ ((first_mover T_0) /\ (founding_time T_0 T))) => (number_of_routines T_0 T (low)))) (organisation_at_time T_0 T_1) (first_mover T_0) (founding_time T_0 T_1) (-. (number_of_routines T_0 T_1 (low))) ### All 7
% 0.18/0.40 9. (All X, (All T, (((organisation_at_time X T) /\ ((first_mover X) /\ (founding_time X T))) => (number_of_routines X T (low))))) (-. (number_of_routines T_0 T_1 (low))) (founding_time T_0 T_1) (first_mover T_0) (organisation_at_time T_0 T_1) ### All 8
% 0.18/0.40 10. (number_of_routines T_0 T_1 (high)) (-. (number_of_routines T_0 T_1 (high))) ### Axiom
% 0.18/0.40 11. (-. ((number_of_routines T_0 T_1 (low)) /\ (number_of_routines T_0 T_1 (high)))) (number_of_routines T_0 T_1 (high)) (organisation_at_time T_0 T_1) (first_mover T_0) (founding_time T_0 T_1) (All X, (All T, (((organisation_at_time X T) /\ ((first_mover X) /\ (founding_time X T))) => (number_of_routines X T (low))))) ### NotAnd 9 10
% 0.18/0.40 12. (All T, (-. ((number_of_routines T_0 T (low)) /\ (number_of_routines T_0 T (high))))) (All X, (All T, (((organisation_at_time X T) /\ ((first_mover X) /\ (founding_time X T))) => (number_of_routines X T (low))))) (founding_time T_0 T_1) (first_mover T_0) (organisation_at_time T_0 T_1) (number_of_routines T_0 T_1 (high)) ### All 11
% 0.18/0.40 13. (All X, (All T, (-. ((number_of_routines X T (low)) /\ (number_of_routines X T (high)))))) (number_of_routines T_0 T_1 (high)) (organisation_at_time T_0 T_1) (first_mover T_0) (founding_time T_0 T_1) (All X, (All T, (((organisation_at_time X T) /\ ((first_mover X) /\ (founding_time X T))) => (number_of_routines X T (low))))) ### All 12
% 0.18/0.40 14. (-. (efficient_producer T_0)) (efficient_producer T_0) ### Axiom
% 0.18/0.40 15. (-. ((organisation_at_time T_0 T_1) /\ ((-. (first_mover T_0)) /\ (-. (efficient_producer T_0))))) (-. (efficient_producer T_0)) (All X, (All T, (((organisation_at_time X T) /\ ((first_mover X) /\ (founding_time X T))) => (number_of_routines X T (low))))) (founding_time T_0 T_1) (number_of_routines T_0 T_1 (high)) (All X, (All T, (-. ((number_of_routines X T (low)) /\ (number_of_routines X T (high)))))) (organisation_at_time T_0 T_1) ### DisjTree 2 13 14
% 0.18/0.40 16. (-. (Ex T, ((organisation_at_time T_0 T) /\ ((-. (first_mover T_0)) /\ (-. (efficient_producer T_0)))))) (organisation_at_time T_0 T_1) (All X, (All T, (-. ((number_of_routines X T (low)) /\ (number_of_routines X T (high)))))) (number_of_routines T_0 T_1 (high)) (founding_time T_0 T_1) (All X, (All T, (((organisation_at_time X T) /\ ((first_mover X) /\ (founding_time X T))) => (number_of_routines X T (low))))) (-. (efficient_producer T_0)) ### NotExists 15
% 0.18/0.40 17. (-. (Ex X, (Ex T, ((organisation_at_time X T) /\ ((-. (first_mover X)) /\ (-. (efficient_producer X))))))) (-. (efficient_producer T_0)) (All X, (All T, (((organisation_at_time X T) /\ ((first_mover X) /\ (founding_time X T))) => (number_of_routines X T (low))))) (founding_time T_0 T_1) (number_of_routines T_0 T_1 (high)) (All X, (All T, (-. ((number_of_routines X T (low)) /\ (number_of_routines X T (high)))))) (organisation_at_time T_0 T_1) ### NotExists 16
% 0.18/0.40 18. (founding_time T_0 T_1) (-. (founding_time T_0 T_1)) ### Axiom
% 0.18/0.40 19. (-. (has_elaborated_routines T_0 T_1)) (All X, (All T, (-. ((number_of_routines X T (low)) /\ (number_of_routines X T (high)))))) (number_of_routines T_0 T_1 (high)) (founding_time T_0 T_1) (All X, (All T, (((organisation_at_time X T) /\ ((first_mover X) /\ (founding_time X T))) => (number_of_routines X T (low))))) (-. (Ex X, (Ex T, ((organisation_at_time X T) /\ ((-. (first_mover X)) /\ (-. (efficient_producer X))))))) (organisation_at_time T_0 T_1) ### Extension/test/a14ctrp 1 17 18
% 0.18/0.40 20. ((organisation_at_time T_0 T_1) /\ ((founding_time T_0 T_1) /\ ((number_of_routines T_0 T_1 (high)) /\ (-. (has_elaborated_routines T_0 T_1))))) (-. (Ex X, (Ex T, ((organisation_at_time X T) /\ ((-. (first_mover X)) /\ (-. (efficient_producer X))))))) (All X, (All T, (((organisation_at_time X T) /\ ((first_mover X) /\ (founding_time X T))) => (number_of_routines X T (low))))) (All X, (All T, (-. ((number_of_routines X T (low)) /\ (number_of_routines X T (high)))))) ### ConjTree 19
% 0.18/0.40 21. (Ex T, ((organisation_at_time T_0 T) /\ ((founding_time T_0 T) /\ ((number_of_routines T_0 T (high)) /\ (-. (has_elaborated_routines T_0 T)))))) (All X, (All T, (-. ((number_of_routines X T (low)) /\ (number_of_routines X T (high)))))) (All X, (All T, (((organisation_at_time X T) /\ ((first_mover X) /\ (founding_time X T))) => (number_of_routines X T (low))))) (-. (Ex X, (Ex T, ((organisation_at_time X T) /\ ((-. (first_mover X)) /\ (-. (efficient_producer X))))))) ### Exists 20
% 0.18/0.40 22. (Ex X, (Ex T, ((organisation_at_time X T) /\ ((founding_time X T) /\ ((number_of_routines X T (high)) /\ (-. (has_elaborated_routines X T))))))) (-. (Ex X, (Ex T, ((organisation_at_time X T) /\ ((-. (first_mover X)) /\ (-. (efficient_producer X))))))) (All X, (All T, (((organisation_at_time X T) /\ ((first_mover X) /\ (founding_time X T))) => (number_of_routines X T (low))))) (All X, (All T, (-. ((number_of_routines X T (low)) /\ (number_of_routines X T (high)))))) ### Exists 21
% 0.18/0.40 % SZS output end Proof
% 0.18/0.40 (* END-PROOF *)
%------------------------------------------------------------------------------