%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : LAT385+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n009.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 : Sun Jul 17 06:51:49 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(7,axiom,
    aSet0(xP),
    file('LAT385+4.p',unknown),
    [] ).

cnf(16,axiom,
    ~ aInfimumOfIn0(u,xP,xU),
    file('LAT385+4.p',unknown),
    [] ).

cnf(18,axiom,
    ~ aElementOf0(skf38(u),xU),
    file('LAT385+4.p',unknown),
    [] ).

cnf(29,axiom,
    ( ~ aElementOf0(u,xP)
    | aElementOf0(u,xU) ),
    file('LAT385+4.p',unknown),
    [] ).

cnf(31,axiom,
    ( ~ skP0(u)
    | aInfimumOfIn0(skf34(u),u,xU) ),
    file('LAT385+4.p',unknown),
    [] ).

cnf(40,axiom,
    ( ~ aSet0(u)
    | skP0(u)
    | aElementOf0(skf38(u),u) ),
    file('LAT385+4.p',unknown),
    [] ).

cnf(152,plain,
    ~ skP0(xP),
    inference(res,[status(thm),theory(equality)],[31,16]),
    [iquote('0:Res:31.1,16.0')] ).

cnf(215,plain,
    ( ~ aSet0(xP)
    | skP0(xP)
    | aElementOf0(skf38(xP),xU) ),
    inference(res,[status(thm),theory(equality)],[40,29]),
    [iquote('0:Res:40.2,29.0')] ).

cnf(222,plain,
    ( skP0(xP)
    | aElementOf0(skf38(xP),xU) ),
    inference(ssi,[status(thm)],[215,7]),
    [iquote('0:SSi:215.0,7.0')] ).

cnf(223,plain,
    $false,
    inference(mrr,[status(thm)],[222,152,18]),
    [iquote('0:MRR:222.0,222.1,152.0,18.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LAT385+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n009.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.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Wed Jun 29 17:32:22 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.51  
% 0.19/0.51  SPASS V 3.9 
% 0.19/0.51  SPASS beiseite: Proof found.
% 0.19/0.51  % SZS status Theorem
% 0.19/0.51  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.51  SPASS derived 53 clauses, backtracked 0 clauses, performed 1 splits and kept 133 clauses.
% 0.19/0.51  SPASS allocated 98654 KBytes.
% 0.19/0.51  SPASS spent	0:00:00.16 on the problem.
% 0.19/0.51  		0:00:00.04 for the input.
% 0.19/0.51  		0:00:00.09 for the FLOTTER CNF translation.
% 0.19/0.51  		0:00:00.00 for inferences.
% 0.19/0.51  		0:00:00.00 for the backtracking.
% 0.19/0.51  		0:00:00.01 for the reduction.
% 0.19/0.51  
% 0.19/0.51  
% 0.19/0.51  Here is a proof with depth 1, length 10 :
% 0.19/0.51  % SZS output start Refutation
% See solution above
% 0.19/0.51  Formulae used in the proof : m__1244 m__ m__1123
% 0.19/0.51  
%------------------------------------------------------------------------------