%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n014.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:40:53 EDT 2022

% Result   : Unsatisfiable 0.20s 0.43s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : SWV002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n014.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 : Tue Jun 14 14:28:21 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.43  
% 0.20/0.43  SPASS V 3.9 
% 0.20/0.43  SPASS beiseite: Proof found.
% 0.20/0.43  % SZS status Theorem
% 0.20/0.43  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.43  SPASS derived 311 clauses, backtracked 29 clauses, performed 3 splits and kept 169 clauses.
% 0.20/0.43  SPASS allocated 63345 KBytes.
% 0.20/0.43  SPASS spent	0:00:00.08 on the problem.
% 0.20/0.43  		0:00:00.04 for the input.
% 0.20/0.43  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.43  		0:00:00.00 for inferences.
% 0.20/0.43  		0:00:00.00 for the backtracking.
% 0.20/0.43  		0:00:00.02 for the reduction.
% 0.20/0.43  
% 0.20/0.43  
% 0.20/0.43  Here is a proof with depth 2, length 18 :
% 0.20/0.43  % SZS output start Refutation
% 0.20/0.43  5[0:Inp] ||  -> less_than(a(j),a(k))*r.
% 0.20/0.43  6[0:Inp] || less_than(u,j) less_than(a(u),a(k))* -> less_than(u,i).
% 0.20/0.43  9[0:Inp] || less_than(q,i)*l -> .
% 0.20/0.43  10[0:Inp] || less_than(j,q)*r -> .
% 0.20/0.43  11[0:Inp] ||  -> less_than(a(q),a(j))*l.
% 0.20/0.43  18[0:Inp] || less_than(u,v)* less_than(v,w)* -> less_than(u,w)*.
% 0.20/0.43  19[0:Inp] ||  -> equal(u,v) less_than(v,u)* less_than(u,v)*.
% 0.20/0.43  20[0:Inp] || less_than(u,u)* -> .
% 0.20/0.43  33[0:Res:19.0,10.0] ||  -> equal(q,j) less_than(q,j)*l.
% 0.20/0.43  40[0:Res:6.2,9.0] || less_than(q,j) less_than(a(q),a(k))*l -> .
% 0.20/0.43  72[1:Spt:33.0] ||  -> equal(q,j)**.
% 0.20/0.43  73[1:Rew:72.0,11.0] ||  -> less_than(a(j),a(j))*.
% 0.20/0.43  83[1:MRR:73.0,20.0] ||  -> .
% 0.20/0.43  88[1:Spt:83.0,33.0,72.0] || equal(q,j)** -> .
% 0.20/0.43  89[1:Spt:83.0,33.1] ||  -> less_than(q,j)*l.
% 0.20/0.43  90[1:MRR:40.0,89.0] || less_than(a(q),a(k))*l -> .
% 0.20/0.43  358[1:NCh:18.2,18.0,90.0,11.0] || less_than(a(j),a(k))*r -> .
% 0.20/0.43  360[1:MRR:358.0,5.0] ||  -> .
% 0.20/0.43  % SZS output end Refutation
% 0.20/0.43  Formulae used in the proof : clause_5 clause_6 clause_9 clause_10 clause_11 transitivity_of_less_than all_related x_not_less_than_x
% 0.20/0.43  
%------------------------------------------------------------------------------