%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : KRS001-1 : TPTP v8.1.0. Released v2.0.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 : Sun Jul 17 03:18:23 EDT 2022

% Result   : Unsatisfiable 0.12s 0.35s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   29 (  10 unt;   0 nHn;  29 RR)
%            Number of literals    :   53 (   0 equ;  27 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   13 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
    e(exist) ).

cnf(clause_2,axiom,
    ( r2least(X1)
    | ~ c(X1) ) ).

cnf(clause_4,axiom,
    ( ~ r2least(X1)
    | ~ equalish(u1r2(X1),u1r1(X1)) ) ).

cnf(clause_5,axiom,
    ( r(X1,u1r1(X1))
    | ~ r2least(X1) ) ).

cnf(clause_6,axiom,
    ( r(X1,u1r2(X1))
    | ~ r2least(X1) ) ).

cnf(clause_8,axiom,
    ( r1most(X1)
    | ~ d(X1) ) ).

cnf(clause_10,axiom,
    ( equalish(X3,X2)
    | ~ r1most(X1)
    | ~ r(X1,X3)
    | ~ r(X1,X2) ) ).

cnf(clause_14,axiom,
    ( d(X1)
    | ~ e(X1) ) ).

cnf(clause_15,axiom,
    ( c(X1)
    | ~ e(X1) ) ).

cnf(refute_0_0,plain,
    ( ~ equalish(u1r2(exist),u1r1(exist))
    | ~ r2least(exist) ),
    inference(subst,[],[clause_4:[bind(X1,$fot(exist))]]) ).

cnf(refute_0_1,plain,
    ( ~ c(exist)
    | r2least(exist) ),
    inference(subst,[],[clause_2:[bind(X1,$fot(exist))]]) ).

cnf(refute_0_2,plain,
    ( ~ e(exist)
    | c(exist) ),
    inference(subst,[],[clause_15:[bind(X1,$fot(exist))]]) ).

cnf(refute_0_3,plain,
    c(exist),
    inference(resolve,[$cnf( e(exist) )],[clause_1,refute_0_2]) ).

cnf(refute_0_4,plain,
    r2least(exist),
    inference(resolve,[$cnf( c(exist) )],[refute_0_3,refute_0_1]) ).

cnf(refute_0_5,plain,
    ( ~ r2least(exist)
    | r(exist,u1r2(exist)) ),
    inference(subst,[],[clause_6:[bind(X1,$fot(exist))]]) ).

cnf(refute_0_6,plain,
    r(exist,u1r2(exist)),
    inference(resolve,[$cnf( r2least(exist) )],[refute_0_4,refute_0_5]) ).

cnf(refute_0_7,plain,
    ( ~ r2least(exist)
    | r(exist,u1r1(exist)) ),
    inference(subst,[],[clause_5:[bind(X1,$fot(exist))]]) ).

cnf(refute_0_8,plain,
    r(exist,u1r1(exist)),
    inference(resolve,[$cnf( r2least(exist) )],[refute_0_4,refute_0_7]) ).

cnf(refute_0_9,plain,
    ( ~ r(exist,X_24)
    | ~ r(exist,u1r1(exist))
    | ~ r1most(exist)
    | equalish(X_24,u1r1(exist)) ),
    inference(subst,[],[clause_10:[bind(X1,$fot(exist)),bind(X2,$fot(u1r1(exist))),bind(X3,$fot(X_24))]]) ).

cnf(refute_0_10,plain,
    ( ~ r(exist,X_24)
    | ~ r1most(exist)
    | equalish(X_24,u1r1(exist)) ),
    inference(resolve,[$cnf( r(exist,u1r1(exist)) )],[refute_0_8,refute_0_9]) ).

cnf(refute_0_11,plain,
    ( ~ d(exist)
    | r1most(exist) ),
    inference(subst,[],[clause_8:[bind(X1,$fot(exist))]]) ).

cnf(refute_0_12,plain,
    ( ~ e(exist)
    | d(exist) ),
    inference(subst,[],[clause_14:[bind(X1,$fot(exist))]]) ).

cnf(refute_0_13,plain,
    d(exist),
    inference(resolve,[$cnf( e(exist) )],[clause_1,refute_0_12]) ).

cnf(refute_0_14,plain,
    r1most(exist),
    inference(resolve,[$cnf( d(exist) )],[refute_0_13,refute_0_11]) ).

cnf(refute_0_15,plain,
    ( ~ r(exist,X_24)
    | equalish(X_24,u1r1(exist)) ),
    inference(resolve,[$cnf( r1most(exist) )],[refute_0_14,refute_0_10]) ).

cnf(refute_0_16,plain,
    ( ~ r(exist,u1r2(exist))
    | equalish(u1r2(exist),u1r1(exist)) ),
    inference(subst,[],[refute_0_15:[bind(X_24,$fot(u1r2(exist)))]]) ).

cnf(refute_0_17,plain,
    equalish(u1r2(exist),u1r1(exist)),
    inference(resolve,[$cnf( r(exist,u1r2(exist)) )],[refute_0_6,refute_0_16]) ).

cnf(refute_0_18,plain,
    ~ r2least(exist),
    inference(resolve,[$cnf( equalish(u1r2(exist),u1r1(exist)) )],[refute_0_17,refute_0_0]) ).

cnf(refute_0_19,plain,
    $false,
    inference(resolve,[$cnf( r2least(exist) )],[refute_0_4,refute_0_18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KRS001-1 : TPTP v8.1.0. Released v2.0.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 : Tue Jun  7 15:50:50 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.35  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.35  
% 0.12/0.35  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.12/0.36  
%------------------------------------------------------------------------------