%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : SWC001-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n006.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 21:26:02 EDT 2022

% Result   : Unsatisfiable 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   41 (  12 unt;   2 nHn;  40 RR)
%            Number of literals    :   86 (  19 equ;  46 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   19 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_5,negated_conjecture,
    sk2 = sk4 ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3 ).

cnf(co1_7,negated_conjecture,
    duplicatefreeP(sk3) ).

cnf(co1_8,negated_conjecture,
    ( ~ ssItem(A)
    | memberP(sk4,A)
    | ~ memberP(sk3,A) ) ).

cnf(co1_9,negated_conjecture,
    ( ~ ssItem(A)
    | memberP(sk3,A)
    | ~ memberP(sk4,A) ) ).

cnf(co1_10,negated_conjecture,
    ( ssItem(sk5)
    | ~ duplicatefreeP(sk1) ) ).

cnf(co1_11,negated_conjecture,
    ( memberP(sk2,sk5)
    | memberP(sk1,sk5)
    | ~ duplicatefreeP(sk1) ) ).

cnf(co1_12,negated_conjecture,
    ( ~ memberP(sk2,sk5)
    | ~ memberP(sk1,sk5)
    | ~ duplicatefreeP(sk1) ) ).

cnf(refute_0_0,plain,
    X = X,
    introduced(tautology,[refl,[$fot(X)]]) ).

cnf(refute_0_1,plain,
    ( X != X
    | X != Y
    | Y = X ),
    introduced(tautology,[equality,[$cnf( $equal(X,X) ),[0],$fot(Y)]]) ).

cnf(refute_0_2,plain,
    ( X != Y
    | Y = X ),
    inference(resolve,[$cnf( $equal(X,X) )],[refute_0_0,refute_0_1]) ).

cnf(refute_0_3,plain,
    ( sk1 != sk3
    | sk3 = sk1 ),
    inference(subst,[],[refute_0_2:[bind(X,$fot(sk1)),bind(Y,$fot(sk3))]]) ).

cnf(refute_0_4,plain,
    sk3 = sk1,
    inference(resolve,[$cnf( $equal(sk1,sk3) )],[co1_6,refute_0_3]) ).

cnf(refute_0_5,plain,
    ( sk3 != sk1
    | ~ duplicatefreeP(sk3)
    | duplicatefreeP(sk1) ),
    introduced(tautology,[equality,[$cnf( duplicatefreeP(sk3) ),[0],$fot(sk1)]]) ).

cnf(refute_0_6,plain,
    ( ~ duplicatefreeP(sk3)
    | duplicatefreeP(sk1) ),
    inference(resolve,[$cnf( $equal(sk3,sk1) )],[refute_0_4,refute_0_5]) ).

cnf(refute_0_7,plain,
    duplicatefreeP(sk1),
    inference(resolve,[$cnf( duplicatefreeP(sk3) )],[co1_7,refute_0_6]) ).

cnf(refute_0_8,plain,
    ( ~ memberP(sk1,sk5)
    | ~ memberP(sk2,sk5) ),
    inference(resolve,[$cnf( duplicatefreeP(sk1) )],[refute_0_7,co1_12]) ).

cnf(refute_0_9,plain,
    ( sk3 != sk1
    | ~ memberP(sk1,A)
    | memberP(sk3,A) ),
    introduced(tautology,[equality,[$cnf( ~ memberP(sk3,A) ),[0],$fot(sk1)]]) ).

cnf(refute_0_10,plain,
    ( ~ memberP(sk1,A)
    | memberP(sk3,A) ),
    inference(resolve,[$cnf( $equal(sk3,sk1) )],[refute_0_4,refute_0_9]) ).

cnf(refute_0_11,plain,
    ( ~ memberP(sk1,A)
    | ~ ssItem(A)
    | memberP(sk4,A) ),
    inference(resolve,[$cnf( memberP(sk3,A) )],[refute_0_10,co1_8]) ).

cnf(refute_0_12,plain,
    ( sk2 != sk4
    | sk4 = sk2 ),
    inference(subst,[],[refute_0_2:[bind(X,$fot(sk2)),bind(Y,$fot(sk4))]]) ).

cnf(refute_0_13,plain,
    sk4 = sk2,
    inference(resolve,[$cnf( $equal(sk2,sk4) )],[co1_5,refute_0_12]) ).

cnf(refute_0_14,plain,
    ( sk4 != sk2
    | ~ memberP(sk4,A)
    | memberP(sk2,A) ),
    introduced(tautology,[equality,[$cnf( memberP(sk4,A) ),[0],$fot(sk2)]]) ).

cnf(refute_0_15,plain,
    ( ~ memberP(sk4,A)
    | memberP(sk2,A) ),
    inference(resolve,[$cnf( $equal(sk4,sk2) )],[refute_0_13,refute_0_14]) ).

cnf(refute_0_16,plain,
    ( ~ memberP(sk1,A)
    | ~ ssItem(A)
    | memberP(sk2,A) ),
    inference(resolve,[$cnf( memberP(sk4,A) )],[refute_0_11,refute_0_15]) ).

cnf(refute_0_17,plain,
    ( ~ memberP(sk1,sk5)
    | ~ ssItem(sk5)
    | memberP(sk2,sk5) ),
    inference(subst,[],[refute_0_16:[bind(A,$fot(sk5))]]) ).

cnf(refute_0_18,plain,
    ( memberP(sk1,sk5)
    | memberP(sk2,sk5) ),
    inference(resolve,[$cnf( duplicatefreeP(sk1) )],[refute_0_7,co1_11]) ).

cnf(refute_0_19,plain,
    ( sk4 != sk2
    | ~ memberP(sk2,A)
    | memberP(sk4,A) ),
    introduced(tautology,[equality,[$cnf( ~ memberP(sk4,A) ),[0],$fot(sk2)]]) ).

cnf(refute_0_20,plain,
    ( ~ memberP(sk2,A)
    | memberP(sk4,A) ),
    inference(resolve,[$cnf( $equal(sk4,sk2) )],[refute_0_13,refute_0_19]) ).

cnf(refute_0_21,plain,
    ( ~ memberP(sk2,A)
    | ~ ssItem(A)
    | memberP(sk3,A) ),
    inference(resolve,[$cnf( memberP(sk4,A) )],[refute_0_20,co1_9]) ).

cnf(refute_0_22,plain,
    ( sk3 != sk1
    | ~ memberP(sk3,A)
    | memberP(sk1,A) ),
    introduced(tautology,[equality,[$cnf( memberP(sk3,A) ),[0],$fot(sk1)]]) ).

cnf(refute_0_23,plain,
    ( ~ memberP(sk3,A)
    | memberP(sk1,A) ),
    inference(resolve,[$cnf( $equal(sk3,sk1) )],[refute_0_4,refute_0_22]) ).

cnf(refute_0_24,plain,
    ( ~ memberP(sk2,A)
    | ~ ssItem(A)
    | memberP(sk1,A) ),
    inference(resolve,[$cnf( memberP(sk3,A) )],[refute_0_21,refute_0_23]) ).

cnf(refute_0_25,plain,
    ( ~ memberP(sk2,sk5)
    | ~ ssItem(sk5)
    | memberP(sk1,sk5) ),
    inference(subst,[],[refute_0_24:[bind(A,$fot(sk5))]]) ).

cnf(refute_0_26,plain,
    ( ~ ssItem(sk5)
    | memberP(sk1,sk5) ),
    inference(resolve,[$cnf( memberP(sk2,sk5) )],[refute_0_18,refute_0_25]) ).

cnf(refute_0_27,plain,
    ssItem(sk5),
    inference(resolve,[$cnf( duplicatefreeP(sk1) )],[refute_0_7,co1_10]) ).

cnf(refute_0_28,plain,
    memberP(sk1,sk5),
    inference(resolve,[$cnf( ssItem(sk5) )],[refute_0_27,refute_0_26]) ).

cnf(refute_0_29,plain,
    ( ~ ssItem(sk5)
    | memberP(sk2,sk5) ),
    inference(resolve,[$cnf( memberP(sk1,sk5) )],[refute_0_28,refute_0_17]) ).

cnf(refute_0_30,plain,
    memberP(sk2,sk5),
    inference(resolve,[$cnf( ssItem(sk5) )],[refute_0_27,refute_0_29]) ).

cnf(refute_0_31,plain,
    ~ memberP(sk1,sk5),
    inference(resolve,[$cnf( memberP(sk2,sk5) )],[refute_0_30,refute_0_8]) ).

cnf(refute_0_32,plain,
    $false,
    inference(resolve,[$cnf( memberP(sk1,sk5) )],[refute_0_28,refute_0_31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC001-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12  % Command  : metis --show proof --show saturation %s
% 0.12/0.33  % Computer : n006.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 Jun 11 20:41:42 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.19/0.49  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.49  
% 0.19/0.49  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.19/0.49  
%------------------------------------------------------------------------------