%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : FLD055-1 : TPTP v8.1.0. Bugfixed v2.1.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n024.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:32 EDT 2022 % Result : Unsatisfiable 0.18s 0.58s % Output : Refutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : FLD055-1 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.11/0.12 % Command : run_spass %d %s % 0.12/0.33 % Computer : n024.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.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jun 6 20:18:05 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.58 % 0.18/0.58 SPASS V 3.9 % 0.18/0.58 SPASS beiseite: Proof found. % 0.18/0.58 % SZS status Theorem % 0.18/0.58 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.58 SPASS derived 969 clauses, backtracked 0 clauses, performed 0 splits and kept 618 clauses. % 0.18/0.58 SPASS allocated 76606 KBytes. % 0.18/0.58 SPASS spent 0:00:00.24 on the problem. % 0.18/0.58 0:00:00.04 for the input. % 0.18/0.58 0:00:00.00 for the FLOTTER CNF translation. % 0.18/0.58 0:00:00.02 for inferences. % 0.18/0.58 0:00:00.00 for the backtracking. % 0.18/0.58 0:00:00.16 for the reduction. % 0.18/0.58 % 0.18/0.58 % 0.18/0.58 Here is a proof with depth 3, length 16 : % 0.18/0.58 % SZS output start Refutation % 0.18/0.58 3[0:Inp] || -> defined(c)*. % 0.18/0.58 4[0:Inp] || -> less_or_equal(a,b)*l. % 0.18/0.58 5[0:Inp] || -> equalish(b,c)*l. % 0.18/0.58 6[0:Inp] || less_or_equal(a,c)*l -> . % 0.18/0.58 23[0:Inp] || less_or_equal(u,v)* less_or_equal(v,w)* -> less_or_equal(u,w)*. % 0.18/0.58 24[0:Inp] defined(u) defined(v) || -> less_or_equal(u,v)* less_or_equal(v,u)*. % 0.18/0.58 28[0:Inp] || equalish(u,v)* -> equalish(v,u). % 0.18/0.58 32[0:Inp] || equalish(u,v)*+ less_or_equal(u,w)* -> less_or_equal(v,w)*. % 0.18/0.58 34[0:Res:5.0,28.0] || -> equalish(c,b)*r. % 0.18/0.58 56[0:NCh:23.2,23.0,6.0,4.0] || less_or_equal(b,c)*l -> . % 0.18/0.58 173[0:Fac:24.2,24.3] defined(u) defined(u) || -> less_or_equal(u,u)*. % 0.18/0.58 210[0:Obv:173.0] defined(u) || -> less_or_equal(u,u)*. % 0.18/0.58 553[0:Res:34.0,32.0] || less_or_equal(c,u)*+ -> less_or_equal(b,u)*. % 0.18/0.58 1246[0:Res:210.1,553.0] defined(c) || -> less_or_equal(b,c)*l. % 0.18/0.58 1263[0:SSi:1246.0,3.0] || -> less_or_equal(b,c)*l. % 0.18/0.58 1264[0:MRR:1263.0,56.0] || -> . % 0.18/0.58 % SZS output end Refutation % 0.18/0.58 Formulae used in the proof : c_is_defined less_or_equal_4 b_equals_c_5 not_less_or_equal_6 transitivity_of_order_relation totality_of_order_relation symmetry_of_equality compatibility_of_equality_and_order_relation % 0.18/0.58 %------------------------------------------------------------------------------