%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV185+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:33 EDT 2022 % Result : Theorem 0.16s 0.47s % Output : Refutation 0.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : SWV185+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.07/0.12 % Command : run_spass %d %s % 0.12/0.31 % Computer : n032.cluster.edu % 0.12/0.31 % Model : x86_64 x86_64 % 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.31 % Memory : 8042.1875MB % 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.31 % CPULimit : 300 % 0.12/0.31 % WCLimit : 600 % 0.12/0.31 % DateTime : Thu Jun 16 04:45:14 EDT 2022 % 0.12/0.31 % CPUTime : % 0.16/0.47 % 0.16/0.47 SPASS V 3.9 % 0.16/0.47 SPASS beiseite: Proof found. % 0.16/0.47 % SZS status Theorem % 0.16/0.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.16/0.47 SPASS derived 200 clauses, backtracked 0 clauses, performed 0 splits and kept 170 clauses. % 0.16/0.47 SPASS allocated 85825 KBytes. % 0.16/0.47 SPASS spent 0:00:00.14 on the problem. % 0.16/0.47 0:00:00.03 for the input. % 0.16/0.47 0:00:00.05 for the FLOTTER CNF translation. % 0.16/0.47 0:00:00.00 for inferences. % 0.16/0.47 0:00:00.00 for the backtracking. % 0.16/0.47 0:00:00.02 for the reduction. % 0.16/0.47 % 0.16/0.47 % 0.16/0.47 Here is a proof with depth 1, length 8 : % 0.16/0.47 % SZS output start Refutation % 0.16/0.47 2[0:Inp] || -> leq(n0,skc1)*r. % 0.16/0.47 3[0:Inp] || -> gt(loopcounter,n1)*r. % 0.16/0.47 4[0:Inp] || -> leq(skc1,n4)*l. % 0.16/0.47 58[0:Inp] || equal(a_select2(rhoold_init,skc1),init)** -> . % 0.16/0.47 117[0:Inp] || gt(loopcounter,n1) leq(n0,u) leq(u,n4) -> equal(a_select2(rhoold_init,u),init)**. % 0.16/0.47 167[0:MRR:117.0,3.0] || leq(u,n4) leq(n0,u) -> equal(a_select2(rhoold_init,u),init)**. % 0.16/0.47 229[0:Res:4.0,167.1] || leq(n0,skc1) -> equal(a_select2(rhoold_init,skc1),init)**. % 0.16/0.47 375[0:MRR:229.0,229.1,2.0,58.0] || -> . % 0.16/0.47 % SZS output end Refutation % 0.16/0.47 Formulae used in the proof : cl5_nebula_init_0101 % 0.16/0.47 %------------------------------------------------------------------------------