%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : NUM023-1 : TPTP v8.1.0. Bugfixed v4.0.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n008.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 : Mon Jul 18 14:23:43 EDT 2022 % Result : Unsatisfiable 0.20s 0.41s % Output : Refutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NUM023-1 : TPTP v8.1.0. Bugfixed v4.0.0. % 0.11/0.13 % Command : run_spass %d %s % 0.14/0.34 % Computer : n008.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Wed Jul 6 03:29:53 EDT 2022 % 0.14/0.34 % CPUTime : % 0.20/0.41 % 0.20/0.41 SPASS V 3.9 % 0.20/0.41 SPASS beiseite: Proof found. % 0.20/0.41 % SZS status Theorem % 0.20/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.41 SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses. % 0.20/0.41 SPASS allocated 63092 KBytes. % 0.20/0.41 SPASS spent 0:00:00.06 on the problem. % 0.20/0.41 0:00:00.04 for the input. % 0.20/0.41 0:00:00.00 for the FLOTTER CNF translation. % 0.20/0.41 0:00:00.00 for inferences. % 0.20/0.41 0:00:00.00 for the backtracking. % 0.20/0.41 0:00:00.00 for the reduction. % 0.20/0.41 % 0.20/0.41 % 0.20/0.41 Here is a proof with depth 1, length 5 : % 0.20/0.41 % SZS output start Refutation % 0.20/0.41 6[0:Inp] || less(n0,successor(a))*r -> . % 0.20/0.41 7[0:Inp] || -> equalish(add(u,n0),u)*l. % 0.20/0.41 14[0:Inp] || equalish(add(successor(u),v),w)* -> less(v,w). % 0.20/0.41 16[0:Res:14.1,6.0] || equalish(add(successor(u),n0),successor(a))*l -> . % 0.20/0.41 17[0:UnC:16.0,7.0] || -> . % 0.20/0.41 % SZS output end Refutation % 0.20/0.41 Formulae used in the proof : prove_zero_is_less_than_all_successors adding_zero smaller_number % 0.20/0.41 %------------------------------------------------------------------------------