%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : FLD017-1 : TPTP v8.1.0. Bugfixed v2.1.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n017.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 : Sat Jul 16 02:28:18 EDT 2022 % Result : Unsatisfiable 0.21s 0.43s % Output : Refutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : FLD017-1 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.04/0.14 % Command : run_spass %d %s % 0.14/0.35 % Computer : n017.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Mon Jun 6 16:55:16 EDT 2022 % 0.14/0.36 % CPUTime : % 0.21/0.43 % 0.21/0.43 SPASS V 3.9 % 0.21/0.43 SPASS beiseite: Proof found. % 0.21/0.43 % SZS status Theorem % 0.21/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.43 SPASS derived 11 clauses, backtracked 0 clauses, performed 0 splits and kept 43 clauses. % 0.21/0.43 SPASS allocated 75643 KBytes. % 0.21/0.43 SPASS spent 0:00:00.06 on the problem. % 0.21/0.43 0:00:00.03 for the input. % 0.21/0.43 0:00:00.00 for the FLOTTER CNF translation. % 0.21/0.43 0:00:00.00 for inferences. % 0.21/0.43 0:00:00.00 for the backtracking. % 0.21/0.43 0:00:00.00 for the reduction. % 0.21/0.43 % 0.21/0.43 % 0.21/0.43 Here is a proof with depth 2, length 13 : % 0.21/0.43 % SZS output start Refutation % 0.21/0.43 2[0:Inp] || -> defined(b)*. % 0.21/0.43 5[0:Inp] || -> equalish(a,x__dfg)*l. % 0.21/0.43 6[0:Inp] || -> equalish(add(a,b),c)*l. % 0.21/0.43 7[0:Inp] || equalish(add(x__dfg,b),c)*l -> . % 0.21/0.43 29[0:Inp] || equalish(u,v)* -> equalish(v,u). % 0.21/0.43 30[0:Inp] || equalish(u,v)* equalish(v,w)* -> equalish(u,w)*. % 0.21/0.43 31[0:Inp] defined(u) || equalish(v,w) -> equalish(add(v,u),add(w,u))*. % 0.21/0.43 37[0:Res:5.0,31.1] defined(u) || -> equalish(add(a,u),add(x__dfg,u))*l. % 0.21/0.43 39[0:Res:6.0,29.0] || -> equalish(c,add(a,b))*r. % 0.21/0.43 43[0:Res:29.1,7.0] || equalish(c,add(x__dfg,b))*r -> . % 0.21/0.43 57[0:OCh:30.1,30.0,37.1,39.0] defined(b) || -> equalish(c,add(x__dfg,b))*r. % 0.21/0.43 58[0:SSi:57.0,2.0] || -> equalish(c,add(x__dfg,b))*r. % 0.21/0.43 59[0:MRR:58.0,43.0] || -> . % 0.21/0.43 % SZS output end Refutation % 0.21/0.43 Formulae used in the proof : b_is_defined a_equals_x_5 add_equals_c_6 add_not_equal_to_c_7 symmetry_of_equality transitivity_of_equality compatibility_of_equality_and_addition % 0.21/0.43 %------------------------------------------------------------------------------