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

% Computer : n007.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 : Thu Jul 21 12:32:22 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    eq(skc6,skc7),
    file('SYN966+1.p',unknown),
    [] ).

cnf(2,axiom,
    ~ eq(skc7,skc6),
    file('SYN966+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ eq(u,v)
    | ~ a_member_of(w,u)
    | a_member_of(w,v) ),
    file('SYN966+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ eq(u,v)
    | ~ a_member_of(w,v)
    | a_member_of(w,u) ),
    file('SYN966+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( eq(u,v)
    | a_member_of(skf1(v,u),v)
    | a_member_of(skf1(v,u),u) ),
    file('SYN966+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ a_member_of(skf1(u,v),u)
    | ~ a_member_of(skf1(u,v),v)
    | eq(v,u) ),
    file('SYN966+1.p',unknown),
    [] ).

cnf(7,plain,
    ( ~ a_member_of(u,skc7)
    | a_member_of(u,skc6) ),
    inference(res,[status(thm),theory(equality)],[1,4]),
    [iquote('0:Res:1.0,4.0')] ).

cnf(8,plain,
    ( ~ a_member_of(u,skc6)
    | a_member_of(u,skc7) ),
    inference(res,[status(thm),theory(equality)],[1,3]),
    [iquote('0:Res:1.0,3.0')] ).

cnf(11,plain,
    ( eq(u,skc6)
    | a_member_of(skf1(skc6,u),u)
    | a_member_of(skf1(skc6,u),skc7) ),
    inference(res,[status(thm),theory(equality)],[5,8]),
    [iquote('0:Res:5.1,8.0')] ).

cnf(14,plain,
    ( ~ a_member_of(skf1(skc6,u),skc7)
    | ~ a_member_of(skf1(skc6,u),u)
    | eq(u,skc6) ),
    inference(res,[status(thm),theory(equality)],[7,6]),
    [iquote('0:Res:7.1,6.0')] ).

cnf(21,plain,
    ( eq(skc7,skc6)
    | a_member_of(skf1(skc6,skc7),skc7) ),
    inference(fac,[status(thm)],[11]),
    [iquote('0:Fac:11.1,11.2')] ).

cnf(24,plain,
    a_member_of(skf1(skc6,skc7),skc7),
    inference(mrr,[status(thm)],[21,2]),
    [iquote('0:MRR:21.0,2.0')] ).

cnf(33,plain,
    ( ~ a_member_of(skf1(skc6,skc7),skc7)
    | eq(skc7,skc6) ),
    inference(res,[status(thm),theory(equality)],[24,14]),
    [iquote('0:Res:24.0,14.0')] ).

cnf(34,plain,
    $false,
    inference(mrr,[status(thm)],[33,24,2]),
    [iquote('0:MRR:33.0,33.1,24.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN966+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n007.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 19:28:03 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.43  
% 0.19/0.43  SPASS V 3.9 
% 0.19/0.43  SPASS beiseite: Proof found.
% 0.19/0.43  % SZS status Theorem
% 0.19/0.43  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.43  SPASS derived 20 clauses, backtracked 0 clauses, performed 0 splits and kept 16 clauses.
% 0.19/0.43  SPASS allocated 85165 KBytes.
% 0.19/0.43  SPASS spent	0:00:00.08 on the problem.
% 0.19/0.43  		0:00:00.03 for the input.
% 0.19/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.43  		0:00:00.00 for inferences.
% 0.19/0.43  		0:00:00.00 for the backtracking.
% 0.19/0.43  		0:00:00.00 for the reduction.
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Here is a proof with depth 4, length 14 :
% 0.19/0.43  % SZS output start Refutation
% See solution above
% 0.19/0.43  Formulae used in the proof : prove_this
% 0.19/0.43  
%------------------------------------------------------------------------------