%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : SWV077+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 : n003.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:49:55 EDT 2022 % Result : Theorem 2.57s 2.74s % Output : Proof 2.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV077+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.07/0.13 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % 0.13/0.34 % Computer : n003.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 15 15:42:11 EDT 2022 % 0.13/0.34 % CPUTime : % 2.57/2.74 % SZS status Theorem % 2.57/2.74 (* PROOF-FOUND *) % 2.57/2.74 (* BEGIN-PROOF *) % 2.57/2.74 % SZS output start Proof % 2.57/2.74 1. (gt (succ (pv31)) (n0)) (-. (gt (succ (pv31)) (n0))) ### Axiom % 2.57/2.74 2. (-. (leq (n0) (pv31))) (gt (succ (pv31)) (n0)) ### Definition-Pseudo(leq) 1 % 2.57/2.74 3. (gt (succ (minus (n5) (n1))) (pv31)) (-. (gt (succ (minus (n5) (n1))) (pv31))) ### Axiom % 2.57/2.74 4. (-. (leq (pv31) (minus (n5) (n1)))) (gt (succ (minus (n5) (n1))) (pv31)) ### Definition-Pseudo(leq) 3 % 2.57/2.74 5. (-. ((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1))))) (gt (succ (minus (n5) (n1))) (pv31)) (gt (succ (pv31)) (n0)) ### NotAnd 2 4 % 2.57/2.74 6. (-. (((n0) != (pv40)) => ((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1)))))) (gt (succ (pv31)) (n0)) (gt (succ (minus (n5) (n1))) (pv31)) ### NotImply 5 % 2.57/2.74 7. (-. (true)) (true) ### P-NotP % 2.57/2.74 8. (-. (((n0) = (pv40)) => (true))) (true) ### NotImply 7 % 2.57/2.74 9. (-. ((leq (n0) (pv31)) /\ ((leq (pv31) (minus (n5) (n1))) /\ ((((n0) != (pv40)) => ((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1))))) /\ (((n0) = (pv40)) => (true)))))) (true) (gt (succ (minus (n5) (n1))) (pv31)) (gt (succ (pv31)) (n0)) ### DisjTree 2 4 6 8 % 2.57/2.74 10. (leq (pv31) (minus (n5) (n1))) (gt (succ (pv31)) (n0)) (true) (-. ((leq (n0) (pv31)) /\ ((leq (pv31) (minus (n5) (n1))) /\ ((((n0) != (pv40)) => ((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1))))) /\ (((n0) = (pv40)) => (true)))))) ### Definition-Pseudo(leq) 9 % 2.57/2.74 11. (leq (n0) (pv31)) (-. ((leq (n0) (pv31)) /\ ((leq (pv31) (minus (n5) (n1))) /\ ((((n0) != (pv40)) => ((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1))))) /\ (((n0) = (pv40)) => (true)))))) (true) (leq (pv31) (minus (n5) (n1))) ### Definition-Pseudo(leq) 10 % 2.57/2.74 12. (-. (((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1)))) => ((leq (n0) (pv31)) /\ ((leq (pv31) (minus (n5) (n1))) /\ ((((n0) != (pv40)) => ((leq (n0) (pv31)) /\ (leq (pv31) (minus (n5) (n1))))) /\ (((n0) = (pv40)) => (true))))))) (true) ### ConjTree 11 % 2.57/2.74 % SZS output end Proof % 2.57/2.74 (* END-PROOF *) %------------------------------------------------------------------------------