%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV006-1 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n014.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:54 EDT 2022 % Result : Unsatisfiable 0.19s 0.41s % Output : Refutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWV006-1 : TPTP v8.1.0. Released v1.0.0. % 0.11/0.12 % Command : run_spass %d %s % 0.12/0.33 % Computer : n014.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 : 600 % 0.12/0.33 % DateTime : Tue Jun 14 19:35:51 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.41 % 0.19/0.41 SPASS V 3.9 % 0.19/0.41 SPASS beiseite: Proof found. % 0.19/0.41 % SZS status Theorem % 0.19/0.41 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 SPASS derived 126 clauses, backtracked 0 clauses, performed 2 splits and kept 80 clauses. % 0.19/0.41 SPASS allocated 63193 KBytes. % 0.19/0.41 SPASS spent 0:00:00.06 on the problem. % 0.19/0.41 0:00:00.04 for the input. % 0.19/0.41 0:00:00.00 for the FLOTTER CNF translation. % 0.19/0.41 0:00:00.00 for inferences. % 0.19/0.41 0:00:00.00 for the backtracking. % 0.19/0.41 0:00:00.00 for the reduction. % 0.19/0.41 % 0.19/0.41 % 0.19/0.41 Here is a proof with depth 2, length 10 : % 0.19/0.41 % SZS output start Refutation % 0.19/0.41 3[0:Inp] || -> less_than(i,n)*l. % 0.19/0.41 5[0:Inp] || -> less_than(a(i),a(m))*l. % 0.19/0.41 6[0:Inp] || less_than(u,successor(n))* less_than(a(u),a(m))* -> less_than(u,i). % 0.19/0.41 14[0:Inp] || -> less_than(u,successor(u))*r. % 0.19/0.41 15[0:Inp] || less_than(u,v)* less_than(v,w)* -> less_than(u,w)*. % 0.19/0.41 17[0:Inp] || less_than(u,u)* -> . % 0.19/0.41 42[0:Res:5.0,6.1] || less_than(i,successor(n))*r -> less_than(i,i). % 0.19/0.41 43[0:MRR:42.1,17.0] || less_than(i,successor(n))*r -> . % 0.19/0.41 151[0:NCh:15.2,15.1,43.0,14.0] || less_than(i,n)*l -> . % 0.19/0.41 153[0:MRR:151.0,3.0] || -> . % 0.19/0.41 % SZS output end Refutation % 0.19/0.41 Formulae used in the proof : clause_3 clause_5 clause_6 less_than_successor transitivity_of_less_than x_not_less_than_x % 0.19/0.41 %------------------------------------------------------------------------------