TSTP Solution File: SWV137+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV137+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 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   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Wed Jul 20 21:41:24 EDT 2022

% Result   : Theorem 0.65s 0.82s
% Output   : Refutation 0.65s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV137+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n013.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 : Wed Jun 15 21:46:59 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.65/0.82  
% 0.65/0.82  SPASS V 3.9 
% 0.65/0.82  SPASS beiseite: Proof found.
% 0.65/0.82  % SZS status Theorem
% 0.65/0.82  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.65/0.82  SPASS derived 2207 clauses, backtracked 20 clauses, performed 3 splits and kept 762 clauses.
% 0.65/0.82  SPASS allocated 87533 KBytes.
% 0.65/0.82  SPASS spent	0:00:00.46 on the problem.
% 0.65/0.82  		0:00:00.04 for the input.
% 0.65/0.82  		0:00:00.08 for the FLOTTER CNF translation.
% 0.65/0.82  		0:00:00.02 for inferences.
% 0.65/0.82  		0:00:00.01 for the backtracking.
% 0.65/0.82  		0:00:00.21 for the reduction.
% 0.65/0.82  
% 0.65/0.82  
% 0.65/0.82  Here is a proof with depth 1, length 8 :
% 0.65/0.82  % SZS output start Refutation
% 0.65/0.82  5[0:Inp] ||  -> leq(n2,pv1325)*r.
% 0.65/0.82  20[0:Inp] ||  -> gt(n2,n0)*l.
% 0.65/0.82  32[0:Inp] || leq(n0,pv1325)*r -> .
% 0.65/0.82  71[0:Inp] || gt(u,v)* -> leq(v,u).
% 0.65/0.82  106[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*.
% 0.65/0.82  789[0:NCh:106.2,106.1,32.0,5.0] || leq(n0,n2)*r -> .
% 0.65/0.82  3265[0:Res:20.0,71.0] ||  -> leq(n0,n2)*r.
% 0.65/0.82  3390[0:MRR:3265.0,789.0] ||  -> .
% 0.65/0.82  % SZS output end Refutation
% 0.65/0.82  Formulae used in the proof : gauss_array_0007 gt_2_0 leq_gt1 transitivity_leq
% 0.65/0.82  
%------------------------------------------------------------------------------