%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SWW469+1 : TPTP v8.1.0. Released v5.3.0. % Transfm : none % Format : tptp:raw % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % Computer : n017.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 : Thu Jul 21 01:31:46 EDT 2022 % Result : Theorem 0.18s 0.39s % Output : Proof 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWW469+1 : TPTP v8.1.0. Released v5.3.0. % 0.03/0.13 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % 0.12/0.33 % Computer : n017.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 : Sat Jun 4 11:35:44 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.39 % SZS status Theorem % 0.18/0.39 (* PROOF-FOUND *) % 0.18/0.39 (* BEGIN-PROOF *) % 0.18/0.39 % SZS output start Proof % 0.18/0.39 1. (is_state T_0) (-. (is_state T_0)) ### Axiom % 0.18/0.39 2. (T_0 != T_0) ### Refl(=) % 0.18/0.39 3. (T_0 != T_0) ### Refl(=) % 0.18/0.39 4. (is_state T_1) (-. (is_state T_1)) ### Axiom % 0.18/0.39 5. (T_2 != T_1) (T_1 = T_2) ### Sym(=) % 0.18/0.39 6. ((is_state T_1) => (T_1 = T_2)) (T_2 != T_1) (is_state T_1) ### Imply 4 5 % 0.18/0.39 7. (All S, ((is_state S) => (S = T_2))) (is_state T_1) (T_2 != T_1) ### All 6 % 0.18/0.39 8. (T_0 != T_1) (T_0 = T_2) (is_state T_1) (All S, ((is_state S) => (S = T_2))) ### TransEq 2 3 7 % 0.18/0.39 9. ((is_state T_0) => (T_0 = T_2)) (All S, ((is_state S) => (S = T_2))) (is_state T_1) (T_0 != T_1) (is_state T_0) ### Imply 1 8 % 0.18/0.39 10. (is_state T_0) (T_0 != T_1) (is_state T_1) (All S, ((is_state S) => (S = T_2))) ### All 9 % 0.18/0.39 11. ((is_state T_0) /\ ((is_state T_1) /\ (T_0 != T_1))) (All S, ((is_state S) => (S = T_2))) ### ConjTree 10 % 0.18/0.39 12. (Ex T, ((is_state T_0) /\ ((is_state T) /\ (T_0 != T)))) (All S, ((is_state S) => (S = T_2))) ### Exists 11 % 0.18/0.39 13. (Ex S, (Ex T, ((is_state S) /\ ((is_state T) /\ (S != T))))) (All S, ((is_state S) => (S = T_2))) ### Exists 12 % 0.18/0.39 14. (hoare_165779456gleton) (All S, ((is_state S) => (S = T_2))) ### Definition-Pseudo(hoare_165779456gleton) 13 % 0.18/0.39 15. (-. (-. (All S, ((is_state S) => (S = T_2))))) (hoare_165779456gleton) ### NotNot 14 % 0.18/0.39 16. (-. ((is_state T_2) => (-. (All S, ((is_state S) => (S = T_2)))))) (hoare_165779456gleton) ### NotImply 15 % 0.18/0.39 17. (-. (All T, ((is_state T) => (-. (All S, ((is_state S) => (S = T))))))) (hoare_165779456gleton) ### NotAllEx 16 % 0.18/0.39 % SZS output end Proof % 0.18/0.39 (* END-PROOF *) %------------------------------------------------------------------------------