%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : NUM021-1 : TPTP v8.1.0. Bugfixed v4.0.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n029.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 : Mon Jul 18 14:23:43 EDT 2022 % Result : Unsatisfiable 0.56s 0.78s % Output : Refutation 0.56s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM021-1 : TPTP v8.1.0. Bugfixed v4.0.0. % 0.07/0.13 % Command : run_spass %d %s % 0.13/0.34 % Computer : n029.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 Jul 5 20:14:12 EDT 2022 % 0.13/0.34 % CPUTime : % 0.56/0.78 % 0.56/0.78 SPASS V 3.9 % 0.56/0.78 SPASS beiseite: Proof found. % 0.56/0.78 % SZS status Theorem % 0.56/0.78 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.56/0.78 SPASS derived 1994 clauses, backtracked 0 clauses, performed 0 splits and kept 1284 clauses. % 0.56/0.78 SPASS allocated 64631 KBytes. % 0.56/0.78 SPASS spent 0:00:00.42 on the problem. % 0.56/0.78 0:00:00.04 for the input. % 0.56/0.78 0:00:00.00 for the FLOTTER CNF translation. % 0.56/0.78 0:00:00.04 for inferences. % 0.56/0.78 0:00:00.00 for the backtracking. % 0.56/0.78 0:00:00.32 for the reduction. % 0.56/0.78 % 0.56/0.78 % 0.56/0.78 Here is a proof with depth 3, length 15 : % 0.56/0.78 % SZS output start Refutation % 0.56/0.78 3[0:Inp] || equalish(u,v)* equalish(v,w)* -> equalish(u,w)*. % 0.56/0.78 4[0:Inp] || -> less(b,c)*l. % 0.56/0.78 5[0:Inp] || less(b,a)*l -> . % 0.56/0.78 6[0:Inp] || -> divides(c,a)*. % 0.56/0.78 14[0:Inp] || less(u,v)* less(v,w)* -> less(u,w)*. % 0.56/0.78 15[0:Inp] || equalish(add(successor(u),v),w)* -> less(v,w). % 0.56/0.78 16[0:Inp] || less(u,v) -> equalish(add(successor(predecessor_of_1st_minus_2nd(v,u)),u),v)*l. % 0.56/0.78 17[0:Inp] || divides(u,v)* -> equalish(u,v) less(u,v). % 0.56/0.78 20[0:Res:6.0,17.0] || -> equalish(c,a) less(c,a)*l. % 0.56/0.78 24[0:NCh:14.2,14.0,5.0,4.0] || less(c,a)*l -> . % 0.56/0.78 25[0:MRR:20.1,24.0] || -> equalish(c,a)*l. % 0.56/0.78 131[0:NCh:3.2,3.0,16.1,15.0] || less(u,v)*+ equalish(v,w)* -> less(u,w)*. % 0.56/0.78 660[0:Res:4.0,131.0] || equalish(c,u)*+ -> less(b,u)*. % 0.56/0.78 1945[0:Res:25.0,660.0] || -> less(b,a)*l. % 0.56/0.78 2016[0:MRR:1945.0,5.0] || -> . % 0.56/0.78 % SZS output end Refutation % 0.56/0.78 Formulae used in the proof : transitivity b_less_than_c b_greater_equal_a impossible_c_divides_a transitivity_of_less smaller_number less_lemma divides_only_less_or_equal % 0.56/0.78 %------------------------------------------------------------------------------