%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU165+3 : TPTP v8.1.0. Released v3.2.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:36 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(6,axiom,
    ( in(skc6,skc8)
    | in(ordered_pair(skc6,skc7),cartesian_product2(skc8,skc9)) ),
    file('SEU165+3.p',unknown),
    [] ).

cnf(7,axiom,
    ( in(skc7,skc9)
    | in(ordered_pair(skc6,skc7),cartesian_product2(skc8,skc9)) ),
    file('SEU165+3.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ in(ordered_pair(u,v),cartesian_product2(w,x))
    | in(u,w) ),
    file('SEU165+3.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ in(ordered_pair(u,v),cartesian_product2(w,x))
    | in(v,x) ),
    file('SEU165+3.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ in(u,v)
    | ~ in(w,x)
    | in(ordered_pair(u,w),cartesian_product2(v,x)) ),
    file('SEU165+3.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ in(ordered_pair(skc6,skc7),cartesian_product2(skc8,skc9))
    | ~ in(skc6,skc8)
    | ~ in(skc7,skc9) ),
    file('SEU165+3.p',unknown),
    [] ).

cnf(14,plain,
    in(skc7,skc9),
    inference(mrr,[status(thm)],[7,10]),
    [iquote('0:MRR:7.1,10.0')] ).

cnf(15,plain,
    in(skc6,skc8),
    inference(mrr,[status(thm)],[6,9]),
    [iquote('0:MRR:6.1,9.0')] ).

cnf(16,plain,
    $false,
    inference(mrr,[status(thm)],[12,11,15,14]),
    [iquote('0:MRR:12.0,12.1,12.2,11.2,15.0,14.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU165+3 : TPTP v8.1.0. Released v3.2.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 07:43:46 EDT 2022
% 0.12/0.34  % 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/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.42  SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses.
% 0.18/0.42  SPASS allocated 85081 KBytes.
% 0.18/0.42  SPASS spent	0:00:00.08 on the problem.
% 0.18/0.42  		0:00:00.03 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 0, length 9 :
% 0.18/0.42  % SZS output start Refutation
% See solution above
% 0.18/0.42  Formulae used in the proof : t106_zfmisc_1 l55_zfmisc_1
% 0.18/0.42  
%------------------------------------------------------------------------------