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

% Computer : n007.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 : Sun Jul 17 22:59:29 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : MSC006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n007.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 : Fri Jul  1 16:02:24 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.40  
% 0.20/0.40  SPASS V 3.9 
% 0.20/0.40  SPASS beiseite: Proof found.
% 0.20/0.40  % SZS status Theorem
% 0.20/0.40  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.40  SPASS derived 47 clauses, backtracked 0 clauses, performed 1 splits and kept 38 clauses.
% 0.20/0.40  SPASS allocated 63113 KBytes.
% 0.20/0.40  SPASS spent	0:00:00.06 on the problem.
% 0.20/0.40  		0:00:00.03 for the input.
% 0.20/0.40  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.40  		0:00:00.00 for inferences.
% 0.20/0.40  		0:00:00.00 for the backtracking.
% 0.20/0.40  		0:00:00.00 for the reduction.
% 0.20/0.40  
% 0.20/0.40  
% 0.20/0.40  Here is a proof with depth 3, length 17 :
% 0.20/0.40  % SZS output start Refutation
% 0.20/0.40  1[0:Inp] || p(u,v)* p(v,w)* -> p(u,w)*.
% 0.20/0.40  2[0:Inp] || q(u,v)* q(v,w)* -> q(u,w)*.
% 0.20/0.40  3[0:Inp] || q(u,v)*+ -> q(v,u).
% 0.20/0.40  4[0:Inp] ||  -> q(u,v) p(u,v)*.
% 0.20/0.40  5[0:Inp] || p(a,b)*l+ -> .
% 0.20/0.40  6[0:Inp] || q(c,d)*l+ -> .
% 0.20/0.40  8[0:Res:3.1,6.0] || q(d,c)*r+ -> .
% 0.20/0.40  9[0:Res:4.1,5.0] ||  -> q(a,b)*l.
% 0.20/0.40  13[0:NCh:1.2,1.0,4.1,5.0] || p(u,b)*+ -> q(a,u)*.
% 0.20/0.40  22[0:Res:9.0,3.0] ||  -> q(b,a)*r.
% 0.20/0.40  28[0:NCh:2.2,2.1,22.0,3.0] || q(u,b)* -> q(a,u)*.
% 0.20/0.40  38[0:Res:4.1,13.0] ||  -> q(u,b)* q(a,u)*.
% 0.20/0.40  42[0:MRR:38.0,28.0] ||  -> q(a,u)*.
% 0.20/0.40  49[0:Res:42.0,3.0] ||  -> q(u,a)*.
% 0.20/0.40  54[0:NCh:2.2,2.1,42.0,3.0] || q(u,a)* -> q(v,u)*.
% 0.20/0.40  56[0:MRR:54.0,49.0] ||  -> q(u,v)*.
% 0.20/0.40  57[0:UnC:56.0,8.0] ||  -> .
% 0.20/0.40  % SZS output end Refutation
% 0.20/0.40  Formulae used in the proof : p_transitivity q_transitivity q_symmetry all_related p_is_not_total prove_q_is_total
% 0.20/0.40  
%------------------------------------------------------------------------------