%------------------------------------------------------------------------------
% File     : SuperZenon---0.0.1
% Problem  : SWV232+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_super_zenon -p0 -itptp -om -max-time %d %s

% Computer : n019.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 : Wed Jul 20 21:50:26 EDT 2022

% Result   : Theorem 2.73s 2.93s
% Output   : Proof 2.73s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV232+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.12  % Command  : run_super_zenon -p0 -itptp -om -max-time %d %s
% 0.12/0.33  % Computer : n019.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 : Thu Jun 16 02:06:54 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.73/2.93  % SZS status Theorem
% 2.73/2.93  (* PROOF-FOUND *)
% 2.73/2.93  (* BEGIN-PROOF *)
% 2.73/2.93  % SZS output start Proof
% 2.73/2.93  1. ((n0) = T_0) ((n0) != T_0)   ### Axiom
% 2.73/2.93  2. ((n2) = T_1) ((n2) != T_1)   ### Axiom
% 2.73/2.93  3. (-. (((n0) = T_0) /\ ((n2) = T_1))) ((n2) = T_1) ((n0) = T_0)   ### NotAnd 1 2
% 2.73/2.93  4. (-. (((leq (n0) T_1) /\ ((leq (n0) T_0) /\ ((leq T_1 (n2)) /\ (leq T_0 (n2))))) => (((-. (((n0) = T_1) /\ ((n1) = T_0))) /\ ((-. (((n0) = T_1) /\ ((n2) = T_0))) /\ ((-. (((n0) = T_0) /\ ((n2) = T_1))) /\ ((-. (((n1) = T_1) /\ ((n1) = T_0))) /\ ((-. (((n1) = T_1) /\ ((n2) = T_0))) /\ ((-. (((n1) = T_0) /\ ((n2) = T_1))) /\ ((-. (((n2) = T_1) /\ ((n2) = T_0))) /\ (((n0) = T_0) /\ (((n1) = T_1) /\ (((n1) = T_0) /\ ((n2) = T_1))))))))))) => ((a_select2 (rho) (n1)) = (n0)))))   ### ConjTree 3
% 2.73/2.93  5. (-. (All D, (((leq (n0) T_1) /\ ((leq (n0) D) /\ ((leq T_1 (n2)) /\ (leq D (n2))))) => (((-. (((n0) = T_1) /\ ((n1) = D))) /\ ((-. (((n0) = T_1) /\ ((n2) = D))) /\ ((-. (((n0) = D) /\ ((n2) = T_1))) /\ ((-. (((n1) = T_1) /\ ((n1) = D))) /\ ((-. (((n1) = T_1) /\ ((n2) = D))) /\ ((-. (((n1) = D) /\ ((n2) = T_1))) /\ ((-. (((n2) = T_1) /\ ((n2) = D))) /\ (((n0) = D) /\ (((n1) = T_1) /\ (((n1) = D) /\ ((n2) = T_1))))))))))) => ((a_select2 (rho) (n1)) = (n0))))))   ### NotAllEx 4
% 2.73/2.93  6. (-. (All C, (All D, (((leq (n0) C) /\ ((leq (n0) D) /\ ((leq C (n2)) /\ (leq D (n2))))) => (((-. (((n0) = C) /\ ((n1) = D))) /\ ((-. (((n0) = C) /\ ((n2) = D))) /\ ((-. (((n0) = D) /\ ((n2) = C))) /\ ((-. (((n1) = C) /\ ((n1) = D))) /\ ((-. (((n1) = C) /\ ((n2) = D))) /\ ((-. (((n1) = D) /\ ((n2) = C))) /\ ((-. (((n2) = C) /\ ((n2) = D))) /\ (((n0) = D) /\ (((n1) = C) /\ (((n1) = D) /\ ((n2) = C))))))))))) => ((a_select2 (rho) (n1)) = (n0)))))))   ### NotAllEx 5
% 2.73/2.93  7. (-. ((All A, (All B, (((leq (n0) A) /\ ((leq (n0) B) /\ ((leq A (n5)) /\ (leq B (n5))))) => ((a_select3 (q_ds1_filter) A B) = (a_select3 (q_ds1_filter) B A))))) => (All C, (All D, (((leq (n0) C) /\ ((leq (n0) D) /\ ((leq C (n2)) /\ (leq D (n2))))) => (((-. (((n0) = C) /\ ((n1) = D))) /\ ((-. (((n0) = C) /\ ((n2) = D))) /\ ((-. (((n0) = D) /\ ((n2) = C))) /\ ((-. (((n1) = C) /\ ((n1) = D))) /\ ((-. (((n1) = C) /\ ((n2) = D))) /\ ((-. (((n1) = D) /\ ((n2) = C))) /\ ((-. (((n2) = C) /\ ((n2) = D))) /\ (((n0) = D) /\ (((n1) = C) /\ (((n1) = D) /\ ((n2) = C))))))))))) => ((a_select2 (rho) (n1)) = (n0))))))))   ### NotImply 6
% 2.73/2.93  % SZS output end Proof
% 2.73/2.93  (* END-PROOF *)
%------------------------------------------------------------------------------