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

% Computer : n018.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:08 EDT 2022

% Result   : Theorem 0.19s 0.45s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SEU126+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.32  % Computer : n018.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 : Mon Jun 20 10:32:35 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.19/0.45  
% 0.19/0.45  SPASS V 3.9 
% 0.19/0.45  SPASS beiseite: Proof found.
% 0.19/0.45  % SZS status Theorem
% 0.19/0.45  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.45  SPASS derived 12 clauses, backtracked 0 clauses, performed 0 splits and kept 54 clauses.
% 0.19/0.45  SPASS allocated 98251 KBytes.
% 0.19/0.45  SPASS spent	0:00:00.12 on the problem.
% 0.19/0.45  		0:00:00.04 for the input.
% 0.19/0.45  		0:00:00.05 for the FLOTTER CNF translation.
% 0.19/0.45  		0:00:00.00 for inferences.
% 0.19/0.45  		0:00:00.00 for the backtracking.
% 0.19/0.45  		0:00:00.00 for the reduction.
% 0.19/0.45  
% 0.19/0.45  
% 0.19/0.45  Here is a proof with depth 1, length 14 :
% 0.19/0.45  % SZS output start Refutation
% 0.19/0.45  3[0:Inp] ||  -> subset(skc4,skc5)*r.
% 0.19/0.45  11[0:Inp] || equal(set_union2(skc4,skc5),skc5)** -> .
% 0.19/0.45  35[0:Inp] || in(u,v)* subset(v,w)* -> in(u,w)*.
% 0.19/0.45  47[0:Inp] || in(skf7(u,v,w),w)* in(skf7(u,v,w),v)* -> equal(w,set_union2(v,u)).
% 0.19/0.45  48[0:Inp] || in(skf7(u,v,w),w)* in(skf7(u,v,w),u)* -> equal(w,set_union2(v,u)).
% 0.19/0.45  49[0:Inp] ||  -> equal(u,set_union2(v,w)) in(skf7(w,v,u),w)* in(skf7(w,v,u),v)* in(skf7(w,v,u),u)*.
% 0.19/0.45  56[0:Res:49.3,11.0] ||  -> in(skf7(skc5,skc4,skc5),skc5)* in(skf7(skc5,skc4,skc5),skc4) in(skf7(skc5,skc4,skc5),skc5)*.
% 0.19/0.45  57[0:Res:47.2,11.0] || in(skf7(skc5,skc4,skc5),skc4) in(skf7(skc5,skc4,skc5),skc5)* -> .
% 0.19/0.45  58[0:Res:48.2,11.0] || in(skf7(skc5,skc4,skc5),skc5)* in(skf7(skc5,skc4,skc5),skc5)* -> .
% 0.19/0.45  62[0:Res:3.0,35.0] || in(u,skc4) -> in(u,skc5)*.
% 0.19/0.45  64[0:MRR:57.1,62.1] || in(skf7(skc5,skc4,skc5),skc4)* -> .
% 0.19/0.45  65[0:Obv:58.0] || in(skf7(skc5,skc4,skc5),skc5)* -> .
% 0.19/0.45  66[0:Obv:56.0] ||  -> in(skf7(skc5,skc4,skc5),skc4) in(skf7(skc5,skc4,skc5),skc5)*.
% 0.19/0.45  67[0:MRR:66.0,66.1,64.0,65.0] ||  -> .
% 0.19/0.45  % SZS output end Refutation
% 0.19/0.45  Formulae used in the proof : t12_xboole_1 d3_tarski d2_xboole_0
% 0.19/0.45  
%------------------------------------------------------------------------------