↑ Up

SuperZenon---0.0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : LAT388+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_super_zenon -p0 -itptp -om -max-time %d %s

% Computer : n021.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 06:58:16 EDT 2022

% Result   : Theorem 0.19s 0.42s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LAT388+4 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.13/0.34  % Computer : n021.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 : Wed Jun 29 11:24:27 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.42  % SZS status Theorem
% 0.19/0.42  (* PROOF-FOUND *)
% 0.19/0.42  (* BEGIN-PROOF *)
% 0.19/0.42  % SZS output start Proof
% 0.19/0.42  1. (aSupremumOfIn0 (xp) (xT) (xS)) (-. (aSupremumOfIn0 (xp) (xT) (xS)))   ### Axiom
% 0.19/0.42  2. (-. (((aElementOf0 (xp) (xS)) /\ ((((aElementOf0 (xp) (xS)) /\ (All W0, ((aElementOf0 W0 (xT)) => (sdtlseqdt0 W0 (xp))))) \/ (aUpperBoundOfIn0 (xp) (xT) (xS))) /\ (All W1, (((aElementOf0 W1 (xS)) /\ ((All W2, ((aElementOf0 W2 (xT)) => (sdtlseqdt0 W2 W1))) /\ (aUpperBoundOfIn0 W1 (xT) (xS)))) => (sdtlseqdt0 (xp) W1))))) \/ (aSupremumOfIn0 (xp) (xT) (xS)))) (aSupremumOfIn0 (xp) (xT) (xS))   ### NotOr 1
% 0.19/0.42  3. (-. (Ex W0, (((aElementOf0 W0 (xS)) /\ ((((aElementOf0 W0 (xS)) /\ (All W1, ((aElementOf0 W1 (xT)) => (sdtlseqdt0 W1 W0)))) \/ (aUpperBoundOfIn0 W0 (xT) (xS))) /\ (All W1, (((aElementOf0 W1 (xS)) /\ ((All W2, ((aElementOf0 W2 (xT)) => (sdtlseqdt0 W2 W1))) /\ (aUpperBoundOfIn0 W1 (xT) (xS)))) => (sdtlseqdt0 W0 W1))))) \/ (aSupremumOfIn0 W0 (xT) (xS))))) (aSupremumOfIn0 (xp) (xT) (xS))   ### NotExists 2
% 0.19/0.42  4. ((aElementOf0 (xp) (szDzozmdt0 (xf))) /\ (((sdtlpdtrp0 (xf) (xp)) = (xp)) /\ ((aFixedPointOf0 (xp) (xf)) /\ ((All W0, ((aElementOf0 W0 (xT)) => (sdtlseqdt0 W0 (xp)))) /\ ((aUpperBoundOfIn0 (xp) (xT) (xS)) /\ ((All W0, ((((aElementOf0 W0 (xS)) /\ (All W1, ((aElementOf0 W1 (xT)) => (sdtlseqdt0 W1 W0)))) \/ (aUpperBoundOfIn0 W0 (xT) (xS))) => (sdtlseqdt0 (xp) W0))) /\ (aSupremumOfIn0 (xp) (xT) (xS)))))))) (-. (Ex W0, (((aElementOf0 W0 (xS)) /\ ((((aElementOf0 W0 (xS)) /\ (All W1, ((aElementOf0 W1 (xT)) => (sdtlseqdt0 W1 W0)))) \/ (aUpperBoundOfIn0 W0 (xT) (xS))) /\ (All W1, (((aElementOf0 W1 (xS)) /\ ((All W2, ((aElementOf0 W2 (xT)) => (sdtlseqdt0 W2 W1))) /\ (aUpperBoundOfIn0 W1 (xT) (xS)))) => (sdtlseqdt0 W0 W1))))) \/ (aSupremumOfIn0 W0 (xT) (xS)))))   ### ConjTree 3
% 0.19/0.42  % SZS output end Proof
% 0.19/0.42  (* END-PROOF *)
%------------------------------------------------------------------------------