↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% 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 : 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 0.08s 0.38s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : MGT048+1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.02  % Command  : run_spass %d %s
% 0.03/0.29  % Computer : n012.cluster.edu
% 0.03/0.29  % Model    : x86_64 x86_64
% 0.03/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29  % Memory   : 8046.5625MB
% 0.03/0.29  % OS       : Linux 6.8.0-71-generic
% 0.03/0.29  % CPULimit : 300
% 0.03/0.29  % WCLimit  : 300
% 0.03/0.29  % DateTime : Mon Sep  7 13:13:56 UTC 2026
% 0.03/0.30  % CPUTime  : 
% 0.08/0.38  
% 0.08/0.38  SPASS V 3.9 
% 0.08/0.38  SPASS beiseite: Proof found.
% 0.08/0.38  % SZS status Theorem
% 0.08/0.38  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.08/0.38  SPASS derived 30 clauses, backtracked 0 clauses, performed 1 splits and kept 38 clauses.
% 0.08/0.38  SPASS allocated 97678 KBytes.
% 0.08/0.38  SPASS spent	0:00:00.07 on the problem.
% 0.08/0.38  		0:00:00.03 for the input.
% 0.08/0.38  		0:00:00.02 for the FLOTTER CNF translation.
% 0.08/0.38  		0:00:00.00 for inferences.
% 0.08/0.38  		0:00:00.00 for the backtracking.
% 0.08/0.38  		0:00:00.00 for the reduction.
% 0.08/0.38  
% 0.08/0.38  
% 0.08/0.38  Here is a proof with depth 2, length 14 :
% 0.08/0.38  % SZS output start Refutation
% 0.08/0.38  1[0:Inp] ||  -> organization(skc3)*.
% 0.08/0.38  2[0:Inp] ||  -> greater(age(skc3,skc4),age(skc3,skc5))*r.
% 0.08/0.38  4[0:Inp] || equal(u,v) -> smaller_or_equal(u,v)*.
% 0.08/0.38  9[0:Inp] || smaller(capability(skc3,skc4),capability(skc3,skc5))* -> .
% 0.08/0.38  12[0:Inp] organization(u) ||  -> equal(stock_of_knowledge(u,v),stock_of_knowledge(u,w))*.
% 0.08/0.38  16[0:Inp] organization(u) || greater(age(u,v),age(u,w))* -> greater(internal_friction(u,v),internal_friction(u,w)).
% 0.08/0.38  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.08/0.38  24[0:Res:1.0,12.0] ||  -> equal(stock_of_knowledge(skc3,u),stock_of_knowledge(skc3,v))*.
% 0.08/0.38  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.08/0.38  33[0:Res:2.0,16.1] organization(skc3) ||  -> greater(internal_friction(skc3,skc4),internal_friction(skc3,skc5))*r.
% 0.08/0.38  34[0:MRR:33.0,1.0] ||  -> greater(internal_friction(skc3,skc4),internal_friction(skc3,skc5))*r.
% 0.08/0.38  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.08/0.38  51[0:Res:4.1,35.0] || equal(stock_of_knowledge(skc3,skc5),stock_of_knowledge(skc3,skc4))** -> .
% 0.08/0.38  52[0:UnC:51.0,24.0] ||  -> .
% 0.08/0.38  % SZS output end Refutation
% 0.08/0.38  Formulae used in the proof : lemma_5 definition_smaller_or_equal assumption_10 assumption_12 assumption_5
% 0.08/0.38  
%------------------------------------------------------------------------------