TSTP Solution File: MGT048-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT048-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:26 EDT 2022
% Result : Unsatisfiable 0.18s 0.40s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT048-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.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 : Thu Jun 9 10:51:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.40
% 0.18/0.40 SPASS V 3.9
% 0.18/0.40 SPASS beiseite: Proof found.
% 0.18/0.40 % SZS status Theorem
% 0.18/0.40 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.40 SPASS derived 30 clauses, backtracked 0 clauses, performed 1 splits and kept 38 clauses.
% 0.18/0.40 SPASS allocated 75638 KBytes.
% 0.18/0.40 SPASS spent 0:00:00.06 on the problem.
% 0.18/0.40 0:00:00.03 for the input.
% 0.18/0.40 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.40 0:00:00.00 for inferences.
% 0.18/0.40 0:00:00.00 for the backtracking.
% 0.18/0.40 0:00:00.00 for the reduction.
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 Here is a proof with depth 2, length 14 :
% 0.18/0.40 % SZS output start Refutation
% 0.18/0.40 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.18/0.40 4[0:Inp] organization(u) || -> equal(stock_of_knowledge(u,v),stock_of_knowledge(u,w))*.
% 0.18/0.40 5[0:Inp] organization(u) || greater(age(u,v),age(u,w))* -> greater(internal_friction(u,v),internal_friction(u,w)).
% 0.18/0.40 6[0:Inp] || -> organization(sk1)*.
% 0.18/0.40 7[0:Inp] || -> greater(age(sk1,sk3),age(sk1,sk2))*r.
% 0.18/0.40 8[0:Inp] || smaller(capability(sk1,sk3),capability(sk1,sk2))* -> .
% 0.18/0.40 11[0:Inp] || equal(u,v) -> smaller_or_equal(u,v)*.
% 0.18/0.40 24[0:Res:6.0,4.0] || -> equal(stock_of_knowledge(sk1,u),stock_of_knowledge(sk1,v))*.
% 0.18/0.40 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.18/0.40 33[0:Res:7.0,5.1] organization(sk1) || -> greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))*r.
% 0.18/0.40 34[0:MRR:33.0,6.0] || -> greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2))*r.
% 0.18/0.40 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.18/0.40 51[0:Res:11.1,35.0] || equal(stock_of_knowledge(sk1,sk2),stock_of_knowledge(sk1,sk3))** -> .
% 0.18/0.40 52[0:UnC:51.0,24.0] || -> .
% 0.18/0.40 % SZS output end Refutation
% 0.18/0.40 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.18/0.40
%------------------------------------------------------------------------------