%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp % Command : run_spass %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 : 600s % DateTime : Wed Jul 20 21:40:54 EDT 2022 % Result : Unsatisfiable 0.22s 0.49s % Output : Refutation 0.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0. % 0.08/0.15 % Command : run_spass %d %s % 0.14/0.37 % Computer : n026.cluster.edu % 0.14/0.37 % Model : x86_64 x86_64 % 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.37 % Memory : 8042.1875MB % 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.37 % CPULimit : 300 % 0.14/0.37 % WCLimit : 600 % 0.14/0.37 % DateTime : Wed Jun 15 10:09:07 EDT 2022 % 0.14/0.37 % CPUTime : % 0.22/0.49 % 0.22/0.49 SPASS V 3.9 % 0.22/0.49 SPASS beiseite: Proof found. % 0.22/0.49 % SZS status Theorem % 0.22/0.49 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.49 SPASS derived 410 clauses, backtracked 25 clauses, performed 3 splits and kept 225 clauses. % 0.22/0.49 SPASS allocated 63385 KBytes. % 0.22/0.49 SPASS spent 0:00:00.10 on the problem. % 0.22/0.49 0:00:00.04 for the input. % 0.22/0.49 0:00:00.00 for the FLOTTER CNF translation. % 0.22/0.49 0:00:00.01 for inferences. % 0.22/0.49 0:00:00.00 for the backtracking. % 0.22/0.49 0:00:00.03 for the reduction. % 0.22/0.49 % 0.22/0.49 % 0.22/0.49 Here is a proof with depth 2, length 22 : % 0.22/0.49 % SZS output start Refutation % 0.22/0.49 3[0:Inp] || -> less_than(i,n)*l. % 0.22/0.49 4[0:Inp] || less_than(n,m)*r -> . % 0.22/0.49 5[0:Inp] || -> less_than(i,m)*r. % 0.22/0.49 8[0:Inp] || -> less_than(a(m),a(k))*l. % 0.22/0.49 11[0:Inp] || less_than(u,successor(n))* less_than(a(u),a(k))*+ -> less_than(u,i). % 0.22/0.49 17[0:Inp] || -> less_than(u,successor(u))*r. % 0.22/0.49 18[0:Inp] || less_than(u,v)* less_than(v,w)* -> less_than(u,w)*. % 0.22/0.49 19[0:Inp] || -> equal(u,v) less_than(v,u)* less_than(u,v)*. % 0.22/0.49 21[0:Inp] || less_than(u,v)*+ less_than(v,u)* -> . % 0.22/0.49 30[0:Res:5.0,21.0] || less_than(m,i)*l -> . % 0.22/0.49 34[0:Res:3.0,21.0] || less_than(n,i)*r -> . % 0.22/0.49 42[0:Res:19.0,4.0] || -> equal(m,n) less_than(m,n)*l. % 0.22/0.49 48[1:Spt:42.0] || -> equal(m,n)**. % 0.22/0.49 49[1:Rew:48.0,8.0] || -> less_than(a(n),a(k))*r. % 0.22/0.49 365[1:Res:49.0,11.1] || less_than(n,successor(n))*r -> less_than(n,i). % 0.22/0.49 376[1:MRR:365.0,365.1,17.0,34.0] || -> . % 0.22/0.49 377[1:Spt:376.0,42.0,48.0] || equal(m,n)** -> . % 0.22/0.49 378[1:Spt:376.0,42.1] || -> less_than(m,n)*l. % 0.22/0.49 437[0:Res:8.0,11.1] || less_than(m,successor(n))*r -> less_than(m,i). % 0.22/0.49 448[0:MRR:437.1,30.0] || less_than(m,successor(n))*r -> . % 0.22/0.49 454[0:NCh:18.2,18.1,448.0,17.0] || less_than(m,n)*l -> . % 0.22/0.49 458[1:MRR:454.0,378.0] || -> . % 0.22/0.49 % SZS output end Refutation % 0.22/0.49 Formulae used in the proof : clause_3 clause_4 clause_5 clause_8 clause_11 less_than_successor transitivity_of_less_than all_related anti_symmetry_of_less_than % 0.22/0.49 %------------------------------------------------------------------------------