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

% Computer : n024.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:28:44 EDT 2022

% Result   : Theorem 0.47s 0.64s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   15 (   9 unt;   0 nHn;  15 RR)
%            Number of literals    :   23 (   0 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :   10 (  10 usr;  10 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    subset(skc9,skc8),
    file('SET799+4.p',unknown),
    [] ).

cnf(6,axiom,
    least_upper_bound(skc11,skc9,skc6,skc7),
    file('SET799+4.p',unknown),
    [] ).

cnf(7,axiom,
    ~ apply(skc6,skc11,skc10),
    file('SET799+4.p',unknown),
    [] ).

cnf(8,axiom,
    least_upper_bound(skc10,skc8,skc6,skc7),
    file('SET799+4.p',unknown),
    [] ).

cnf(37,axiom,
    ( ~ least_upper_bound(u,v,w,x)
    | member(u,v) ),
    file('SET799+4.p',unknown),
    [] ).

cnf(43,axiom,
    ( ~ least_upper_bound(u,v,w,x)
    | upper_bound(u,w,v) ),
    file('SET799+4.p',unknown),
    [] ).

cnf(45,axiom,
    ( ~ member(u,v)
    | ~ subset(v,w)
    | member(u,w) ),
    file('SET799+4.p',unknown),
    [] ).

cnf(62,axiom,
    ( ~ member(u,v)
    | ~ upper_bound(w,x,v)
    | apply(x,u,w) ),
    file('SET799+4.p',unknown),
    [] ).

cnf(109,plain,
    ( ~ member(u,skc9)
    | member(u,skc8) ),
    inference(res,[status(thm),theory(equality)],[2,45]),
    [iquote('0:Res:2.0,45.0')] ).

cnf(116,plain,
    upper_bound(skc10,skc6,skc8),
    inference(res,[status(thm),theory(equality)],[8,43]),
    [iquote('0:Res:8.0,43.0')] ).

cnf(124,plain,
    ( ~ member(skc11,u)
    | ~ upper_bound(skc10,skc6,u) ),
    inference(res,[status(thm),theory(equality)],[62,7]),
    [iquote('0:Res:62.2,7.0')] ).

cnf(129,plain,
    member(skc11,skc9),
    inference(res,[status(thm),theory(equality)],[6,37]),
    [iquote('0:Res:6.0,37.0')] ).

cnf(139,plain,
    member(skc11,skc8),
    inference(res,[status(thm),theory(equality)],[129,109]),
    [iquote('0:Res:129.0,109.0')] ).

cnf(195,plain,
    ~ member(skc11,skc8),
    inference(res,[status(thm),theory(equality)],[116,124]),
    [iquote('0:Res:116.0,124.1')] ).

cnf(196,plain,
    $false,
    inference(mrr,[status(thm)],[195,139]),
    [iquote('0:MRR:195.0,139.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SET799+4 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n024.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 Jul 11 07:28:13 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.47/0.64  
% 0.47/0.64  SPASS V 3.9 
% 0.47/0.64  SPASS beiseite: Proof found.
% 0.47/0.64  % SZS status Theorem
% 0.47/0.64  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.47/0.64  SPASS derived 99 clauses, backtracked 0 clauses, performed 2 splits and kept 169 clauses.
% 0.47/0.64  SPASS allocated 88316 KBytes.
% 0.47/0.64  SPASS spent	0:00:00.29 on the problem.
% 0.47/0.64  		0:00:00.03 for the input.
% 0.47/0.64  		0:00:00.22 for the FLOTTER CNF translation.
% 0.47/0.64  		0:00:00.00 for inferences.
% 0.47/0.64  		0:00:00.00 for the backtracking.
% 0.47/0.64  		0:00:00.01 for the reduction.
% 0.47/0.64  
% 0.47/0.64  
% 0.47/0.64  Here is a proof with depth 2, length 15 :
% 0.47/0.64  % SZS output start Refutation
% See solution above
% 0.47/0.64  Formulae used in the proof : thIV11 least_upper_bound subset upper_bound
% 0.47/0.64  
%------------------------------------------------------------------------------