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 : n017.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 : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT048+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n017.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 08:12:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 30 clauses, backtracked 0 clauses, performed 1 splits and kept 38 clauses.
% 0.19/0.44 SPASS allocated 97678 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 2, length 14 :
% 0.19/0.44 % SZS output start Refutation
% 0.19/0.44 1[0:Inp] || -> organization(skc3)*.
% 0.19/0.44 2[0:Inp] || -> greater(age(skc3,skc4),age(skc3,skc5))*r.
% 0.19/0.44 4[0:Inp] || equal(u,v) -> smaller_or_equal(u,v)*.
% 0.19/0.44 9[0:Inp] || smaller(capability(skc3,skc4),capability(skc3,skc5))* -> .
% 0.19/0.44 12[0:Inp] organization(u) || -> equal(stock_of_knowledge(u,v),stock_of_knowledge(u,w))*.
% 0.19/0.44 16[0:Inp] organization(u) || greater(age(u,v),age(u,w))* -> greater(internal_friction(u,v),internal_friction(u,w)).
% 0.19/0.44 18[0:Inp] organization(u) || smaller_or_equal(stock_of_knowledge(u,v),stock_of_knowledge(u,w)) greater(internal_friction(u,v),internal_friction(u,w)) -> smaller(capability(u,v),capability(u,w))*.
% 0.19/0.44 24[0:Res:1.0,12.0] || -> equal(stock_of_knowledge(skc3,u),stock_of_knowledge(skc3,v))*.
% 0.19/0.44 27[0:Res:18.3,9.0] organization(skc3) || greater(internal_friction(skc3,skc4),internal_friction(skc3,skc5)) smaller_or_equal(stock_of_knowledge(skc3,skc4),stock_of_knowledge(skc3,skc5))* -> .
% 0.19/0.44 33[0:Res:2.0,16.1] organization(skc3) || -> greater(internal_friction(skc3,skc4),internal_friction(skc3,skc5))*r.
% 0.19/0.44 34[0:MRR:33.0,1.0] || -> greater(internal_friction(skc3,skc4),internal_friction(skc3,skc5))*r.
% 0.19/0.44 35[0:MRR:27.0,27.1,1.0,34.0] || smaller_or_equal(stock_of_knowledge(skc3,skc4),stock_of_knowledge(skc3,skc5))* -> .
% 0.19/0.44 51[0:Res:4.1,35.0] || equal(stock_of_knowledge(skc3,skc5),stock_of_knowledge(skc3,skc4))** -> .
% 0.19/0.44 52[0:UnC:51.0,24.0] || -> .
% 0.19/0.44 % SZS output end Refutation
% 0.19/0.44 Formulae used in the proof : lemma_5 definition_smaller_or_equal assumption_10 assumption_12 assumption_5
% 0.19/0.44
%------------------------------------------------------------------------------