TSTP Solution File: SWC365+1 by SuperZenon---0.0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SuperZenon---0.0.1
% Problem : SWC365+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 : n016.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:07:54 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC365+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.13/0.34 % Computer : n016.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 : Sun Jun 12 19:38:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.53 % SZS status Theorem
% 0.20/0.53 (* PROOF-FOUND *)
% 0.20/0.53 (* BEGIN-PROOF *)
% 0.20/0.53 % SZS output start Proof
% 0.20/0.53 1. (T_0 = T_1) (T_0 != T_1) ### Axiom
% 0.20/0.53 2. ((nil) != (nil)) ### NotEqual
% 0.20/0.53 3. (-. (neq T_1 (nil))) (neq T_0 (nil)) (T_0 = T_1) ### P-NotP 1 2
% 0.20/0.53 4. (T_0 = T_1) (T_1 != T_0) ### Sym(=)
% 0.20/0.53 5. (T_2 = T_3) (T_3 != T_2) ### Sym(=)
% 0.20/0.53 6. (-. (rearsegP T_0 T_2)) (rearsegP T_1 T_3) (T_2 = T_3) (T_0 = T_1) ### P-NotP 4 5
% 0.20/0.53 7. (-. (-. (rearsegP T_1 T_3))) (T_0 = T_1) (T_2 = T_3) (-. (rearsegP T_0 T_2)) ### NotNot 6
% 0.20/0.53 8. (-. ((-. (neq T_3 (nil))) \/ (-. (rearsegP T_1 T_3)))) (-. (rearsegP T_0 T_2)) (T_2 = T_3) (T_0 = T_1) ### NotOr 7
% 0.20/0.53 9. (-. ((neq T_1 (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (rearsegP T_1 T_3))))) (T_2 = T_3) (-. (rearsegP T_0 T_2)) (T_0 = T_1) (neq T_0 (nil)) ### NotAnd 3 8
% 0.20/0.53 10. (-. ((ssList T_1) => ((T_0 != T_1) \/ ((T_2 != T_3) \/ ((-. (neq T_0 (nil))) \/ ((rearsegP T_0 T_2) \/ ((((nil) != T_3) /\ ((nil) = T_1)) \/ ((neq T_1 (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (rearsegP T_1 T_3))))))))))) ### ConjTree 9
% 0.20/0.53 11. (-. (All X, ((ssList X) => ((T_0 != X) \/ ((T_2 != T_3) \/ ((-. (neq T_0 (nil))) \/ ((rearsegP T_0 T_2) \/ ((((nil) != T_3) /\ ((nil) = X)) \/ ((neq X (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (rearsegP X T_3)))))))))))) ### NotAllEx 10
% 0.20/0.53 12. (-. ((ssList T_3) => (All X, ((ssList X) => ((T_0 != X) \/ ((T_2 != T_3) \/ ((-. (neq T_0 (nil))) \/ ((rearsegP T_0 T_2) \/ ((((nil) != T_3) /\ ((nil) = X)) \/ ((neq X (nil)) /\ ((-. (neq T_3 (nil))) \/ (-. (rearsegP X T_3))))))))))))) ### NotImply 11
% 0.20/0.53 13. (-. (All W, ((ssList W) => (All X, ((ssList X) => ((T_0 != X) \/ ((T_2 != W) \/ ((-. (neq T_0 (nil))) \/ ((rearsegP T_0 T_2) \/ ((((nil) != W) /\ ((nil) = X)) \/ ((neq X (nil)) /\ ((-. (neq W (nil))) \/ (-. (rearsegP X W)))))))))))))) ### NotAllEx 12
% 0.20/0.53 14. (-. ((ssList T_0) => (All W, ((ssList W) => (All X, ((ssList X) => ((T_0 != X) \/ ((T_2 != W) \/ ((-. (neq T_0 (nil))) \/ ((rearsegP T_0 T_2) \/ ((((nil) != W) /\ ((nil) = X)) \/ ((neq X (nil)) /\ ((-. (neq W (nil))) \/ (-. (rearsegP X W))))))))))))))) ### NotImply 13
% 0.20/0.53 15. (-. (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((T_2 != W) \/ ((-. (neq V (nil))) \/ ((rearsegP V T_2) \/ ((((nil) != W) /\ ((nil) = X)) \/ ((neq X (nil)) /\ ((-. (neq W (nil))) \/ (-. (rearsegP X W)))))))))))))))) ### NotAllEx 14
% 0.20/0.53 16. (-. ((ssList T_2) => (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((T_2 != W) \/ ((-. (neq V (nil))) \/ ((rearsegP V T_2) \/ ((((nil) != W) /\ ((nil) = X)) \/ ((neq X (nil)) /\ ((-. (neq W (nil))) \/ (-. (rearsegP X W))))))))))))))))) ### NotImply 15
% 0.20/0.53 17. (-. (All U, ((ssList U) => (All V, ((ssList V) => (All W, ((ssList W) => (All X, ((ssList X) => ((V != X) \/ ((U != W) \/ ((-. (neq V (nil))) \/ ((rearsegP V U) \/ ((((nil) != W) /\ ((nil) = X)) \/ ((neq X (nil)) /\ ((-. (neq W (nil))) \/ (-. (rearsegP X W)))))))))))))))))) ### NotAllEx 16
% 0.20/0.53 % SZS output end Proof
% 0.20/0.53 (* END-PROOF *)
%------------------------------------------------------------------------------