TSTP Solution File: MGT044-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT044-1 : TPTP v8.1.0. Released v2.4.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 : Sun Jul 17 22:26:25 EDT 2022
% Result : Unsatisfiable 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : MGT044-1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 : Thu Jun 9 10:50:19 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.43
% 0.20/0.43 SPASS V 3.9
% 0.20/0.43 SPASS beiseite: Proof found.
% 0.20/0.43 % SZS status Theorem
% 0.20/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.43 SPASS derived 30 clauses, backtracked 0 clauses, performed 1 splits and kept 38 clauses.
% 0.20/0.43 SPASS allocated 75638 KBytes.
% 0.20/0.43 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.43 0:00:00.04 for the input.
% 0.20/0.43 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.43 0:00:00.00 for inferences.
% 0.20/0.43 0:00:00.00 for the backtracking.
% 0.20/0.43 0:00:00.00 for the reduction.
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Here is a proof with depth 2, length 14 :
% 0.20/0.43 % SZS output start Refutation
% 0.20/0.43 1[0:Inp] organization(u) || smaller_or_equal(internal_friction(u,v),internal_friction(u,w))* greater(stock_of_knowledge(u,v),stock_of_knowledge(u,w)) -> greater(capability(u,v),capability(u,w)).
% 0.20/0.43 4[0:Inp] organization(u) || greater(age(u,v),age(u,w))* -> greater(stock_of_knowledge(u,v),stock_of_knowledge(u,w)).
% 0.20/0.43 5[0:Inp] organization(u) || -> equal(internal_friction(u,v),internal_friction(u,w))*.
% 0.20/0.43 6[0:Inp] || -> organization(sk1)*.
% 0.20/0.43 7[0:Inp] || -> greater(age(sk1,sk3),age(sk1,sk2))*r.
% 0.20/0.43 8[0:Inp] || greater(capability(sk1,sk3),capability(sk1,sk2))*r -> .
% 0.20/0.43 11[0:Inp] || equal(u,v) -> smaller_or_equal(u,v)*.
% 0.20/0.43 24[0:Res:6.0,5.0] || -> equal(internal_friction(sk1,u),internal_friction(sk1,v))*.
% 0.20/0.43 29[0:Res:7.0,4.1] organization(sk1) || -> greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))*r.
% 0.20/0.43 33[0:Res:1.3,8.0] organization(sk1) || greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2))* -> .
% 0.20/0.43 34[0:MRR:29.0,6.0] || -> greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))*r.
% 0.20/0.43 35[0:MRR:33.0,33.1,6.0,34.0] || smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2))* -> .
% 0.20/0.43 51[0:Res:11.1,35.0] || equal(internal_friction(sk1,sk2),internal_friction(sk1,sk3))** -> .
% 0.20/0.43 52[0:UnC:51.0,24.0] || -> .
% 0.20/0.43 % SZS output end Refutation
% 0.20/0.43 Formulae used in the proof : assumption_5_32 assumption_7_35 assumption_9_36 lemma_3_37 lemma_3_38 lemma_3_39 definition_smaller_or_equal_3
% 0.20/0.43
%------------------------------------------------------------------------------