%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV008-1 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n006.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:40:55 EDT 2022 % Result : Unsatisfiable 0.20s 0.42s % Output : Refutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SWV008-1 : TPTP v8.1.0. Released v1.0.0. % 0.04/0.13 % Command : run_spass %d %s % 0.13/0.34 % Computer : n006.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 : Tue Jun 14 21:34:11 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.42 % 0.20/0.42 SPASS V 3.9 % 0.20/0.42 SPASS beiseite: Proof found. % 0.20/0.42 % SZS status Theorem % 0.20/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.42 SPASS derived 31 clauses, backtracked 0 clauses, performed 0 splits and kept 39 clauses. % 0.20/0.42 SPASS allocated 63119 KBytes. % 0.20/0.42 SPASS spent 0:00:00.06 on the problem. % 0.20/0.42 0:00:00.04 for the input. % 0.20/0.42 0:00:00.00 for the FLOTTER CNF translation. % 0.20/0.42 0:00:00.00 for inferences. % 0.20/0.42 0:00:00.00 for the backtracking. % 0.20/0.42 0:00:00.00 for the reduction. % 0.20/0.42 % 0.20/0.42 % 0.20/0.42 Here is a proof with depth 1, length 16 : % 0.20/0.42 % SZS output start Refutation % 0.20/0.42 1[0:Inp] || less_than(n,l)*r -> . % 0.20/0.42 2[0:Inp] || -> less_than(one,l)*l. % 0.20/0.42 3[0:Inp] || -> less_than(a(l),a(predecessor(l)))*r. % 0.20/0.42 4[0:Inp] || less_than(one,n) less_than(a(u),a(predecessor(n)))* -> less_than(u,n) less_than(n,u). % 0.20/0.42 5[0:Inp] || less_than(u,n) less_than(one,u) less_than(a(u),a(predecessor(u)))*r -> . % 0.20/0.42 13[0:Inp] || -> equal(u,v) less_than(v,u)* less_than(u,v)*. % 0.20/0.42 14[0:Inp] || less_than(u,u)* -> . % 0.20/0.42 23[0:Res:13.0,1.0] || -> less_than(l,n)*l equal(l,n). % 0.20/0.42 25[0:Res:4.3,1.0] || less_than(one,n) less_than(a(l),a(predecessor(n)))*r -> less_than(l,n). % 0.20/0.42 32[0:Res:3.0,5.2] || less_than(one,l)*l less_than(l,n) -> . % 0.20/0.42 37[0:MRR:32.0,2.0] || less_than(l,n)*l -> . % 0.20/0.42 38[0:MRR:23.0,37.0] || -> equal(l,n)**. % 0.20/0.42 39[0:Rew:38.0,2.0] || -> less_than(one,n)*l. % 0.20/0.42 43[0:Rew:38.0,3.0] || -> less_than(a(n),a(predecessor(n)))*r. % 0.20/0.42 57[0:Rew:38.0,25.2,38.0,25.1] || less_than(one,n) less_than(a(n),a(predecessor(n)))*r -> less_than(n,n). % 0.20/0.42 58[0:MRR:57.0,57.1,57.2,39.0,43.0,14.0] || -> . % 0.20/0.42 % SZS output end Refutation % 0.20/0.42 Formulae used in the proof : clause_1 clause_2 clause_3 clause_4 clause_5 all_related x_not_less_than_x % 0.20/0.42 %------------------------------------------------------------------------------