%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU149+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n004.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:22 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ~ equal(skc6,skc5),
    file('SEU149+3.p',unknown),
    [] ).

cnf(4,axiom,
    equal(unordered_pair(skc6,skc7),singleton(skc5)),
    file('SEU149+3.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ in(u,v)
    | ~ equal(v,singleton(w))
    | equal(u,w) ),
    file('SEU149+3.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ equal(u,v)
    | ~ equal(w,unordered_pair(v,x))
    | in(u,w) ),
    file('SEU149+3.p',unknown),
    [] ).

cnf(27,plain,
    ( ~ in(u,unordered_pair(skc6,skc7))
    | equal(u,skc5) ),
    inference(res,[status(thm),theory(equality)],[4,8]),
    [iquote('0:Res:4.0,8.1')] ).

cnf(32,plain,
    ( ~ equal(u,skc6)
    | in(u,singleton(skc5)) ),
    inference(res,[status(thm),theory(equality)],[4,10]),
    [iquote('0:Res:4.0,10.1')] ).

cnf(35,plain,
    ( ~ in(u,singleton(skc5))
    | equal(u,skc5) ),
    inference(rew,[status(thm),theory(equality)],[4,27]),
    [iquote('0:Rew:4.0,27.0')] ).

cnf(36,plain,
    ~ in(skc6,singleton(skc5)),
    inference(res,[status(thm),theory(equality)],[35,3]),
    [iquote('0:Res:35.1,3.0')] ).

cnf(47,plain,
    ~ equal(skc6,skc6),
    inference(res,[status(thm),theory(equality)],[32,36]),
    [iquote('0:Res:32.1,36.0')] ).

cnf(49,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[47]),
    [iquote('0:Obv:47.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU149+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n004.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 : Mon Jun 20 07:03:23 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  
% 0.20/0.45  SPASS V 3.9 
% 0.20/0.45  SPASS beiseite: Proof found.
% 0.20/0.45  % SZS status Theorem
% 0.20/0.45  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.45  SPASS derived 24 clauses, backtracked 0 clauses, performed 0 splits and kept 32 clauses.
% 0.20/0.45  SPASS allocated 85349 KBytes.
% 0.20/0.45  SPASS spent	0:00:00.10 on the problem.
% 0.20/0.45  		0:00:00.04 for the input.
% 0.20/0.45  		0:00:00.04 for the FLOTTER CNF translation.
% 0.20/0.45  		0:00:00.00 for inferences.
% 0.20/0.45  		0:00:00.00 for the backtracking.
% 0.20/0.45  		0:00:00.00 for the reduction.
% 0.20/0.45  
% 0.20/0.45  
% 0.20/0.45  Here is a proof with depth 3, length 10 :
% 0.20/0.45  % SZS output start Refutation
% See solution above
% 0.20/0.45  Formulae used in the proof : t8_zfmisc_1 d1_tarski antisymmetry_r2_hidden d2_tarski
% 0.20/0.45  
%------------------------------------------------------------------------------