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

% Computer : n015.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:36:48 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(621,axiom,
    equal(powerset(u),k1_pcomps_1(u)),
    file('SEU382+2.p',unknown),
    [] ).

cnf(639,axiom,
    equal(the_carrier(incl_POSet(u)),u),
    file('SEU382+2.p',unknown),
    [] ).

cnf(746,axiom,
    equal(incl_POSet(powerset(u)),boole_POSet(u)),
    file('SEU382+2.p',unknown),
    [] ).

cnf(753,axiom,
    ~ equal(the_carrier(boole_POSet(skc54)),powerset(skc54)),
    file('SEU382+2.p',unknown),
    [] ).

cnf(2518,plain,
    equal(incl_POSet(k1_pcomps_1(u)),boole_POSet(u)),
    inference(rew,[status(thm),theory(equality)],[621,746]),
    [iquote('0:Rew:621.0,746.0')] ).

cnf(2554,plain,
    ~ equal(the_carrier(boole_POSet(skc54)),k1_pcomps_1(skc54)),
    inference(rew,[status(thm),theory(equality)],[621,753]),
    [iquote('0:Rew:621.0,753.0')] ).

cnf(3293,plain,
    equal(the_carrier(boole_POSet(u)),k1_pcomps_1(u)),
    inference(spr,[status(thm),theory(equality)],[2518,639]),
    [iquote('0:SpR:2518.0,639.0')] ).

cnf(3304,plain,
    $false,
    inference(unc,[status(thm)],[3293,2554]),
    [iquote('0:UnC:3293.0,2554.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SEU382+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n015.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Mon Jun 20 08:33:00 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 186.35/186.55  
% 186.35/186.55  SPASS V 3.9 
% 186.35/186.55  SPASS beiseite: Proof found.
% 186.35/186.55  % SZS status Theorem
% 186.35/186.55  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 186.35/186.55  SPASS derived 151 clauses, backtracked 0 clauses, performed 5 splits and kept 2310 clauses.
% 186.35/186.55  SPASS allocated 201724 KBytes.
% 186.35/186.55  SPASS spent	0:03:06.07 on the problem.
% 186.35/186.55  		0:00:00.05 for the input.
% 186.35/186.55  		0:03:03.95 for the FLOTTER CNF translation.
% 186.35/186.55  		0:00:00.01 for inferences.
% 186.35/186.55  		0:00:00.01 for the backtracking.
% 186.35/186.55  		0:00:01.32 for the reduction.
% 186.35/186.55  
% 186.35/186.55  
% 186.35/186.55  Here is a proof with depth 1, length 8 :
% 186.35/186.55  % SZS output start Refutation
% See solution above
% 186.35/186.55  Formulae used in the proof : redefinition_k1_pcomps_1 t1_yellow_1 t4_yellow_1 t4_waybel_7
% 186.35/186.55  
%------------------------------------------------------------------------------