%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n028.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:35 EDT 2022

% Result   : Theorem 0.17s 0.42s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.32  % Computer : n028.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Fri Jul  1 16:51:16 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.17/0.42  
% 0.17/0.42  SPASS V 3.9 
% 0.17/0.42  SPASS beiseite: Proof found.
% 0.17/0.42  % SZS status Theorem
% 0.17/0.42  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.17/0.42  SPASS derived 13 clauses, backtracked 0 clauses, performed 0 splits and kept 11 clauses.
% 0.17/0.42  SPASS allocated 97561 KBytes.
% 0.17/0.42  SPASS spent	0:00:00.09 on the problem.
% 0.17/0.42  		0:00:00.04 for the input.
% 0.17/0.42  		0:00:00.03 for the FLOTTER CNF translation.
% 0.17/0.42  		0:00:00.00 for inferences.
% 0.17/0.42  		0:00:00.00 for the backtracking.
% 0.17/0.42  		0:00:00.00 for the reduction.
% 0.17/0.42  
% 0.17/0.42  
% 0.17/0.42  Here is a proof with depth 3, length 12 :
% 0.17/0.42  % SZS output start Refutation
% 0.17/0.42  1[0:Inp] || goal* -> .
% 0.17/0.42  2[0:Inp] ||  -> less(u,skf2(u))*r.
% 0.17/0.42  3[0:Inp] ||  -> less(u,skf3(u))*r.
% 0.17/0.42  4[0:Inp] ||  -> p(u) p(skf2(u))*.
% 0.17/0.42  5[0:Inp] p(u) p(v) || less(u,v)* -> goal*.
% 0.17/0.42  6[0:Inp] || less(u,v)* less(v,w)* -> less(u,w)*.
% 0.17/0.42  7[0:MRR:5.3,1.0] p(u) p(v) || less(v,u)* -> .
% 0.17/0.42  16[0:NCh:6.2,6.1,7.2,2.0] p(skf2(u)) p(v) || less(v,u)* -> .
% 0.17/0.42  17[0:SoR:16.0,4.1] p(u) || less(u,v)* -> p(v)*.
% 0.17/0.42  18[0:MRR:17.2,7.0] p(u) || less(u,v)* -> .
% 0.17/0.42  19[0:Res:3.0,18.1] p(u) ||  -> .
% 0.17/0.42  23[0:MRR:4.1,4.0,19.0] ||  -> .
% 0.17/0.42  % SZS output end Refutation
% 0.17/0.42  Formulae used in the proof : goal_to_be_proved right_to_left serial_less left_to_right transitive_less
% 0.17/0.42  
%------------------------------------------------------------------------------