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

% Computer : n017.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 05:27:54 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ilf_type(skc2,binary_relation_type),
    file('SET658+3.p',unknown),
    [] ).

cnf(3,axiom,
    ilf_type(u,set_type),
    file('SET658+3.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ ilf_type(u,set_type)
    | subset(u,u) ),
    file('SET658+3.p',unknown),
    [] ).

cnf(13,axiom,
    ~ ilf_type(skc2,relation_type(domain_of(skc2),range_of(skc2))),
    file('SET658+3.p',unknown),
    [] ).

cnf(38,axiom,
    ( ~ ilf_type(u,set_type)
    | ~ ilf_type(v,binary_relation_type)
    | ~ subset(domain_of(v),u)
    | ilf_type(v,relation_type(u,range_of(v))) ),
    file('SET658+3.p',unknown),
    [] ).

cnf(53,plain,
    subset(u,u),
    inference(mrr,[status(thm)],[12,3]),
    [iquote('0:MRR:12.0,3.0')] ).

cnf(73,plain,
    ( ~ ilf_type(u,binary_relation_type)
    | ~ subset(domain_of(u),v)
    | ilf_type(u,relation_type(v,range_of(u))) ),
    inference(mrr,[status(thm)],[38,3]),
    [iquote('0:MRR:38.0,3.0')] ).

cnf(96,plain,
    ( ~ ilf_type(skc2,binary_relation_type)
    | ~ subset(domain_of(skc2),domain_of(skc2)) ),
    inference(res,[status(thm),theory(equality)],[73,13]),
    [iquote('0:Res:73.2,13.0')] ).

cnf(98,plain,
    $false,
    inference(mrr,[status(thm)],[96,1,53]),
    [iquote('0:MRR:96.0,96.1,1.0,53.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET658+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n017.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 : Sat Jul  9 20:17:32 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  
% 0.19/0.46  SPASS V 3.9 
% 0.19/0.46  SPASS beiseite: Proof found.
% 0.19/0.46  % SZS status Theorem
% 0.19/0.46  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.46  SPASS derived 9 clauses, backtracked 0 clauses, performed 0 splits and kept 45 clauses.
% 0.19/0.46  SPASS allocated 97823 KBytes.
% 0.19/0.46  SPASS spent	0:00:00.11 on the problem.
% 0.19/0.46  		0:00:00.04 for the input.
% 0.19/0.46  		0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.46  		0:00:00.00 for inferences.
% 0.19/0.46  		0:00:00.00 for the backtracking.
% 0.19/0.46  		0:00:00.00 for the reduction.
% 0.19/0.46  
% 0.19/0.46  
% 0.19/0.46  Here is a proof with depth 1, length 9 :
% 0.19/0.46  % SZS output start Refutation
% See solution above
% 0.19/0.46  Formulae used in the proof : prove_relset_1_20 p28 p15 p1
% 0.19/0.46  
%------------------------------------------------------------------------------