%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SET108+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n013.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:24:08 EDT 2022

% Result   : Theorem 0.19s 0.49s
% Output   : Refutation 0.19s
% 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    :   11 (   0 equ;   6 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    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    member(skc7,universal_class),
    file('SET108+1.p',unknown),
    [] ).

cnf(4,axiom,
    member(skc6,universal_class),
    file('SET108+1.p',unknown),
    [] ).

cnf(37,axiom,
    ( ~ equal(u,skc5)
    | equal(ordered_pair(skc7,skc6),skc5) ),
    file('SET108+1.p',unknown),
    [] ).

cnf(79,axiom,
    ( ~ member(u,universal_class)
    | ~ member(v,universal_class)
    | ~ equal(ordered_pair(u,v),skc5) ),
    file('SET108+1.p',unknown),
    [] ).

cnf(94,plain,
    equal(ordered_pair(skc7,skc6),skc5),
    inference(aed,[status(thm),theory(equality)],[37]),
    [iquote('0:AED:37.0')] ).

cnf(164,plain,
    ( ~ member(skc6,universal_class)
    | ~ member(skc7,universal_class) ),
    inference(res,[status(thm),theory(equality)],[94,79]),
    [iquote('0:Res:94.0,79.1')] ).

cnf(183,plain,
    $false,
    inference(mrr,[status(thm)],[164,4,3]),
    [iquote('0:MRR:164.0,164.1,4.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET108+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n013.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul 11 09:37:30 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.49  
% 0.19/0.49  SPASS V 3.9 
% 0.19/0.49  SPASS beiseite: Proof found.
% 0.19/0.49  % SZS status Theorem
% 0.19/0.49  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.49  SPASS derived 78 clauses, backtracked 0 clauses, performed 0 splits and kept 122 clauses.
% 0.19/0.49  SPASS allocated 98386 KBytes.
% 0.19/0.49  SPASS spent	0:00:00.14 on the problem.
% 0.19/0.49  		0:00:00.04 for the input.
% 0.19/0.49  		0:00:00.06 for the FLOTTER CNF translation.
% 0.19/0.49  		0:00:00.00 for inferences.
% 0.19/0.49  		0:00:00.00 for the backtracking.
% 0.19/0.49  		0:00:00.00 for the reduction.
% 0.19/0.49  
% 0.19/0.49  
% 0.19/0.49  Here is a proof with depth 1, length 7 :
% 0.19/0.49  % SZS output start Refutation
% See solution above
% 0.19/0.49  Formulae used in the proof : existence_of_first_and_second infinity
% 0.19/0.49  
%------------------------------------------------------------------------------