%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : FLD021-1 : TPTP v8.1.0. Bugfixed v2.1.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n027.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:20 EDT 2022 % Result : Unsatisfiable 0.22s 0.44s % Output : Refutation 0.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : FLD021-1 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.08/0.14 % Command : run_spass %d %s % 0.14/0.36 % Computer : n027.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Mon Jun 6 16:29:39 EDT 2022 % 0.14/0.36 % CPUTime : % 0.22/0.44 % 0.22/0.44 SPASS V 3.9 % 0.22/0.44 SPASS beiseite: Proof found. % 0.22/0.44 % SZS status Theorem % 0.22/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.22/0.44 SPASS derived 24 clauses, backtracked 0 clauses, performed 0 splits and kept 49 clauses. % 0.22/0.44 SPASS allocated 75655 KBytes. % 0.22/0.44 SPASS spent 0:00:00.06 on the problem. % 0.22/0.44 0:00:00.03 for the input. % 0.22/0.44 0:00:00.00 for the FLOTTER CNF translation. % 0.22/0.44 0:00:00.00 for inferences. % 0.22/0.44 0:00:00.00 for the backtracking. % 0.22/0.44 0:00:00.00 for the reduction. % 0.22/0.44 % 0.22/0.44 % 0.22/0.44 Here is a proof with depth 3, length 11 : % 0.22/0.44 % SZS output start Refutation % 0.22/0.44 1[0:Inp] || -> defined(a)*. % 0.22/0.44 3[0:Inp] || -> equalish(m,additive_identity)*l. % 0.22/0.44 4[0:Inp] || equalish(add(m,a),a)*l -> . % 0.22/0.44 6[0:Inp] defined(u) || -> equalish(add(additive_identity,u),u)*l. % 0.22/0.44 27[0:Inp] || equalish(u,v)* equalish(v,w)* -> equalish(u,w)*. % 0.22/0.44 28[0:Inp] defined(u) || equalish(v,w) -> equalish(add(v,u),add(w,u))*. % 0.22/0.44 34[0:Res:3.0,28.1] defined(u) || -> equalish(add(m,u),add(additive_identity,u))*l. % 0.22/0.44 47[0:NCh:27.2,27.0,34.1,4.0] defined(a) || equalish(add(additive_identity,a),a)*l -> . % 0.22/0.44 48[0:SSi:47.0,1.0] || equalish(add(additive_identity,a),a)*l -> . % 0.22/0.44 63[0:Res:6.1,48.0] defined(a) || -> . % 0.22/0.44 65[0:SSi:63.0,1.0] || -> . % 0.22/0.44 % SZS output end Refutation % 0.22/0.44 Formulae used in the proof : a_is_defined m_equals_additive_identity_3 add_not_equal_to_a_4 existence_of_identity_addition transitivity_of_equality compatibility_of_equality_and_addition % 0.22/0.44 %------------------------------------------------------------------------------