%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : MGT048-1 : TPTP v9.3.0. Released v2.4.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n031.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:19:56 AM UTC 2026 % Result : Unsatisfiable 0.21s 0.46s % Output : Refutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT048-1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.03 % Command : run_spass %d %s % 0.07/0.34 % Computer : n031.cluster.edu % 0.07/0.34 % Model : x86_64 x86_64 % 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.34 % Memory : 8046.5625MB % 0.07/0.34 % OS : Linux 6.8.0-71-generic % 0.07/0.34 % CPULimit : 300 % 0.07/0.34 % WCLimit : 300 % 0.07/0.34 % DateTime : Mon Sep 7 13:17:56 UTC 2026 % 0.07/0.34 % CPUTime : % 0.21/0.46 % 0.21/0.46 SPASS V 3.9 % 0.21/0.46 SPASS beiseite: Proof found. % 0.21/0.46 % SZS status Theorem % 0.21/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.46 SPASS derived 30 clauses, backtracked 0 clauses, performed 1 splits and kept 38 clauses. % 0.21/0.46 SPASS allocated 75638 KBytes. % 0.21/0.46 SPASS spent 0:00:00.11 on the problem. % 0.21/0.46 0:00:00.06 for the input. % 0.21/0.46 0:00:00.00 for the FLOTTER CNF translation. % 0.21/0.46 0:00:00.00 for inferences. % 0.21/0.46 0:00:00.00 for the backtracking. % 0.21/0.46 0:00:00.00 for the reduction. % 0.21/0.46 % 0.21/0.46 % 0.21/0.46 Here is a proof with depth 2, length 14 : % 0.21/0.46 % SZS output start Refutation % 0.21/0.46 2[0:Inp] organization(u) || greater(internal_friction(u,v),internal_friction(u,w)) smaller_or_equal(stock_of_knowledge(u,v),stock_of_knowledge(u,w)) -> smaller(capability(u,v),capability(u,w))*. % 0.21/0.46 4[0:Inp] organization(u) || -> equal(stock_of_knowledge(u,v),stock_of_knowledge(u,w))*. % 0.21/0.46 5[0:Inp] organization(u) || greater(age(u,v),age(u,w))* -> greater(internal_friction(u,v),internal_friction(u,w)). % 0.21/0.46 6[0:Inp] || -> organization(sk1)*. % 0.21/0.46 7[0:Inp] || -> greater(age(sk1,sk3),age(sk1,sk2))*r. % 0.21/0.46 8[0:Inp] || smaller(capability(sk1,sk3),capability(sk1,sk2))* -> . % 0.21/0.46 11[0:Inp] || equal(u,v) -> smaller_or_equal(u,v)*. % 0.21/0.46 24[0:Res:6.0,4.0] || -> equal(stock_of_knowledge(sk1,u),stock_of_knowledge(sk1,v))*. % 0.21/0.46 27[0:Res:2.3,8.0] organization(sk1) || smaller_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))* greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)) -> . % 0.21/0.46 33[0:Res:7.0,5.1] organization(sk1) || -> greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))*r. % 0.21/0.46 34[0:MRR:33.0,6.0] || -> greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))*r. % 0.21/0.46 35[0:MRR:27.0,27.2,6.0,34.0] || smaller_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))* -> . % 0.21/0.46 51[0:Res:11.1,35.0] || equal(stock_of_knowledge(sk1,sk2),stock_of_knowledge(sk1,sk3))** -> . % 0.21/0.46 52[0:UnC:51.0,24.0] || -> . % 0.21/0.46 % SZS output end Refutation % 0.21/0.46 Formulae used in the proof : assumption_5_33 assumption_10_35 assumption_12_36 lemma_5_37 lemma_5_38 lemma_5_39 definition_smaller_or_equal_3 % 0.21/0.46 %------------------------------------------------------------------------------