TSTP Solution File: SWV003-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV003-1 : TPTP v8.1.0. Released v1.0.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   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Wed Jul 20 21:40:54 EDT 2022

% Result   : Unsatisfiable 0.19s 0.41s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n012.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Wed Jun 15 14:16:09 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.41  
% 0.19/0.41  SPASS V 3.9 
% 0.19/0.41  SPASS beiseite: Proof found.
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.41  SPASS derived 42 clauses, backtracked 17 clauses, performed 1 splits and kept 68 clauses.
% 0.19/0.41  SPASS allocated 63132 KBytes.
% 0.19/0.41  SPASS spent	0:00:00.06 on the problem.
% 0.19/0.41  		0:00:00.04 for the input.
% 0.19/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.41  		0:00:00.00 for inferences.
% 0.19/0.41  		0:00:00.00 for the backtracking.
% 0.19/0.41  		0:00:00.00 for the reduction.
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Here is a proof with depth 3, length 16 :
% 0.19/0.41  % SZS output start Refutation
% 0.19/0.41  2[0:Inp] ||  -> less_than(k,j)*l.
% 0.19/0.41  3[0:Inp] || less_than(k,i)*r -> .
% 0.19/0.41  9[0:Inp] ||  -> less_than(j,i)*r.
% 0.19/0.41  16[0:Inp] || less_than(u,v)* less_than(v,w)* -> less_than(u,w)*.
% 0.19/0.41  17[0:Inp] ||  -> equal(u,v) less_than(v,u)* less_than(u,v)*.
% 0.19/0.41  19[0:Inp] || less_than(u,v)* less_than(v,u)* -> .
% 0.19/0.41  22[0:Res:9.0,19.0] || less_than(i,j)*l -> .
% 0.19/0.41  31[0:Res:2.0,19.0] || less_than(j,k)*r -> .
% 0.19/0.41  36[0:Res:17.0,3.0] ||  -> equal(i,k) less_than(i,k)*l.
% 0.19/0.41  42[1:Spt:36.0] ||  -> equal(i,k)**.
% 0.19/0.41  54[1:Rew:42.0,22.0] || less_than(k,j)*l -> .
% 0.19/0.41  59[1:MRR:54.0,2.0] ||  -> .
% 0.19/0.41  63[1:Spt:59.0,36.0,42.0] || equal(i,k)** -> .
% 0.19/0.41  64[1:Spt:59.0,36.1] ||  -> less_than(i,k)*l.
% 0.19/0.41  69[1:OCh:16.1,16.0,9.0,64.0] ||  -> less_than(j,k)*r.
% 0.19/0.41  71[1:MRR:69.0,31.0] ||  -> .
% 0.19/0.41  % SZS output end Refutation
% 0.19/0.41  Formulae used in the proof : clause_2 clause_3 clause_9 transitivity_of_less_than all_related anti_symmetry_of_less_than
% 0.19/0.41  
%------------------------------------------------------------------------------