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

% Computer : n004.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:29:05 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    c_lessequals(v_Z,v_X,tc_set(t_a)),
    file('SET836-1.p',unknown),
    [] ).

cnf(3,axiom,
    c_in(v_x,v_Z,t_a),
    file('SET836-1.p',unknown),
    [] ).

cnf(4,axiom,
    ~ c_in(v_x,v_X,t_a),
    file('SET836-1.p',unknown),
    [] ).

cnf(311,axiom,
    ( ~ c_in(u,v,w)
    | ~ c_lessequals(v,x,tc_set(w))
    | c_in(u,x,w) ),
    file('SET836-1.p',unknown),
    [] ).

cnf(1396,plain,
    ( ~ c_in(u,v_Z,t_a)
    | c_in(u,v_X,t_a) ),
    inference(res,[status(thm),theory(equality)],[2,311]),
    [iquote('0:Res:2.0,311.1')] ).

cnf(1426,plain,
    c_in(v_x,v_X,t_a),
    inference(res,[status(thm),theory(equality)],[3,1396]),
    [iquote('0:Res:3.0,1396.0')] ).

cnf(1444,plain,
    $false,
    inference(mrr,[status(thm)],[1426,4]),
    [iquote('0:MRR:1426.0,4.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET836-1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jul  9 18:21:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.46/0.68  
% 0.46/0.68  SPASS V 3.9 
% 0.46/0.68  SPASS beiseite: Proof found.
% 0.46/0.68  % SZS status Theorem
% 0.46/0.68  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.46/0.68  SPASS derived 68 clauses, backtracked 0 clauses, performed 0 splits and kept 1371 clauses.
% 0.46/0.68  SPASS allocated 77787 KBytes.
% 0.46/0.68  SPASS spent	0:00:00.32 on the problem.
% 0.46/0.68  		0:00:00.09 for the input.
% 0.46/0.68  		0:00:00.00 for the FLOTTER CNF translation.
% 0.46/0.68  		0:00:00.00 for inferences.
% 0.46/0.68  		0:00:00.00 for the backtracking.
% 0.46/0.68  		0:00:00.10 for the reduction.
% 0.46/0.68  
% 0.46/0.68  
% 0.46/0.68  Here is a proof with depth 2, length 7 :
% 0.46/0.68  % SZS output start Refutation
% See solution above
% 0.46/0.68  Formulae used in the proof : cls_conjecture_1 cls_conjecture_2 cls_conjecture_3 cls_Set_OsubsetD_0
% 0.46/0.68  
%------------------------------------------------------------------------------