%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SET046+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n015.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:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    element(u,skf1(u)),
    file('SET046+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( element(u,skc1)
    | element(skf1(u),u) ),
    file('SET046+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ element(u,v)
    | ~ element(v,u)
    | ~ element(v,skc1) ),
    file('SET046+1.p',unknown),
    [] ).

cnf(4,plain,
    ( ~ element(skf1(u),u)
    | ~ element(skf1(u),skc1) ),
    inference(res,[status(thm),theory(equality)],[1,3]),
    [iquote('0:Res:1.0,3.0')] ).

cnf(6,plain,
    ( ~ element(skf1(u),skc1)
    | element(u,skc1) ),
    inference(res,[status(thm),theory(equality)],[2,4]),
    [iquote('0:Res:2.1,4.0')] ).

cnf(7,plain,
    ( element(skc1,skc1)
    | element(skc1,skc1) ),
    inference(res,[status(thm),theory(equality)],[2,6]),
    [iquote('0:Res:2.1,6.0')] ).

cnf(8,plain,
    element(skc1,skc1),
    inference(obv,[status(thm),theory(equality)],[7]),
    [iquote('0:Obv:7.0')] ).

cnf(9,plain,
    ( ~ element(skc1,skc1)
    | ~ element(skc1,skc1) ),
    inference(res,[status(thm),theory(equality)],[8,3]),
    [iquote('0:Res:8.0,3.0')] ).

cnf(10,plain,
    ~ element(skc1,skc1),
    inference(obv,[status(thm),theory(equality)],[9]),
    [iquote('0:Obv:9.0')] ).

cnf(11,plain,
    $false,
    inference(mrr,[status(thm)],[10,8]),
    [iquote('0:MRR:10.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET046+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n015.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 : Sat Jul  9 18:34:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.42  
% 0.18/0.42  SPASS V 3.9 
% 0.18/0.42  SPASS beiseite: Proof found.
% 0.18/0.42  % SZS status Theorem
% 0.18/0.42  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.42  SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 7 clauses.
% 0.18/0.42  SPASS allocated 85055 KBytes.
% 0.18/0.42  SPASS spent	0:00:00.08 on the problem.
% 0.18/0.42  		0:00:00.03 for the input.
% 0.18/0.42  		0:00:00.02 for the FLOTTER CNF translation.
% 0.18/0.42  		0:00:00.00 for inferences.
% 0.18/0.42  		0:00:00.00 for the backtracking.
% 0.18/0.42  		0:00:00.00 for the reduction.
% 0.18/0.42  
% 0.18/0.42  
% 0.18/0.42  Here is a proof with depth 4, length 10 :
% 0.18/0.42  % SZS output start Refutation
% See solution above
% 0.18/0.42  Formulae used in the proof : pel42
% 0.18/0.42  
%------------------------------------------------------------------------------