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

% Computer : n013.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:41 EDT 2022

% Result   : Theorem 0.46s 0.64s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    9 (   6 unt;   0 nHn;   9 RR)
%            Number of literals    :   13 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    in(skc5,skc6),
    file('SEU172+2.p',unknown),
    [] ).

cnf(8,axiom,
    element(skc6,powerset(skc7)),
    file('SEU172+2.p',unknown),
    [] ).

cnf(14,axiom,
    in(skc5,subset_complement(skc7,skc6)),
    file('SEU172+2.p',unknown),
    [] ).

cnf(123,axiom,
    ( ~ element(u,powerset(v))
    | equal(set_difference(v,u),subset_complement(v,u)) ),
    file('SEU172+2.p',unknown),
    [] ).

cnf(151,axiom,
    ( ~ in(u,v)
    | ~ in(u,w)
    | ~ equal(v,set_difference(x,w)) ),
    file('SEU172+2.p',unknown),
    [] ).

cnf(231,plain,
    equal(set_difference(skc7,skc6),subset_complement(skc7,skc6)),
    inference(res,[status(thm),theory(equality)],[8,123]),
    [iquote('0:Res:8.0,123.0')] ).

cnf(266,plain,
    ( ~ in(skc5,u)
    | ~ equal(set_difference(v,u),subset_complement(skc7,skc6)) ),
    inference(res,[status(thm),theory(equality)],[14,151]),
    [iquote('0:Res:14.0,151.1')] ).

cnf(291,plain,
    ~ equal(set_difference(u,skc6),subset_complement(skc7,skc6)),
    inference(res,[status(thm),theory(equality)],[3,266]),
    [iquote('0:Res:3.0,266.0')] ).

cnf(322,plain,
    $false,
    inference(unc,[status(thm)],[291,231]),
    [iquote('0:UnC:291.0,231.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU172+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n013.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun 19 06:05:14 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.46/0.64  
% 0.46/0.64  SPASS V 3.9 
% 0.46/0.64  SPASS beiseite: Proof found.
% 0.46/0.64  % SZS status Theorem
% 0.46/0.64  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.46/0.64  SPASS derived 112 clauses, backtracked 0 clauses, performed 0 splits and kept 251 clauses.
% 0.46/0.64  SPASS allocated 100372 KBytes.
% 0.46/0.64  SPASS spent	0:00:00.29 on the problem.
% 0.46/0.64  		0:00:00.03 for the input.
% 0.46/0.64  		0:00:00.21 for the FLOTTER CNF translation.
% 0.46/0.64  		0:00:00.00 for inferences.
% 0.46/0.64  		0:00:00.00 for the backtracking.
% 0.46/0.64  		0:00:00.01 for the reduction.
% 0.46/0.64  
% 0.46/0.64  
% 0.46/0.64  Here is a proof with depth 2, length 9 :
% 0.46/0.64  % SZS output start Refutation
% See solution above
% 0.46/0.64  Formulae used in the proof : t54_subset_1 d5_subset_1 d4_xboole_0
% 0.46/0.64  
%------------------------------------------------------------------------------