%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SWV231+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 : n024.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.62s 2.79s % Output : Proof 2.62s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV231+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.13/0.33 % Computer : n024.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Wed Jun 15 23:43:48 EDT 2022 % 0.13/0.33 % CPUTime : % 2.62/2.79 % SZS status Theorem % 2.62/2.79 (* PROOF-FOUND *) % 2.62/2.79 (* BEGIN-PROOF *) % 2.62/2.79 % SZS output start Proof % 2.62/2.79 1. ((n3) = T_0) ((n3) != T_0) ### Axiom % 2.62/2.79 2. ((n5) = T_1) ((n5) != T_1) ### Axiom % 2.62/2.79 3. (-. (((n3) = T_0) /\ ((n5) = T_1))) ((n5) = T_1) ((n3) = T_0) ### NotAnd 1 2 % 2.62/2.79 4. (-. (((leq (n0) T_0) /\ ((leq (n0) T_1) /\ ((leq T_0 (n5)) /\ (leq T_1 (n5))))) => (((-. (((n0) = T_1) /\ ((n4) = T_0))) /\ ((-. (((n0) = T_1) /\ ((n5) = T_0))) /\ ((-. (((n1) = T_1) /\ ((n4) = T_0))) /\ ((-. (((n1) = T_1) /\ ((n5) = T_0))) /\ ((-. (((n2) = T_1) /\ ((n4) = T_0))) /\ ((-. (((n2) = T_1) /\ ((n5) = T_0))) /\ ((-. (((n3) = T_0) /\ ((n5) = T_1))) /\ ((-. (((n3) = T_1) /\ ((n4) = T_0))) /\ ((-. (((n3) = T_1) /\ ((n5) = T_0))) /\ ((-. (((n4) = T_0) /\ ((n4) = T_1))) /\ ((-. (((n4) = T_0) /\ ((n5) = T_1))) /\ ((-. (((n4) = T_1) /\ ((n5) = T_0))) /\ ((-. (((n5) = T_0) /\ ((n5) = T_1))) /\ (((n3) = T_0) /\ (((n4) = T_1) /\ (((n5) = T_0) /\ ((n5) = T_1))))))))))))))))) => ((n0) = (a_select2 (xinit_noise) (n5)))))) ### ConjTree 3 % 2.62/2.79 5. (-. (All F, (((leq (n0) T_0) /\ ((leq (n0) F) /\ ((leq T_0 (n5)) /\ (leq F (n5))))) => (((-. (((n0) = F) /\ ((n4) = T_0))) /\ ((-. (((n0) = F) /\ ((n5) = T_0))) /\ ((-. (((n1) = F) /\ ((n4) = T_0))) /\ ((-. (((n1) = F) /\ ((n5) = T_0))) /\ ((-. (((n2) = F) /\ ((n4) = T_0))) /\ ((-. (((n2) = F) /\ ((n5) = T_0))) /\ ((-. (((n3) = T_0) /\ ((n5) = F))) /\ ((-. (((n3) = F) /\ ((n4) = T_0))) /\ ((-. (((n3) = F) /\ ((n5) = T_0))) /\ ((-. (((n4) = T_0) /\ ((n4) = F))) /\ ((-. (((n4) = T_0) /\ ((n5) = F))) /\ ((-. (((n4) = F) /\ ((n5) = T_0))) /\ ((-. (((n5) = T_0) /\ ((n5) = F))) /\ (((n3) = T_0) /\ (((n4) = F) /\ (((n5) = T_0) /\ ((n5) = F))))))))))))))))) => ((n0) = (a_select2 (xinit_noise) (n5))))))) ### NotAllEx 4 % 2.62/2.79 6. (-. (All E, (All F, (((leq (n0) E) /\ ((leq (n0) F) /\ ((leq E (n5)) /\ (leq F (n5))))) => (((-. (((n0) = F) /\ ((n4) = E))) /\ ((-. (((n0) = F) /\ ((n5) = E))) /\ ((-. (((n1) = F) /\ ((n4) = E))) /\ ((-. (((n1) = F) /\ ((n5) = E))) /\ ((-. (((n2) = F) /\ ((n4) = E))) /\ ((-. (((n2) = F) /\ ((n5) = E))) /\ ((-. (((n3) = E) /\ ((n5) = F))) /\ ((-. (((n3) = F) /\ ((n4) = E))) /\ ((-. (((n3) = F) /\ ((n5) = E))) /\ ((-. (((n4) = E) /\ ((n4) = F))) /\ ((-. (((n4) = E) /\ ((n5) = F))) /\ ((-. (((n4) = F) /\ ((n5) = E))) /\ ((-. (((n5) = E) /\ ((n5) = F))) /\ (((n3) = E) /\ (((n4) = F) /\ (((n5) = E) /\ ((n5) = F))))))))))))))))) => ((n0) = (a_select2 (xinit_noise) (n5)))))))) ### NotAllEx 5 % 2.62/2.79 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))))) => ((a_select3 (r_ds1_filter) C D) = (a_select3 (r_ds1_filter) D C)))))) => (All E, (All F, (((leq (n0) E) /\ ((leq (n0) F) /\ ((leq E (n5)) /\ (leq F (n5))))) => (((-. (((n0) = F) /\ ((n4) = E))) /\ ((-. (((n0) = F) /\ ((n5) = E))) /\ ((-. (((n1) = F) /\ ((n4) = E))) /\ ((-. (((n1) = F) /\ ((n5) = E))) /\ ((-. (((n2) = F) /\ ((n4) = E))) /\ ((-. (((n2) = F) /\ ((n5) = E))) /\ ((-. (((n3) = E) /\ ((n5) = F))) /\ ((-. (((n3) = F) /\ ((n4) = E))) /\ ((-. (((n3) = F) /\ ((n5) = E))) /\ ((-. (((n4) = E) /\ ((n4) = F))) /\ ((-. (((n4) = E) /\ ((n5) = F))) /\ ((-. (((n4) = F) /\ ((n5) = E))) /\ ((-. (((n5) = E) /\ ((n5) = F))) /\ (((n3) = E) /\ (((n4) = F) /\ (((n5) = E) /\ ((n5) = F))))))))))))))))) => ((n0) = (a_select2 (xinit_noise) (n5))))))))) ### ConjTree 6 % 2.62/2.79 % SZS output end Proof % 2.62/2.79 (* END-PROOF *) %------------------------------------------------------------------------------