%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU134+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 14:34:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(9,axiom,
    ( equal(set_difference(skc4,skc5),empty_set)
    | subset(skc4,skc5) ),
    file('SEU134+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ equal(set_difference(u,v),empty_set)
    | subset(u,v) ),
    file('SEU134+1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ subset(u,v)
    | equal(set_difference(u,v),empty_set) ),
    file('SEU134+1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ equal(set_difference(skc4,skc5),empty_set)
    | ~ subset(skc4,skc5) ),
    file('SEU134+1.p',unknown),
    [] ).

cnf(15,plain,
    equal(set_difference(skc4,skc5),empty_set),
    inference(mrr,[status(thm)],[9,13]),
    [iquote('0:MRR:9.1,13.0')] ).

cnf(16,plain,
    ( ~ equal(empty_set,empty_set)
    | ~ subset(skc4,skc5) ),
    inference(rew,[status(thm),theory(equality)],[15,14]),
    [iquote('0:Rew:15.0,14.0')] ).

cnf(17,plain,
    ~ subset(skc4,skc5),
    inference(obv,[status(thm),theory(equality)],[16]),
    [iquote('0:Obv:16.0')] ).

cnf(19,plain,
    subset(skc4,skc5),
    inference(res,[status(thm),theory(equality)],[15,12]),
    [iquote('0:Res:15.0,12.0')] ).

cnf(20,plain,
    $false,
    inference(mrr,[status(thm)],[19,17]),
    [iquote('0:MRR:19.0,17.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SEU134+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 20 12:14:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.42  
% 0.18/0.42  SPASS V 3.9 
% 0.18/0.42  SPASS beiseite: Proof found.
% 0.18/0.42  % SZS status Theorem
% 0.18/0.42  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.42  SPASS derived 3 clauses, backtracked 0 clauses, performed 0 splits and kept 16 clauses.
% 0.18/0.42  SPASS allocated 97604 KBytes.
% 0.18/0.42  SPASS spent	0:00:00.08 on the problem.
% 0.18/0.42  		0:00:00.04 for the input.
% 0.18/0.42  		0:00:00.02 for the FLOTTER CNF translation.
% 0.18/0.42  		0:00:00.00 for inferences.
% 0.18/0.42  		0:00:00.00 for the backtracking.
% 0.18/0.42  		0:00:00.00 for the reduction.
% 0.18/0.42  
% 0.18/0.42  
% 0.18/0.42  Here is a proof with depth 1, length 9 :
% 0.18/0.42  % SZS output start Refutation
% See solution above
% 0.18/0.42  Formulae used in the proof : t37_xboole_1 l32_xboole_1
% 0.18/0.42  
%------------------------------------------------------------------------------