%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU127+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n010.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 : Tue Jul 19 14:34:09 EDT 2022

% Result   : Theorem 8.84s 9.01s
% Output   : Refutation 8.84s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SEU127+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n010.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 : Sun Jun 19 13:28:22 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 8.84/9.01  
% 8.84/9.01  SPASS V 3.9 
% 8.84/9.01  SPASS beiseite: Proof found.
% 8.84/9.01  % SZS status Theorem
% 8.84/9.01  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 8.84/9.01  SPASS derived 17935 clauses, backtracked 0 clauses, performed 0 splits and kept 5633 clauses.
% 8.84/9.01  SPASS allocated 110153 KBytes.
% 8.84/9.01  SPASS spent	0:00:08.26 on the problem.
% 8.84/9.01  		0:00:00.04 for the input.
% 8.84/9.01  		0:00:00.05 for the FLOTTER CNF translation.
% 8.84/9.01  		0:00:00.19 for inferences.
% 8.84/9.01  		0:00:00.00 for the backtracking.
% 8.84/9.01  		0:00:07.90 for the reduction.
% 8.84/9.01  
% 8.84/9.01  
% 8.84/9.01  Here is a proof with depth 3, length 11 :
% 8.84/9.01  % SZS output start Refutation
% 8.84/9.01  11[0:Inp] || subset(set_intersection2(skc5,skc4),skc5)*l -> .
% 8.84/9.01  14[0:Inp] ||  -> equal(set_intersection2(u,v),set_intersection2(v,u))*.
% 8.84/9.01  25[0:Inp] ||  -> subset(u,v) in(skf8(v,u),u)*.
% 8.84/9.01  28[0:Inp] || in(skf8(u,v),u)*+ -> subset(w,u)*.
% 8.84/9.01  42[0:Inp] || in(u,v)* equal(v,set_intersection2(w,x))*+ -> in(u,x)*.
% 8.84/9.01  53[0:Rew:14.0,11.0] || subset(set_intersection2(skc4,skc5),skc5)*l -> .
% 8.84/9.01  56[0:Res:28.1,53.0] || in(skf8(skc5,u),skc5)* -> .
% 8.84/9.01  291[0:EqR:42.1] || in(u,set_intersection2(v,w))* -> in(u,w).
% 8.84/9.01  311[0:Res:25.1,291.0] ||  -> subset(set_intersection2(u,v),w) in(skf8(w,set_intersection2(u,v)),v)*.
% 8.84/9.01  21511[0:Res:311.1,56.0] ||  -> subset(set_intersection2(u,skc5),skc5)*l.
% 8.84/9.01  21536[0:UnC:21511.0,53.0] ||  -> .
% 8.84/9.01  % SZS output end Refutation
% 8.84/9.01  Formulae used in the proof : t17_xboole_1 commutativity_k3_xboole_0 d3_tarski d3_xboole_0
% 8.84/9.01  
%------------------------------------------------------------------------------