%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : MGT046+1 : TPTP v9.3.0. Released v2.4.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n012.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:55 AM UTC 2026 % Result : Theorem 1.06s 1.37s % Output : Refutation 1.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT046+1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.03 % Command : run_spass %d %s % 0.06/0.33 % Computer : n012.cluster.edu % 0.06/0.33 % Model : x86_64 x86_64 % 0.06/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.06/0.33 % Memory : 8046.5625MB % 0.06/0.33 % OS : Linux 6.8.0-71-generic % 0.06/0.34 % CPULimit : 300 % 0.06/0.34 % WCLimit : 300 % 0.06/0.34 % DateTime : Mon Sep 7 13:09:56 UTC 2026 % 0.06/0.34 % CPUTime : % 1.06/1.37 % 1.06/1.37 SPASS V 3.9 % 1.06/1.37 SPASS beiseite: Proof found. % 1.06/1.37 % SZS status Theorem % 1.06/1.37 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 1.06/1.37 SPASS derived 2079 clauses, backtracked 0 clauses, performed 3 splits and kept 1089 clauses. % 1.06/1.37 SPASS allocated 99575 KBytes. % 1.06/1.37 SPASS spent 0:00:01.01 on the problem. % 1.06/1.37 0:00:00.05 for the input. % 1.06/1.37 0:00:00.04 for the FLOTTER CNF translation. % 1.06/1.37 0:00:00.06 for inferences. % 1.06/1.37 0:00:00.01 for the backtracking. % 1.06/1.37 0:00:00.81 for the reduction. % 1.06/1.37 % 1.06/1.37 % 1.06/1.37 Here is a proof with depth 3, length 32 : % 1.06/1.37 % SZS output start Refutation % 1.06/1.37 1[0:Inp] || -> organization(skc3)*. % 1.06/1.37 2[0:Inp] || has_endowment(skc3)* -> . % 1.06/1.37 3[0:Inp] || -> greater(age(skc3,skc4),age(skc3,skc5))*r. % 1.06/1.37 5[0:Inp] || equal(u,v) -> smaller_or_equal(u,v)*. % 1.06/1.37 6[0:Inp] || greater(u,v) -> greater_or_equal(u,v)*. % 1.06/1.37 10[0:Inp] || smaller(hazard_of_mortality(skc3,skc4),hazard_of_mortality(skc3,skc5))* -> . % 1.06/1.37 12[0:Inp] organization(u) || has_immunity(u,v)* -> has_endowment(u). % 1.06/1.37 14[0:Inp] organization(u) || -> equal(internal_friction(u,v),internal_friction(u,w))*. % 1.06/1.37 18[0:Inp] organization(u) || greater(external_ties(u,v),external_ties(u,w))* -> greater(position(u,v),position(u,w)). % 1.06/1.37 20[0:Inp] organization(u) || greater(age(u,v),age(u,w))* -> greater(stock_of_knowledge(u,v),stock_of_knowledge(u,w)). % 1.06/1.37 21[0:Inp] organization(u) || greater(age(u,v),age(u,w))* -> greater(external_ties(u,v),external_ties(u,w)). % 1.06/1.37 24[0:Inp] organization(u) || greater(stock_of_knowledge(u,v),stock_of_knowledge(u,w)) smaller_or_equal(internal_friction(u,v),internal_friction(u,w))* -> greater(capability(u,v),capability(u,w)). % 1.06/1.37 27[0:Inp] organization(u) || greater(capability(u,v),capability(u,w)) greater_or_equal(position(u,v),position(u,w)) -> has_immunity(u,v) has_immunity(u,w) smaller(hazard_of_mortality(u,v),hazard_of_mortality(u,w))*. % 1.06/1.37 39[0:Res:1.0,12.0] || has_immunity(skc3,u)* -> has_endowment(skc3). % 1.06/1.37 43[0:Res:27.3,10.0] organization(skc3) || greater_or_equal(position(skc3,skc4),position(skc3,skc5))* greater(capability(skc3,skc4),capability(skc3,skc5)) -> has_immunity(skc3,skc5) has_immunity(skc3,skc4). % 1.06/1.37 50[0:Res:3.0,21.1] organization(skc3) || -> greater(external_ties(skc3,skc4),external_ties(skc3,skc5))*r. % 1.06/1.37 51[0:Res:3.0,20.1] organization(skc3) || -> greater(stock_of_knowledge(skc3,skc4),stock_of_knowledge(skc3,skc5))*r. % 1.06/1.37 52[0:MRR:39.1,2.0] || has_immunity(skc3,u)* -> . % 1.06/1.37 53[0:MRR:50.0,1.0] || -> greater(external_ties(skc3,skc4),external_ties(skc3,skc5))*r. % 1.06/1.37 54[0:MRR:51.0,1.0] || -> greater(stock_of_knowledge(skc3,skc4),stock_of_knowledge(skc3,skc5))*r. % 1.06/1.37 57[0:MRR:43.0,43.3,43.4,1.0,52.0,52.0] || greater(capability(skc3,skc4),capability(skc3,skc5)) greater_or_equal(position(skc3,skc4),position(skc3,skc5))* -> . % 1.06/1.37 258[0:Res:6.1,57.1] || greater(position(skc3,skc4),position(skc3,skc5))*r greater(capability(skc3,skc4),capability(skc3,skc5)) -> . % 1.06/1.37 263[0:Res:53.0,18.1] organization(skc3) || -> greater(position(skc3,skc4),position(skc3,skc5))*r. % 1.06/1.37 275[0:SSi:263.0,1.0] || -> greater(position(skc3,skc4),position(skc3,skc5))*r. % 1.06/1.37 277[0:MRR:258.0,275.0] || greater(capability(skc3,skc4),capability(skc3,skc5))*r -> . % 1.06/1.37 347[0:SpL:14.1,24.2] organization(u) organization(u) || greater(stock_of_knowledge(u,v),stock_of_knowledge(u,w))* smaller_or_equal(internal_friction(u,x),internal_friction(u,w))* -> greater(capability(u,v),capability(u,w)). % 1.06/1.37 352[0:Obv:347.0] organization(u) || greater(stock_of_knowledge(u,v),stock_of_knowledge(u,w))*+ smaller_or_equal(internal_friction(u,x),internal_friction(u,w))* -> greater(capability(u,v),capability(u,w)). % 1.06/1.37 2354[0:Res:54.0,352.1] organization(skc3) || smaller_or_equal(internal_friction(skc3,u),internal_friction(skc3,skc5))* -> greater(capability(skc3,skc4),capability(skc3,skc5)). % 1.06/1.37 2388[0:SSi:2354.0,1.0] || smaller_or_equal(internal_friction(skc3,u),internal_friction(skc3,skc5))* -> greater(capability(skc3,skc4),capability(skc3,skc5)). % 1.06/1.37 2389[0:MRR:2388.1,277.0] || smaller_or_equal(internal_friction(skc3,u),internal_friction(skc3,skc5))* -> . % 1.06/1.37 2399[0:Res:5.1,2389.0] || equal(internal_friction(skc3,u),internal_friction(skc3,skc5))* -> . % 1.06/1.37 2400[0:Obv:2399.0] || -> . % 1.06/1.37 % SZS output end Refutation % 1.06/1.37 Formulae used in the proof : theorem_1 definition_smaller_or_equal definition_greater_or_equal assumption_1 assumption_9 assumption_6 assumption_7 assumption_8 assumption_5 assumption_4 % 1.06/1.37 %------------------------------------------------------------------------------