%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV140+1 : TPTP v8.1.0. Bugfixed v3.3.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n032.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:41:24 EDT 2022 % Result : Theorem 0.14s 0.42s % Output : Refutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.09 % Problem : SWV140+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.02/0.09 % Command : run_spass %d %s % 0.10/0.28 % Computer : n032.cluster.edu % 0.10/0.28 % Model : x86_64 x86_64 % 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.28 % Memory : 8042.1875MB % 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.28 % CPULimit : 300 % 0.10/0.28 % WCLimit : 600 % 0.10/0.28 % DateTime : Thu Jun 16 06:47:59 EDT 2022 % 0.10/0.29 % CPUTime : % 0.14/0.42 % 0.14/0.42 SPASS V 3.9 % 0.14/0.42 SPASS beiseite: Proof found. % 0.14/0.42 % SZS status Theorem % 0.14/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.42 SPASS derived 128 clauses, backtracked 0 clauses, performed 0 splits and kept 154 clauses. % 0.14/0.42 SPASS allocated 85751 KBytes. % 0.14/0.42 SPASS spent 0:00:00.12 on the problem. % 0.14/0.42 0:00:00.03 for the input. % 0.14/0.42 0:00:00.05 for the FLOTTER CNF translation. % 0.14/0.42 0:00:00.00 for inferences. % 0.14/0.42 0:00:00.00 for the backtracking. % 0.14/0.42 0:00:00.01 for the reduction. % 0.14/0.42 % 0.14/0.42 % 0.14/0.42 Here is a proof with depth 1, length 9 : % 0.14/0.42 % SZS output start Refutation % 0.14/0.42 3[0:Inp] || -> leq(n1,loopcounter)*r. % 0.14/0.42 26[0:Inp] || leq(n0,s_sworst7)*r -> . % 0.14/0.42 27[0:Inp] || -> equal(succ(n0),n1)**. % 0.14/0.42 59[0:Inp] || gt(loopcounter,n0) -> leq(n0,s_sworst7)*r. % 0.14/0.42 88[0:Inp] || leq(succ(u),v)* -> gt(v,u). % 0.14/0.42 156[0:MRR:59.1,26.0] || gt(loopcounter,n0)*r -> . % 0.14/0.42 281[0:Res:88.1,156.0] || leq(succ(n0),loopcounter)*l -> . % 0.14/0.42 285[0:Rew:27.0,281.0] || leq(n1,loopcounter)*r -> . % 0.14/0.42 286[0:MRR:285.0,3.0] || -> . % 0.14/0.42 % SZS output end Refutation % 0.14/0.42 Formulae used in the proof : gauss_array_0010 successor_1 leq_succ_gt % 0.14/0.42 %------------------------------------------------------------------------------