TSTP Solution File: SWC028-1 by Metis---2.4

View Problem - Process Solution

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

% Computer : n017.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:10 EDT 2022

% Result   : Unsatisfiable 0.20s 0.54s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   22
% Syntax   : Number of clauses     :   57 (  15 unt;  11 nHn;  55 RR)
%            Number of literals    :  114 (  65 equ;  54 neg)
%            Maximal clause size   :    4 (   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   :   11 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause8,axiom,
    ssList(nil) ).

cnf(clause82,axiom,
    ( ~ rearsegP(nil,U)
    | ~ ssList(U)
    | nil = U ) ).

cnf(clause115,axiom,
    ( U != V
    | ~ neq(U,V)
    | ~ ssList(V)
    | ~ ssList(U) ) ).

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

cnf(co1_5,negated_conjecture,
    sk2 = sk4 ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3 ).

cnf(co1_7,negated_conjecture,
    ( nil = sk2
    | nil = sk1 ) ).

cnf(co1_10,negated_conjecture,
    ( nil != sk1
    | nil != sk2 ) ).

cnf(co1_11,negated_conjecture,
    ( nil = sk4
    | neq(sk3,nil) ) ).

cnf(co1_14,negated_conjecture,
    ( nil = sk3
    | rearsegP(sk4,sk3) ) ).

cnf(refute_0_0,plain,
    ( V != V
    | ~ neq(V,V)
    | ~ ssList(V) ),
    inference(subst,[],[clause115:[bind(U,$fot(V))]]) ).

cnf(refute_0_1,plain,
    V = V,
    introduced(tautology,[refl,[$fot(V)]]) ).

cnf(refute_0_2,plain,
    ( ~ neq(V,V)
    | ~ ssList(V) ),
    inference(resolve,[$cnf( $equal(V,V) )],[refute_0_1,refute_0_0]) ).

cnf(refute_0_3,plain,
    ( ~ neq(nil,nil)
    | ~ ssList(nil) ),
    inference(subst,[],[refute_0_2:[bind(V,$fot(nil))]]) ).

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

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

cnf(refute_0_6,plain,
    ( X != Y
    | Y = X ),
    inference(resolve,[$cnf( $equal(X,X) )],[refute_0_4,refute_0_5]) ).

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

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

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

cnf(refute_0_10,plain,
    ( nil != sk4
    | nil = sk2 ),
    inference(resolve,[$cnf( $equal(sk4,sk2) )],[refute_0_8,refute_0_9]) ).

cnf(refute_0_11,plain,
    ( nil = sk2
    | neq(sk3,nil) ),
    inference(resolve,[$cnf( $equal(nil,sk4) )],[co1_11,refute_0_10]) ).

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

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

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

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

cnf(refute_0_16,plain,
    ( nil = sk2
    | neq(sk1,nil) ),
    inference(resolve,[$cnf( neq(sk3,nil) )],[refute_0_11,refute_0_15]) ).

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

cnf(refute_0_18,plain,
    ( nil != sk3
    | nil = sk1 ),
    inference(resolve,[$cnf( $equal(sk3,sk1) )],[refute_0_13,refute_0_17]) ).

cnf(refute_0_19,plain,
    ( nil = sk1
    | rearsegP(sk4,sk3) ),
    inference(resolve,[$cnf( $equal(nil,sk3) )],[co1_14,refute_0_18]) ).

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

cnf(refute_0_21,plain,
    ( ~ rearsegP(sk4,sk3)
    | rearsegP(sk2,sk3) ),
    inference(resolve,[$cnf( $equal(sk4,sk2) )],[refute_0_8,refute_0_20]) ).

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

cnf(refute_0_23,plain,
    ( ~ rearsegP(sk2,sk3)
    | rearsegP(sk2,sk1) ),
    inference(resolve,[$cnf( $equal(sk3,sk1) )],[refute_0_13,refute_0_22]) ).

cnf(refute_0_24,plain,
    ( ~ rearsegP(sk4,sk3)
    | rearsegP(sk2,sk1) ),
    inference(resolve,[$cnf( rearsegP(sk2,sk3) )],[refute_0_21,refute_0_23]) ).

cnf(refute_0_25,plain,
    ( nil = sk1
    | rearsegP(sk2,sk1) ),
    inference(resolve,[$cnf( rearsegP(sk4,sk3) )],[refute_0_19,refute_0_24]) ).

cnf(refute_0_26,plain,
    ( nil != sk2
    | sk2 = nil ),
    inference(subst,[],[refute_0_6:[bind(X,$fot(nil)),bind(Y,$fot(sk2))]]) ).

cnf(refute_0_27,plain,
    ( nil = sk1
    | sk2 = nil ),
    inference(resolve,[$cnf( $equal(nil,sk2) )],[co1_7,refute_0_26]) ).

cnf(refute_0_28,plain,
    ( sk2 != nil
    | ~ rearsegP(sk2,sk1)
    | rearsegP(nil,sk1) ),
    introduced(tautology,[equality,[$cnf( rearsegP(sk2,sk1) ),[0],$fot(nil)]]) ).

cnf(refute_0_29,plain,
    ( ~ rearsegP(sk2,sk1)
    | nil = sk1
    | rearsegP(nil,sk1) ),
    inference(resolve,[$cnf( $equal(sk2,nil) )],[refute_0_27,refute_0_28]) ).

cnf(refute_0_30,plain,
    ( nil = sk1
    | rearsegP(nil,sk1) ),
    inference(resolve,[$cnf( rearsegP(sk2,sk1) )],[refute_0_25,refute_0_29]) ).

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

cnf(refute_0_32,plain,
    ( ~ ssList(sk1)
    | nil = sk1 ),
    inference(resolve,[$cnf( rearsegP(nil,sk1) )],[refute_0_30,refute_0_31]) ).

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

cnf(refute_0_34,plain,
    ( nil != sk1
    | sk1 = nil ),
    inference(subst,[],[refute_0_6:[bind(X,$fot(nil)),bind(Y,$fot(sk1))]]) ).

cnf(refute_0_35,plain,
    sk1 = nil,
    inference(resolve,[$cnf( $equal(nil,sk1) )],[refute_0_33,refute_0_34]) ).

cnf(refute_0_36,plain,
    ( sk1 != nil
    | ~ neq(sk1,nil)
    | neq(nil,nil) ),
    introduced(tautology,[equality,[$cnf( neq(sk1,nil) ),[0],$fot(nil)]]) ).

cnf(refute_0_37,plain,
    ( ~ neq(sk1,nil)
    | neq(nil,nil) ),
    inference(resolve,[$cnf( $equal(sk1,nil) )],[refute_0_35,refute_0_36]) ).

cnf(refute_0_38,plain,
    ( nil = sk2
    | neq(nil,nil) ),
    inference(resolve,[$cnf( neq(sk1,nil) )],[refute_0_16,refute_0_37]) ).

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

cnf(refute_0_40,plain,
    ( nil != nil
    | nil = sk1 ),
    inference(resolve,[$cnf( $equal(sk1,nil) )],[refute_0_35,refute_0_39]) ).

cnf(refute_0_41,plain,
    ( nil != nil
    | nil != sk2 ),
    inference(resolve,[$cnf( $equal(nil,sk1) )],[refute_0_40,co1_10]) ).

cnf(refute_0_42,plain,
    nil = nil,
    introduced(tautology,[refl,[$fot(nil)]]) ).

cnf(refute_0_43,plain,
    nil != sk2,
    inference(resolve,[$cnf( $equal(nil,nil) )],[refute_0_42,refute_0_41]) ).

cnf(refute_0_44,plain,
    neq(nil,nil),
    inference(resolve,[$cnf( $equal(nil,sk2) )],[refute_0_38,refute_0_43]) ).

cnf(refute_0_45,plain,
    ~ ssList(nil),
    inference(resolve,[$cnf( neq(nil,nil) )],[refute_0_44,refute_0_3]) ).

cnf(refute_0_46,plain,
    $false,
    inference(resolve,[$cnf( ssList(nil) )],[clause8,refute_0_45]) ).

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