%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SWV187+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 : n014.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:17 EDT 2022 % Result : Theorem 2.65s 2.86s % Output : Proof 2.65s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV187+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 : n014.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 : Wed Jun 15 15:10:21 EDT 2022 % 0.12/0.33 % CPUTime : % 2.65/2.86 % SZS status Theorem % 2.65/2.86 (* PROOF-FOUND *) % 2.65/2.86 (* BEGIN-PROOF *) % 2.65/2.86 % SZS output start Proof % 2.65/2.86 1. (gt (loopcounter) (n1)) (-. (gt (loopcounter) (n1))) ### Axiom % 2.65/2.86 2. (-. (All F, (((leq (n0) F) /\ (leq F (n4))) => ((a_select2 (sigmaold_init) F) = (init))))) (All F, (((leq (n0) F) /\ (leq F (n4))) => ((a_select2 (sigmaold_init) F) = (init)))) ### Axiom % 2.65/2.86 3. ((gt (loopcounter) (n1)) => (All F, (((leq (n0) F) /\ (leq F (n4))) => ((a_select2 (sigmaold_init) F) = (init))))) (-. (All F, (((leq (n0) F) /\ (leq F (n4))) => ((a_select2 (sigmaold_init) F) = (init))))) (gt (loopcounter) (n1)) ### Imply 1 2 % 2.65/2.86 4. (-. (((gt (loopcounter) (n1)) /\ ((All A, (((leq (n0) A) /\ (leq A (n135299))) => (All B, (((leq (n0) B) /\ (leq B (n4))) => ((a_select3 (q_init) A B) = (init)))))) /\ ((All C, (((leq (n0) C) /\ (leq C (n4))) => ((a_select3 (center_init) C (n0)) = (init)))) /\ (((gt (loopcounter) (n1)) => (All D, (((leq (n0) D) /\ (leq D (n4))) => ((a_select2 (muold_init) D) = (init))))) /\ (((gt (loopcounter) (n1)) => (All E, (((leq (n0) E) /\ (leq E (n4))) => ((a_select2 (rhoold_init) E) = (init))))) /\ ((gt (loopcounter) (n1)) => (All F, (((leq (n0) F) /\ (leq F (n4))) => ((a_select2 (sigmaold_init) F) = (init)))))))))) => (All F, (((leq (n0) F) /\ (leq F (n4))) => ((a_select2 (sigmaold_init) F) = (init)))))) ### ConjTree 3 % 2.65/2.86 % SZS output end Proof % 2.65/2.86 (* END-PROOF *) %------------------------------------------------------------------------------