TSTP Solution File: SWC097+1 by SuperZenon---0.0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : SWC097+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_super_zenon -p0 -itptp -om -max-time %d %s

% Computer : n006.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 22:06:33 EDT 2022

% Result   : Theorem 1.36s 1.54s
% Output   : Proof 1.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWC097+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12  % Command  : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.11/0.33  % Computer : n006.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun Jun 12 23:48:27 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 1.36/1.54  % SZS status Theorem
% 1.36/1.54  (* PROOF-FOUND *)
% 1.36/1.54  (* BEGIN-PROOF *)
% 1.36/1.54  % SZS output start Proof
% 1.36/1.54  1. (ssItem T_0) (-. (ssItem T_0))   ### Axiom
% 1.36/1.54  2. (T_1 = T_2) (T_1 != T_2)   ### Axiom
% 1.36/1.54  3. ((cons T_0 (nil)) != (cons T_0 (nil)))   ### Refl(=)
% 1.36/1.54  4. ((app T_1 (cons T_0 (nil))) != (app T_2 (cons T_0 (nil)))) (T_1 = T_2)   ### NotEqual 2 3
% 1.36/1.54  5. (T_3 = T_4) (T_4 != T_3)   ### Sym(=)
% 1.36/1.54  6. ((app T_1 (cons T_0 (nil))) != T_3) ((app T_2 (cons T_0 (nil))) = T_4) (T_3 = T_4) (T_1 = T_2)   ### Trans 4 5
% 1.36/1.54  7. (-. ((ssItem T_0) /\ ((app T_1 (cons T_0 (nil))) = T_3))) (T_1 = T_2) (T_3 = T_4) ((app T_2 (cons T_0 (nil))) = T_4) (ssItem T_0)   ### NotAnd 1 6
% 1.36/1.54  8. (-. (Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = T_3)))) (ssItem T_0) ((app T_2 (cons T_0 (nil))) = T_4) (T_3 = T_4) (T_1 = T_2)   ### NotExists 7
% 1.36/1.54  9. (-. ((app T_2 (cons T_0 (nil))) != T_4)) (T_1 = T_2) (T_3 = T_4) (ssItem T_0) (-. (Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = T_3))))   ### NotNot 8
% 1.36/1.54  10. (-. ((ssItem T_0) => ((app T_2 (cons T_0 (nil))) != T_4))) (-. (Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = T_3)))) (T_3 = T_4) (T_1 = T_2)   ### NotImply 9
% 1.36/1.54  11. (-. (All Z, ((ssItem Z) => ((app T_2 (cons Z (nil))) != T_4)))) (T_1 = T_2) (T_3 = T_4) (-. (Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = T_3))))   ### NotAllEx 10
% 1.36/1.54  12. (-. ((-. (neq T_3 (nil))) \/ ((Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = T_3))) \/ (All Z, ((ssItem Z) => ((app T_2 (cons Z (nil))) != T_4)))))) (T_3 = T_4) (T_1 = T_2)   ### ConjTree 11
% 1.36/1.54  13. (T_3 = T_4) (T_3 != T_4)   ### Axiom
% 1.36/1.54  14. ((nil) != (nil))   ### NotEqual
% 1.36/1.54  15. (-. (neq T_4 (nil))) (neq T_3 (nil)) (T_3 = T_4)   ### P-NotP 13 14
% 1.36/1.54  16. (-. (-. (neq T_3 (nil)))) (T_3 = T_4) (-. (neq T_4 (nil)))   ### NotNot 15
% 1.36/1.54  17. (-. ((-. (neq T_3 (nil))) \/ (neq T_4 (nil)))) (T_3 = T_4)   ### NotOr 16
% 1.36/1.54  18. (-. (((-. (neq T_3 (nil))) \/ ((Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = T_3))) \/ (All Z, ((ssItem Z) => ((app T_2 (cons Z (nil))) != T_4))))) /\ ((-. (neq T_3 (nil))) \/ (neq T_4 (nil))))) (T_1 = T_2) (T_3 = T_4)   ### NotAnd 12 17
% 1.36/1.54  19. (-. ((ssList T_4) => ((T_3 != T_4) \/ ((T_1 != T_2) \/ (((-. (neq T_3 (nil))) \/ ((Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = T_3))) \/ (All Z, ((ssItem Z) => ((app T_2 (cons Z (nil))) != T_4))))) /\ ((-. (neq T_3 (nil))) \/ (neq T_4 (nil))))))))   ### ConjTree 18
% 1.36/1.54  20. (-. (All X, ((ssList X) => ((T_3 != X) \/ ((T_1 != T_2) \/ (((-. (neq T_3 (nil))) \/ ((Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = T_3))) \/ (All Z, ((ssItem Z) => ((app T_2 (cons Z (nil))) != X))))) /\ ((-. (neq T_3 (nil))) \/ (neq X (nil)))))))))   ### NotAllEx 19
% 1.36/1.54  21. (-. ((ssList T_2) => (All X, ((ssList X) => ((T_3 != X) \/ ((T_1 != T_2) \/ (((-. (neq T_3 (nil))) \/ ((Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = T_3))) \/ (All Z, ((ssItem Z) => ((app T_2 (cons Z (nil))) != X))))) /\ ((-. (neq T_3 (nil))) \/ (neq X (nil))))))))))   ### NotImply 20
% 1.36/1.54  22. (-. (All W, ((ssList W) => (All X, ((ssList X) => ((T_3 != X) \/ ((T_1 != W) \/ (((-. (neq T_3 (nil))) \/ ((Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = T_3))) \/ (All Z, ((ssItem Z) => ((app W (cons Z (nil))) != X))))) /\ ((-. (neq T_3 (nil))) \/ (neq X (nil)))))))))))   ### NotAllEx 21
% 1.36/1.54  23. (-. ((ssList T_3) => (All W, ((ssList W) => (All X, ((ssList X) => ((T_3 != X) \/ ((T_1 != W) \/ (((-. (neq T_3 (nil))) \/ ((Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = T_3))) \/ (All Z, ((ssItem Z) => ((app W (cons Z (nil))) != X))))) /\ ((-. (neq T_3 (nil))) \/ (neq X (nil))))))))))))   ### NotImply 22
% 1.36/1.54  24. (-. (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((T_1 != W) \/ (((-. (neq V (nil))) \/ ((Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = V))) \/ (All Z, ((ssItem Z) => ((app W (cons Z (nil))) != X))))) /\ ((-. (neq V (nil))) \/ (neq X (nil)))))))))))))   ### NotAllEx 23
% 1.36/1.54  25. (-. ((ssList T_1) => (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((T_1 != W) \/ (((-. (neq V (nil))) \/ ((Ex Y, ((ssItem Y) /\ ((app T_1 (cons Y (nil))) = V))) \/ (All Z, ((ssItem Z) => ((app W (cons Z (nil))) != X))))) /\ ((-. (neq V (nil))) \/ (neq X (nil))))))))))))))   ### NotImply 24
% 1.36/1.54  26. (-. (All U, ((ssList U) => (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((U != W) \/ (((-. (neq V (nil))) \/ ((Ex Y, ((ssItem Y) /\ ((app U (cons Y (nil))) = V))) \/ (All Z, ((ssItem Z) => ((app W (cons Z (nil))) != X))))) /\ ((-. (neq V (nil))) \/ (neq X (nil)))))))))))))))   ### NotAllEx 25
% 1.36/1.54  % SZS output end Proof
% 1.36/1.54  (* END-PROOF *)
%------------------------------------------------------------------------------