%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SWC365+1 : TPTP v9.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Sat Jun 21 05:31:01 AM UTC 2025
% Result : Theorem 0.21s 0.43s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC365+1 : TPTP v9.0.0. Released v2.4.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 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 : 300
% 0.13/0.34 % DateTime : Fri Jun 20 09:08:47 EDT 2025
% 0.13/0.34 % CPUTime :
% 0.21/0.43 % SZS status Theorem
% 0.21/0.43 % SZS output start Proof
% 0.21/0.43 tff(neq_type, type, (
% 0.21/0.43 neq: ( $i * $i ) > $o)).
% 0.21/0.43 tff(nil_type, type, (
% 0.21/0.43 nil: $i)).
% 0.21/0.43 tff(tptp_fun_V_46_type, type, (
% 0.21/0.43 tptp_fun_V_46: $i)).
% 0.21/0.43 tff(ssList_type, type, (
% 0.21/0.43 ssList: $i > $o)).
% 0.21/0.43 tff(tptp_fun_U_45_type, type, (
% 0.21/0.43 tptp_fun_U_45: $i)).
% 0.21/0.43 tff(rearsegP_type, type, (
% 0.21/0.43 rearsegP: ( $i * $i ) > $o)).
% 0.21/0.43 tff(1,plain,
% 0.21/0.43 ((ssList(U!45) & (~(rearsegP(V!46, U!45) | (neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))) | ((~(nil = U!45)) & (nil = V!46)) | (~ssList(V!46)) | (~ssList(U!45)) | (~neq(V!46, nil))))) <=> (ssList(U!45) & (~((~ssList(U!45)) | rearsegP(V!46, U!45) | (neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))) | ((~(nil = U!45)) & (nil = V!46)) | (~ssList(V!46)) | (~neq(V!46, nil)))))),
% 0.21/0.43 inference(rewrite,[status(thm)],[])).
% 0.21/0.43 tff(2,plain,
% 0.21/0.43 ((~![U: $i] : ((~ssList(U)) | ![V: $i] : (rearsegP(V, U) | (neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : (rearsegP(V, U) | (neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil)))))),
% 0.21/0.43 inference(rewrite,[status(thm)],[])).
% 0.21/0.43 tff(3,plain,
% 0.21/0.43 ((~![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (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)))))))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : (rearsegP(V, U) | (neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil)))))),
% 0.21/0.43 inference(rewrite,[status(thm)],[])).
% 0.21/0.43 tff(4,axiom,(~![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (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)))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','co1')).
% 0.21/0.43 tff(5,plain,
% 0.21/0.43 (~![U: $i] : ((~ssList(U)) | ![V: $i] : (rearsegP(V, U) | (neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil))))),
% 0.21/0.43 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.21/0.43 tff(6,plain,
% 0.21/0.43 (~![U: $i] : ((~ssList(U)) | ![V: $i] : (rearsegP(V, U) | (neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil))))),
% 0.21/0.43 inference(modus_ponens,[status(thm)],[5, 2])).
% 0.21/0.43 tff(7,plain,
% 0.21/0.43 (~![U: $i] : ((~ssList(U)) | ![V: $i] : (rearsegP(V, U) | (neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil))))),
% 0.21/0.43 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.21/0.43 tff(8,plain,
% 0.21/0.43 (~![U: $i] : ((~ssList(U)) | ![V: $i] : (rearsegP(V, U) | (neq(V, nil) & ((~neq(U, nil)) | (~rearsegP(V, U)))) | ((~(nil = U)) & (nil = V)) | (~ssList(V)) | (~ssList(U)) | (~neq(V, nil))))),
% 0.21/0.43 inference(modus_ponens,[status(thm)],[7, 2])).
% 0.21/0.43 tff(9,plain,
% 0.21/0.43 (ssList(U!45) & (~((~ssList(U!45)) | rearsegP(V!46, U!45) | (neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))) | ((~(nil = U!45)) & (nil = V!46)) | (~ssList(V!46)) | (~neq(V!46, nil))))),
% 0.21/0.43 inference(modus_ponens,[status(thm)],[8, 1])).
% 0.21/0.43 tff(10,plain,
% 0.21/0.43 (~((~ssList(U!45)) | rearsegP(V!46, U!45) | (neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))) | ((~(nil = U!45)) & (nil = V!46)) | (~ssList(V!46)) | (~neq(V!46, nil)))),
% 0.21/0.43 inference(and_elim,[status(thm)],[9])).
% 0.21/0.43 tff(11,plain,
% 0.21/0.43 (neq(V!46, nil)),
% 0.21/0.43 inference(or_elim,[status(thm)],[10])).
% 0.21/0.43 tff(12,plain,
% 0.21/0.43 (~rearsegP(V!46, U!45)),
% 0.21/0.43 inference(or_elim,[status(thm)],[10])).
% 0.21/0.43 tff(13,plain,
% 0.21/0.43 (((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))) | rearsegP(V!46, U!45)),
% 0.21/0.43 inference(tautology,[status(thm)],[])).
% 0.21/0.43 tff(14,plain,
% 0.21/0.43 ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))),
% 0.21/0.43 inference(unit_resolution,[status(thm)],[13, 12])).
% 0.21/0.43 tff(15,plain,
% 0.21/0.43 ((~(~((~neq(V!46, nil)) | (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))))) <=> ((~neq(V!46, nil)) | (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))))),
% 0.21/0.43 inference(rewrite,[status(thm)],[])).
% 0.21/0.43 tff(16,plain,
% 0.21/0.43 ((neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))) <=> (~((~neq(V!46, nil)) | (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))))),
% 0.21/0.43 inference(rewrite,[status(thm)],[])).
% 0.21/0.43 tff(17,plain,
% 0.21/0.43 ((~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) <=> (~(~((~neq(V!46, nil)) | (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))))))),
% 0.21/0.43 inference(monotonicity,[status(thm)],[16])).
% 0.21/0.43 tff(18,plain,
% 0.21/0.43 ((~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))) <=> ((~neq(V!46, nil)) | (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45)))))),
% 0.21/0.43 inference(transitivity,[status(thm)],[17, 15])).
% 0.21/0.43 tff(19,plain,
% 0.21/0.43 (~(neq(V!46, nil) & ((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))),
% 0.21/0.43 inference(or_elim,[status(thm)],[10])).
% 0.21/0.43 tff(20,plain,
% 0.21/0.43 ((~neq(V!46, nil)) | (~((~neq(U!45, nil)) | (~rearsegP(V!46, U!45))))),
% 0.21/0.43 inference(modus_ponens,[status(thm)],[19, 18])).
% 0.21/0.43 tff(21,plain,
% 0.21/0.43 (~neq(V!46, nil)),
% 0.21/0.43 inference(unit_resolution,[status(thm)],[20, 14])).
% 0.21/0.43 tff(22,plain,
% 0.21/0.43 ($false),
% 0.21/0.43 inference(unit_resolution,[status(thm)],[21, 11])).
% 0.21/0.43 % SZS output end Proof
% 0.21/0.44 % E exiting
%------------------------------------------------------------------------------