%------------------------------------------------------------------------------ % File : ZenonModulo---0.5.0 % Problem : SWC453_1 : TPTP v8.3.0. Released v8.3.0. % Transfm : none % Format : tptp:raw % Command : run_zenon_modulo %d %s % Computer : n026.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 : 300s % DateTime : Tue Jun 25 03:38:56 EDT 2024 % Result : Unknown 0.20s 0.54s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWC453_1 : TPTP v8.3.0. Released v8.3.0. % 0.11/0.12 % Command : run_zenon_modulo %d %s % 0.12/0.33 % Computer : n026.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 : 300 % 0.12/0.33 % DateTime : Mon Jun 24 03:48:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.53 Zenon error: exhausted search space without finding a proof % 0.20/0.53 (* Current branch: % 0.20/0.53 (((2) + (2)) != ((((2) + (1)) * (2)) * (2))) % 0.20/0.53 (Tau_0 >= (0)) % 0.20/0.53 (((((Tau_0 'div:(Int*Int)>Int' ((1) + (2))) - ((Tau_0 'div:(Int*Int)>Int' (2)) 'mod:(Int*Int)>Int' (2))) 'div:(Int*Int)>Int' ((2) + (2))) + (1)) != ((((1) + (Tau_0 - ((2) * (Tau_0 'mod:(Int*Int)>Int' ((1) + (2)))))) 'div:(Int*Int)>Int' ((((2) + (1)) * (2)) * (2))) + (1))) % 0.20/0.53 (((((Tau_0 'div:(Int*Int)>Int' ((1) + (2))) - ((Tau_0 'div:(Int*Int)>Int' (2)) 'mod:(Int*Int)>Int' (2))) 'div:(Int*Int)>Int' ((2) + (2))) + (1)) > ((((1) + (Tau_0 - ((2) * (Tau_0 'mod:(Int*Int)>Int' ((1) + (2)))))) 'div:(Int*Int)>Int' ((((2) + (1)) * (2)) * (2))) + (1))) % 0.20/0.53 ((((Tau_0 'div:(Int*Int)>Int' ((1) + (2))) - ((Tau_0 'div:(Int*Int)>Int' (2)) 'mod:(Int*Int)>Int' (2))) 'div:(Int*Int)>Int' ((2) + (2))) != (((1) + (Tau_0 - ((2) * (Tau_0 'mod:(Int*Int)>Int' ((1) + (2)))))) 'div:(Int*Int)>Int' ((((2) + (1)) * (2)) * (2)))) % 0.20/0.53 ((((Tau_0 'div:(Int*Int)>Int' ((1) + (2))) - ((Tau_0 'div:(Int*Int)>Int' (2)) 'mod:(Int*Int)>Int' (2))) 'div:(Int*Int)>Int' ((2) + (2))) > (((1) + (Tau_0 - ((2) * (Tau_0 'mod:(Int*Int)>Int' ((1) + (2)))))) 'div:(Int*Int)>Int' ((((2) + (1)) * (2)) * (2)))) % 0.20/0.53 (zenon_Vm = ((((Tau_0 'div:(Int*Int)>Int' ((1) + (2))) - ((Tau_0 'div:(Int*Int)>Int' (2)) 'mod:(Int*Int)>Int' (2))) 'div:(Int*Int)>Int' ((2) + (2))) - (((1) + (Tau_0 - ((2) * (Tau_0 'mod:(Int*Int)>Int' ((1) + (2)))))) 'div:(Int*Int)>Int' ((((2) + (1)) * (2)) * (2))))) % 0.20/0.53 (((2) + (2)) < ((((2) + (1)) * (2)) * (2))) % 0.20/0.53 (((((Tau_0 'div:(Int*Int)>Int' ((1) + (2))) - ((Tau_0 'div:(Int*Int)>Int' (2)) 'mod:(Int*Int)>Int' (2))) 'div:(Int*Int)>Int' ((2) + (2))) - (((1) + (Tau_0 - ((2) * (Tau_0 'mod:(Int*Int)>Int' ((1) + (2)))))) 'div:(Int*Int)>Int' ((((2) + (1)) * (2)) * (2)))) >= (1)) % 0.20/0.53 (zenon_Vm >= (1)) % 0.20/0.53 *) % 0.20/0.53 (* NO-PROOF *) % 0.20/0.53 % SZS status GaveUp % 0.20/0.53 Number of rewrites on terms: 2 % 0.20/0.53 Number of rewrites on props: 0 % 0.20/0.53 nodes searched: 14 % 0.20/0.53 max branch formulas: 13 % 0.20/0.53 proof nodes created: 2 % 0.20/0.53 formulas created: 284 % 0.20/0.53 %------------------------------------------------------------------------------