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

% Computer : n022.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:16 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause82,axiom,
    ( ~ rearsegP(nil,U)
    | ~ ssList(U)
    | nil = U ) ).

cnf(co1_1,negated_conjecture,
    ssList(sk1) ).

cnf(co1_5,negated_conjecture,
    nil = sk2 ).

cnf(co1_6,negated_conjecture,
    sk2 = sk4 ).

cnf(co1_7,negated_conjecture,
    sk1 = sk3 ).

cnf(co1_8,negated_conjecture,
    rearsegP(sk4,sk3) ).

cnf(co1_9,negated_conjecture,
    nil != 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,
    ( nil != sk2
    | sk2 = nil ),
    inference(subst,[],[refute_0_2:[bind(X,$fot(nil)),bind(Y,$fot(sk2))]]) ).

cnf(refute_0_4,plain,
    sk2 = nil,
    inference(resolve,[$cnf( $equal(nil,sk2) )],[co1_5,refute_0_3]) ).

cnf(refute_0_5,plain,
    ( sk2 != nil
    | sk2 != sk4
    | nil = sk4 ),
    introduced(tautology,[equality,[$cnf( $equal(sk2,sk4) ),[0],$fot(nil)]]) ).

cnf(refute_0_6,plain,
    ( sk2 != sk4
    | nil = sk4 ),
    inference(resolve,[$cnf( $equal(sk2,nil) )],[refute_0_4,refute_0_5]) ).

cnf(refute_0_7,plain,
    nil = sk4,
    inference(resolve,[$cnf( $equal(sk2,sk4) )],[co1_6,refute_0_6]) ).

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

cnf(refute_0_9,plain,
    sk4 = nil,
    inference(resolve,[$cnf( $equal(nil,sk4) )],[refute_0_7,refute_0_8]) ).

cnf(refute_0_10,plain,
    ( sk4 != nil
    | ~ rearsegP(sk4,sk3)
    | rearsegP(nil,sk3) ),
    introduced(tautology,[equality,[$cnf( rearsegP(sk4,sk3) ),[0],$fot(nil)]]) ).

cnf(refute_0_11,plain,
    ( ~ rearsegP(sk4,sk3)
    | rearsegP(nil,sk3) ),
    inference(resolve,[$cnf( $equal(sk4,nil) )],[refute_0_9,refute_0_10]) ).

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

cnf(refute_0_13,plain,
    sk3 = sk1,
    inference(resolve,[$cnf( $equal(sk1,sk3) )],[co1_7,refute_0_12]) ).

cnf(refute_0_14,plain,
    ( sk3 != sk1
    | ~ rearsegP(nil,sk3)
    | rearsegP(nil,sk1) ),
    introduced(tautology,[equality,[$cnf( rearsegP(nil,sk3) ),[1],$fot(sk1)]]) ).

cnf(refute_0_15,plain,
    ( ~ rearsegP(nil,sk3)
    | rearsegP(nil,sk1) ),
    inference(resolve,[$cnf( $equal(sk3,sk1) )],[refute_0_13,refute_0_14]) ).

cnf(refute_0_16,plain,
    ( ~ rearsegP(sk4,sk3)
    | rearsegP(nil,sk1) ),
    inference(resolve,[$cnf( rearsegP(nil,sk3) )],[refute_0_11,refute_0_15]) ).

cnf(refute_0_17,plain,
    rearsegP(nil,sk1),
    inference(resolve,[$cnf( rearsegP(sk4,sk3) )],[co1_8,refute_0_16]) ).

cnf(refute_0_18,plain,
    ( ~ rearsegP(nil,sk1)
    | ~ ssList(sk1)
    | nil = sk1 ),
    inference(subst,[],[clause82:[bind(U,$fot(sk1))]]) ).

cnf(refute_0_19,plain,
    ( ~ ssList(sk1)
    | nil = sk1 ),
    inference(resolve,[$cnf( rearsegP(nil,sk1) )],[refute_0_17,refute_0_18]) ).

cnf(refute_0_20,plain,
    nil = sk1,
    inference(resolve,[$cnf( ssList(sk1) )],[co1_1,refute_0_19]) ).

cnf(refute_0_21,plain,
    $false,
    inference(resolve,[$cnf( $equal(nil,sk1) )],[refute_0_20,co1_9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC044-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : metis --show proof --show saturation %s
% 0.12/0.34  % Computer : n022.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun 12 19:17:33 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.19/0.51  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.51  
% 0.19/0.51  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.19/0.51  
%------------------------------------------------------------------------------