↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : MGT092+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n013.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:20:01 AM UTC 2026

% Result   : Theorem 0.23s 0.56s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT092+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04  % Command  : run_spass %d %s
% 0.10/0.36  % Computer : n013.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep  7 14:23:20 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.23/0.56  
% 0.23/0.56  SPASS V 3.9 
% 0.23/0.56  SPASS beiseite: Proof found.
% 0.23/0.56  % SZS status Theorem
% 0.23/0.56  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.23/0.56  SPASS derived 48 clauses, backtracked 0 clauses, performed 0 splits and kept 92 clauses.
% 0.23/0.56  SPASS allocated 98065 KBytes.
% 0.23/0.56  SPASS spent	0:00:00.17 on the problem.
% 0.23/0.56  		0:00:00.06 for the input.
% 0.23/0.56  		0:00:00.06 for the FLOTTER CNF translation.
% 0.23/0.56  		0:00:00.00 for inferences.
% 0.23/0.56  		0:00:00.00 for the backtracking.
% 0.23/0.56  		0:00:00.01 for the reduction.
% 0.23/0.56  
% 0.23/0.56  
% 0.23/0.56  Here is a proof with depth 2, length 16 :
% 0.23/0.56  % SZS output start Refutation
% 0.23/0.56  8[0:Inp] ||  -> less(v0,v400)*r.
% 0.23/0.56  9[0:Inp] ||  -> less(v400,v800)*r.
% 0.23/0.56  10[0:Inp] ||  -> less(v800,v1200)*r.
% 0.23/0.56  21[0:Inp] || completion_conflict(v400,v800,v0,v1200)* -> .
% 0.23/0.56  24[0:Inp] || less(u,v)* -> leq(u,v).
% 0.23/0.56  40[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*.
% 0.23/0.56  64[0:Inp] || leq(u,v) leq(w,v) less(w,u) leq(x,w) -> completion_conflict(w,u,x,v)*.
% 0.23/0.56  67[0:Res:64.4,21.0] || leq(v0,v400) less(v400,v800) leq(v400,v1200) leq(v800,v1200)*r -> .
% 0.23/0.56  68[0:MRR:67.1,9.0] || leq(v800,v1200)*r leq(v400,v1200) leq(v0,v400) -> .
% 0.23/0.56  106[0:Res:10.0,24.0] ||  -> leq(v800,v1200)*r.
% 0.23/0.56  107[0:Res:9.0,24.0] ||  -> leq(v400,v800)*r.
% 0.23/0.56  108[0:Res:8.0,24.0] ||  -> leq(v0,v400)*r.
% 0.23/0.56  115[0:MRR:68.0,106.0] || leq(v400,v1200)*r leq(v0,v400) -> .
% 0.23/0.56  116[0:MRR:115.1,108.0] || leq(v400,v1200)*r -> .
% 0.23/0.56  117[0:NCh:40.2,40.1,116.0,106.0] || leq(v400,v800)*r -> .
% 0.23/0.56  119[0:MRR:117.0,107.0] ||  -> .
% 0.23/0.56  % SZS output end Refutation
% 0.23/0.56  Formulae used in the proof : ord_v0_v400 ord_v400_v800 ord_v800_v1200 odrl633 less_implies_leq leq_trans sharpness_conflict
% 0.23/0.56  
%------------------------------------------------------------------------------