%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : NUM020-1 : TPTP v8.1.0. Bugfixed v4.0.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n005.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:42 EDT 2022 % Result : Unsatisfiable 0.19s 0.46s % Output : Refutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM020-1 : TPTP v8.1.0. Bugfixed v4.0.0. % 0.07/0.12 % Command : run_spass %d %s % 0.13/0.33 % Computer : n005.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.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jul 7 21:36:37 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.46 % 0.19/0.46 SPASS V 3.9 % 0.19/0.46 SPASS beiseite: Proof found. % 0.19/0.46 % SZS status Theorem % 0.19/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.46 SPASS derived 389 clauses, backtracked 0 clauses, performed 0 splits and kept 241 clauses. % 0.19/0.46 SPASS allocated 63419 KBytes. % 0.19/0.46 SPASS spent 0:00:00.10 on the problem. % 0.19/0.46 0:00:00.04 for the input. % 0.19/0.46 0:00:00.00 for the FLOTTER CNF translation. % 0.19/0.46 0:00:00.01 for inferences. % 0.19/0.46 0:00:00.00 for the backtracking. % 0.19/0.46 0:00:00.03 for the reduction. % 0.19/0.46 % 0.19/0.46 % 0.19/0.46 Here is a proof with depth 2, length 8 : % 0.19/0.46 % SZS output start Refutation % 0.19/0.46 3[0:Inp] || equalish(u,v)* equalish(v,w)* -> equalish(u,w)*. % 0.19/0.46 5[0:Inp] || equalish(add(a,successor(n0)),successor(a))*l -> . % 0.19/0.46 7[0:Inp] || -> equalish(add(u,n0),u)*l. % 0.19/0.46 8[0:Inp] || -> equalish(add(u,successor(v)),successor(add(u,v)))*r. % 0.19/0.46 12[0:Inp] || equalish(u,v) -> equalish(successor(u),successor(v))*. % 0.19/0.46 46[0:OCh:3.1,3.0,12.1,8.0] || equalish(add(u,v),w) -> equalish(add(u,successor(v)),successor(w))*. % 0.19/0.46 385[0:Res:46.1,5.0] || equalish(add(a,n0),a)*l -> . % 0.19/0.46 407[0:MRR:385.0,7.0] || -> . % 0.19/0.46 % SZS output end Refutation % 0.19/0.46 Formulae used in the proof : transitivity deny_addition_lemma adding_zero addition successor_substitution % 0.19/0.46 %------------------------------------------------------------------------------