%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : FLD058-1 : TPTP v8.1.0. Bugfixed v2.1.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n018.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:33 EDT 2022 % Result : Unsatisfiable 0.19s 0.57s % Output : Refutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.01/0.12 % Problem : FLD058-1 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.12/0.12 % Command : run_spass %d %s % 0.12/0.33 % Computer : n018.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.19/0.33 % CPULimit : 300 % 0.19/0.33 % WCLimit : 600 % 0.19/0.33 % DateTime : Mon Jun 6 11:20:04 EDT 2022 % 0.19/0.33 % CPUTime : % 0.19/0.57 % 0.19/0.57 SPASS V 3.9 % 0.19/0.57 SPASS beiseite: Proof found. % 0.19/0.57 % SZS status Theorem % 0.19/0.57 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.57 SPASS derived 855 clauses, backtracked 0 clauses, performed 0 splits and kept 534 clauses. % 0.19/0.57 SPASS allocated 76532 KBytes. % 0.19/0.57 SPASS spent 0:00:00.22 on the problem. % 0.19/0.57 0:00:00.03 for the input. % 0.19/0.57 0:00:00.00 for the FLOTTER CNF translation. % 0.19/0.57 0:00:00.02 for inferences. % 0.19/0.57 0:00:00.00 for the backtracking. % 0.19/0.57 0:00:00.14 for the reduction. % 0.19/0.57 % 0.19/0.57 % 0.19/0.57 Here is a proof with depth 2, length 16 : % 0.19/0.57 % SZS output start Refutation % 0.19/0.57 3[0:Inp] || -> less_or_equal(additive_identity,a)*r. % 0.19/0.57 4[0:Inp] || -> less_or_equal(a,b)*l. % 0.19/0.57 5[0:Inp] || equalish(a,additive_identity)*l -> . % 0.19/0.57 6[0:Inp] || -> equalish(b,additive_identity)*l. % 0.19/0.57 22[0:Inp] || less_or_equal(u,v)*+ less_or_equal(v,u)* -> equalish(v,u). % 0.19/0.57 28[0:Inp] || equalish(u,v)* -> equalish(v,u). % 0.19/0.57 29[0:Inp] || equalish(u,v)* equalish(v,w)* -> equalish(u,w)*. % 0.19/0.57 32[0:Inp] || equalish(u,v)*+ less_or_equal(u,w)* -> less_or_equal(v,w)*. % 0.19/0.57 34[0:Res:6.0,28.0] || -> equalish(additive_identity,b)*r. % 0.19/0.57 40[0:Res:4.0,22.1] || less_or_equal(b,a)*r -> equalish(b,a). % 0.19/0.57 43[0:Res:3.0,32.0] || equalish(additive_identity,u)*+ -> less_or_equal(u,a)*. % 0.19/0.57 50[0:Res:28.1,5.0] || equalish(additive_identity,a)*r -> . % 0.19/0.57 1109[0:Res:34.0,43.0] || -> less_or_equal(b,a)*r. % 0.19/0.57 1166[0:MRR:40.0,1109.0] || -> equalish(b,a)*r. % 0.19/0.57 1174[0:NCh:29.2,29.1,1166.0,50.0] || equalish(additive_identity,b)*r -> . % 0.19/0.57 1178[0:MRR:1174.0,34.0] || -> . % 0.19/0.57 % SZS output end Refutation % 0.19/0.57 Formulae used in the proof : less_or_equal_3 less_or_equal_4 a_not_equal_to_additive_identity_5 b_equals_additive_identity_6 antisymmetry_of_order_relation symmetry_of_equality transitivity_of_equality compatibility_of_equality_and_order_relation % 0.19/0.57 %------------------------------------------------------------------------------