%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : FLD071-4 : TPTP v8.1.0. Bugfixed v2.1.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n023.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:39 EDT 2022 % Result : Unsatisfiable 0.20s 0.42s % Output : Refutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : FLD071-4 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.11/0.13 % Command : run_spass %d %s % 0.13/0.35 % Computer : n023.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Mon Jun 6 11:05:09 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.42 % 0.20/0.42 SPASS V 3.9 % 0.20/0.42 SPASS beiseite: Proof found. % 0.20/0.42 % SZS status Theorem % 0.20/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.42 SPASS derived 27 clauses, backtracked 0 clauses, performed 0 splits and kept 58 clauses. % 0.20/0.42 SPASS allocated 75650 KBytes. % 0.20/0.42 SPASS spent 0:00:00.06 on the problem. % 0.20/0.42 0:00:00.04 for the input. % 0.20/0.42 0:00:00.00 for the FLOTTER CNF translation. % 0.20/0.42 0:00:00.00 for inferences. % 0.20/0.42 0:00:00.00 for the backtracking. % 0.20/0.42 0:00:00.00 for the reduction. % 0.20/0.42 % 0.20/0.42 % 0.20/0.42 Here is a proof with depth 1, length 7 : % 0.20/0.42 % SZS output start Refutation % 0.20/0.42 4[0:Inp] || -> less_or_equal(additive_identity,a)*r. % 0.20/0.42 5[0:Inp] || -> less_or_equal(additive_identity,b)*r. % 0.20/0.42 6[0:Inp] || -> product(a,b,u__dfg)*. % 0.20/0.42 7[0:Inp] || less_or_equal(additive_identity,u__dfg)*r -> . % 0.20/0.42 32[0:Inp] || less_or_equal(additive_identity,u) less_or_equal(additive_identity,v) product(v,u,w)* -> less_or_equal(additive_identity,w). % 0.20/0.42 34[0:Res:6.0,32.2] || less_or_equal(additive_identity,a)*r less_or_equal(additive_identity,b) -> less_or_equal(additive_identity,u__dfg). % 0.20/0.42 62[0:MRR:34.0,34.1,34.2,4.0,5.0,7.0] || -> . % 0.20/0.42 % SZS output end Refutation % 0.20/0.42 Formulae used in the proof : less_or_equal_4 less_or_equal_5 product_6 not_less_or_equal_7 compatibility_of_order_relation_and_multiplication % 0.20/0.42 %------------------------------------------------------------------------------