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

% Computer : n032.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:35:30 EDT 2022

% Result   : Theorem 0.16s 0.37s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    7 (   4 unt;   0 nHn;   7 RR)
%            Number of literals    :   10 (   0 equ;   5 neg)
%            Maximal clause size   :    2 (   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,
    relation(skc2),
    file('SEU247+1.p',unknown),
    [] ).

cnf(7,axiom,
    ~ equal(relation_rng_restriction(skc3,relation_dom_restriction(skc2,skc3)),relation_restriction(skc2,skc3)),
    file('SEU247+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ relation(u)
    | equal(relation_dom_restriction(relation_rng_restriction(v,u),v),relation_restriction(u,v)) ),
    file('SEU247+1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ relation(u)
    | equal(relation_dom_restriction(relation_rng_restriction(v,u),w),relation_rng_restriction(v,relation_dom_restriction(u,w))) ),
    file('SEU247+1.p',unknown),
    [] ).

cnf(11,plain,
    ( ~ relation(u)
    | equal(relation_rng_restriction(v,relation_dom_restriction(u,v)),relation_restriction(u,v)) ),
    inference(rew,[status(thm),theory(equality)],[10,9]),
    [iquote('0:Rew:10.1,9.1')] ).

cnf(18,plain,
    ~ relation(skc2),
    inference(res,[status(thm),theory(equality)],[11,7]),
    [iquote('0:Res:11.1,7.0')] ).

cnf(19,plain,
    $false,
    inference(mrr,[status(thm)],[18,1]),
    [iquote('0:MRR:18.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SEU247+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.10  % Command  : run_spass %d %s
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Sun Jun 19 18:15:48 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.16/0.37  
% 0.16/0.37  SPASS V 3.9 
% 0.16/0.37  SPASS beiseite: Proof found.
% 0.16/0.37  % SZS status Theorem
% 0.16/0.37  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.16/0.37  SPASS derived 8 clauses, backtracked 0 clauses, performed 0 splits and kept 12 clauses.
% 0.16/0.37  SPASS allocated 97588 KBytes.
% 0.16/0.37  SPASS spent	0:00:00.06 on the problem.
% 0.16/0.37  		0:00:00.03 for the input.
% 0.16/0.37  		0:00:00.02 for the FLOTTER CNF translation.
% 0.16/0.37  		0:00:00.00 for inferences.
% 0.16/0.37  		0:00:00.00 for the backtracking.
% 0.16/0.37  		0:00:00.00 for the reduction.
% 0.16/0.37  
% 0.16/0.37  
% 0.16/0.37  Here is a proof with depth 1, length 7 :
% 0.16/0.37  % SZS output start Refutation
% See solution above
% 0.16/0.37  Formulae used in the proof : t18_wellord1 t17_wellord1 t140_relat_1
% 0.16/0.37  
%------------------------------------------------------------------------------