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

% Computer : n029.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:23:34 EDT 2022

% Result   : Theorem 0.18s 0.49s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    8 (   5 unt;   0 nHn;   8 RR)
%            Number of literals    :   12 (   0 equ;   5 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    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

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

cnf(6,axiom,
    ~ member(u,null_class),
    file('SET073+1.p',unknown),
    [] ).

cnf(9,axiom,
    equal(unordered_pair(skc4,skc5),null_class),
    file('SET073+1.p',unknown),
    [] ).

cnf(71,axiom,
    ( ~ equal(u,v)
    | ~ member(u,universal_class)
    | member(u,unordered_pair(v,w)) ),
    file('SET073+1.p',unknown),
    [] ).

cnf(96,plain,
    ( ~ equal(skc4,u)
    | member(skc4,unordered_pair(u,v)) ),
    inference(res,[status(thm),theory(equality)],[3,71]),
    [iquote('0:Res:3.0,71.1')] ).

cnf(327,plain,
    ( ~ equal(skc4,skc4)
    | member(skc4,null_class) ),
    inference(spr,[status(thm),theory(equality)],[9,96]),
    [iquote('0:SpR:9.0,96.1')] ).

cnf(330,plain,
    member(skc4,null_class),
    inference(obv,[status(thm),theory(equality)],[327]),
    [iquote('0:Obv:327.0')] ).

cnf(331,plain,
    $false,
    inference(mrr,[status(thm)],[330,6]),
    [iquote('0:MRR:330.0,6.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET073+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.32  % Computer : n029.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Mon Jul 11 09:39:17 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.18/0.49  
% 0.18/0.49  SPASS V 3.9 
% 0.18/0.49  SPASS beiseite: Proof found.
% 0.18/0.49  % SZS status Theorem
% 0.18/0.49  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.49  SPASS derived 213 clauses, backtracked 41 clauses, performed 1 splits and kept 286 clauses.
% 0.18/0.49  SPASS allocated 98312 KBytes.
% 0.18/0.49  SPASS spent	0:00:00.15 on the problem.
% 0.18/0.49  		0:00:00.04 for the input.
% 0.18/0.49  		0:00:00.06 for the FLOTTER CNF translation.
% 0.18/0.49  		0:00:00.00 for inferences.
% 0.18/0.49  		0:00:00.00 for the backtracking.
% 0.18/0.49  		0:00:00.02 for the reduction.
% 0.18/0.49  
% 0.18/0.49  
% 0.18/0.49  Here is a proof with depth 2, length 8 :
% 0.18/0.49  % SZS output start Refutation
% See solution above
% 0.18/0.49  Formulae used in the proof : corollary1_1 null_class_defn unordered_pair_defn
% 0.18/0.49  
%------------------------------------------------------------------------------