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

% Computer : n027.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:56 EDT 2022

% Result   : Theorem 0.18s 0.43s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            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    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    relation(skc6),
    file('SEU200+1.p',unknown),
    [] ).

cnf(24,axiom,
    ( ~ relation(u)
    | relation(relation_rng_restriction(v,u)) ),
    file('SEU200+1.p',unknown),
    [] ).

cnf(27,axiom,
    ~ subset(relation_rng(relation_rng_restriction(skc7,skc6)),relation_rng(skc6)),
    file('SEU200+1.p',unknown),
    [] ).

cnf(29,axiom,
    ( ~ relation(u)
    | subset(relation_rng_restriction(v,u),u) ),
    file('SEU200+1.p',unknown),
    [] ).

cnf(39,axiom,
    ( ~ relation(u)
    | ~ relation(v)
    | ~ subset(v,u)
    | subset(relation_rng(v),relation_rng(u)) ),
    file('SEU200+1.p',unknown),
    [] ).

cnf(44,plain,
    subset(relation_rng_restriction(u,skc6),skc6),
    inference(res,[status(thm),theory(equality)],[1,29]),
    [iquote('0:Res:1.0,29.0')] ).

cnf(45,plain,
    relation(relation_rng_restriction(u,skc6)),
    inference(res,[status(thm),theory(equality)],[1,24]),
    [iquote('0:Res:1.0,24.0')] ).

cnf(49,plain,
    ( ~ relation(relation_rng_restriction(skc7,skc6))
    | ~ relation(skc6)
    | ~ subset(relation_rng_restriction(skc7,skc6),skc6) ),
    inference(res,[status(thm),theory(equality)],[39,27]),
    [iquote('0:Res:39.3,27.0')] ).

cnf(50,plain,
    $false,
    inference(mrr,[status(thm)],[49,45,1,44]),
    [iquote('0:MRR:49.0,49.1,49.2,45.0,1.0,44.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU200+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n027.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 13:50:25 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.18/0.43  
% 0.18/0.43  SPASS V 3.9 
% 0.18/0.43  SPASS beiseite: Proof found.
% 0.18/0.43  % SZS status Theorem
% 0.18/0.43  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.43  SPASS derived 10 clauses, backtracked 0 clauses, performed 0 splits and kept 48 clauses.
% 0.18/0.43  SPASS allocated 97694 KBytes.
% 0.18/0.43  SPASS spent	0:00:00.09 on the problem.
% 0.18/0.43  		0:00:00.04 for the input.
% 0.18/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.43  		0:00:00.00 for inferences.
% 0.18/0.43  		0:00:00.00 for the backtracking.
% 0.18/0.43  		0:00:00.00 for the reduction.
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  Here is a proof with depth 1, length 9 :
% 0.18/0.43  % SZS output start Refutation
% See solution above
% 0.18/0.43  Formulae used in the proof : t118_relat_1 dt_k8_relat_1 t117_relat_1 t25_relat_1
% 0.18/0.43  
%------------------------------------------------------------------------------