TSTP Solution File: KRS010-1 by PyRes---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : KRS010-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n012.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  : 300s
% DateTime : Thu May  9 17:28:27 EDT 2024

% Result   : Unsatisfiable 0.55s 0.74s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   65 (  13 unt;  36 nHn;  65 RR)
%            Number of literals    :  180 (   0 equ;  70 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   25 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_2,negated_conjecture,
    ~ f(exist),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

cnf(clause_1,negated_conjecture,
    e(exist),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_7,axiom,
    ( r3least(X4)
    | ~ e(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

cnf(c0,plain,
    r3least(exist),
    inference(resolution,[status(thm)],[clause_7,clause_1]) ).

cnf(clause_20,axiom,
    ( ~ r3least(X20)
    | ~ equalish(u2r3(X20),u2r1(X20)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_20) ).

cnf(clause_19,axiom,
    ( ~ r3least(X19)
    | ~ equalish(u2r2(X19),u2r1(X19)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_19) ).

cnf(clause_21,axiom,
    ( ~ r3least(X21)
    | ~ equalish(u2r3(X21),u2r2(X21)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_21) ).

cnf(clause_3,axiom,
    ( c(X5)
    | d(X5)
    | ~ a(X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_24,axiom,
    ( r(X13,u2r3(X13))
    | ~ r3least(X13) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_24) ).

cnf(c6,plain,
    r(exist,u2r3(exist)),
    inference(resolution,[status(thm)],[clause_24,c0]) ).

cnf(clause_8,axiom,
    ( a(X16)
    | ~ e(X15)
    | ~ r(X15,X16) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

cnf(c9,plain,
    ( a(u2r3(exist))
    | ~ e(exist) ),
    inference(resolution,[status(thm)],[clause_8,c6]) ).

cnf(c13,plain,
    a(u2r3(exist)),
    inference(resolution,[status(thm)],[c9,clause_1]) ).

cnf(c14,plain,
    ( c(u2r3(exist))
    | d(u2r3(exist)) ),
    inference(resolution,[status(thm)],[c13,clause_3]) ).

cnf(clause_23,axiom,
    ( r(X12,u2r2(X12))
    | ~ r3least(X12) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_23) ).

cnf(c4,plain,
    r(exist,u2r2(exist)),
    inference(resolution,[status(thm)],[clause_23,c0]) ).

cnf(c10,plain,
    ( a(u2r2(exist))
    | ~ e(exist) ),
    inference(resolution,[status(thm)],[clause_8,c4]) ).

cnf(c15,plain,
    a(u2r2(exist)),
    inference(resolution,[status(thm)],[c10,clause_1]) ).

cnf(c16,plain,
    ( c(u2r2(exist))
    | d(u2r2(exist)) ),
    inference(resolution,[status(thm)],[c15,clause_3]) ).

cnf(clause_6,axiom,
    ( equalish(X10,X11)
    | ~ e(X9)
    | ~ r(X9,X10)
    | ~ r(X9,X11)
    | ~ c(X10)
    | ~ c(X11) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

cnf(c5,plain,
    ( equalish(X49,u2r2(exist))
    | ~ e(exist)
    | ~ r(exist,X49)
    | ~ c(X49)
    | ~ c(u2r2(exist)) ),
    inference(resolution,[status(thm)],[c4,clause_6]) ).

cnf(c59,plain,
    ( equalish(X65,u2r2(exist))
    | ~ e(exist)
    | ~ r(exist,X65)
    | ~ c(X65)
    | d(u2r2(exist)) ),
    inference(resolution,[status(thm)],[c5,c16]) ).

cnf(c95,plain,
    ( equalish(u2r3(exist),u2r2(exist))
    | ~ e(exist)
    | ~ c(u2r3(exist))
    | d(u2r2(exist)) ),
    inference(resolution,[status(thm)],[c59,c6]) ).

cnf(c112,plain,
    ( equalish(u2r3(exist),u2r2(exist))
    | ~ e(exist)
    | d(u2r2(exist))
    | d(u2r3(exist)) ),
    inference(resolution,[status(thm)],[c95,c14]) ).

cnf(c171,plain,
    ( equalish(u2r3(exist),u2r2(exist))
    | d(u2r2(exist))
    | d(u2r3(exist)) ),
    inference(resolution,[status(thm)],[c112,clause_1]) ).

cnf(c172,plain,
    ( d(u2r2(exist))
    | d(u2r3(exist))
    | ~ r3least(exist) ),
    inference(resolution,[status(thm)],[c171,clause_21]) ).

cnf(c181,plain,
    ( d(u2r2(exist))
    | d(u2r3(exist)) ),
    inference(resolution,[status(thm)],[c172,c0]) ).

cnf(clause_22,axiom,
    ( r(X8,u2r1(X8))
    | ~ r3least(X8) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_22) ).

cnf(c1,plain,
    r(exist,u2r1(exist)),
    inference(resolution,[status(thm)],[clause_22,c0]) ).

cnf(clause_31,axiom,
    ( f(X43)
    | equalish(X44,X45)
    | ~ r(X43,X44)
    | ~ r(X43,X45)
    | ~ d(X44)
    | ~ d(X45) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_31) ).

cnf(c45,plain,
    ( f(exist)
    | equalish(X60,u2r1(exist))
    | ~ r(exist,X60)
    | ~ d(X60)
    | ~ d(u2r1(exist)) ),
    inference(resolution,[status(thm)],[clause_31,c1]) ).

cnf(c8,plain,
    ( a(u2r1(exist))
    | ~ e(exist) ),
    inference(resolution,[status(thm)],[clause_8,c1]) ).

cnf(c11,plain,
    a(u2r1(exist)),
    inference(resolution,[status(thm)],[c8,clause_1]) ).

cnf(c12,plain,
    ( c(u2r1(exist))
    | d(u2r1(exist)) ),
    inference(resolution,[status(thm)],[c11,clause_3]) ).

cnf(c3,plain,
    ( equalish(X48,u2r1(exist))
    | ~ e(exist)
    | ~ r(exist,X48)
    | ~ c(X48)
    | ~ c(u2r1(exist)) ),
    inference(resolution,[status(thm)],[clause_6,c1]) ).

cnf(c54,plain,
    ( equalish(X64,u2r1(exist))
    | ~ e(exist)
    | ~ r(exist,X64)
    | ~ c(X64)
    | d(u2r1(exist)) ),
    inference(resolution,[status(thm)],[c3,c12]) ).

cnf(c92,plain,
    ( equalish(u2r3(exist),u2r1(exist))
    | ~ e(exist)
    | ~ c(u2r3(exist))
    | d(u2r1(exist)) ),
    inference(resolution,[status(thm)],[c54,c6]) ).

cnf(c109,plain,
    ( equalish(u2r3(exist),u2r1(exist))
    | ~ e(exist)
    | d(u2r1(exist))
    | d(u2r3(exist)) ),
    inference(resolution,[status(thm)],[c92,c14]) ).

cnf(c121,plain,
    ( equalish(u2r3(exist),u2r1(exist))
    | d(u2r1(exist))
    | d(u2r3(exist)) ),
    inference(resolution,[status(thm)],[c109,clause_1]) ).

cnf(c122,plain,
    ( d(u2r1(exist))
    | d(u2r3(exist))
    | ~ r3least(exist) ),
    inference(resolution,[status(thm)],[c121,clause_20]) ).

cnf(c131,plain,
    ( d(u2r1(exist))
    | d(u2r3(exist)) ),
    inference(resolution,[status(thm)],[c122,c0]) ).

cnf(c135,plain,
    ( d(u2r3(exist))
    | f(exist)
    | equalish(X72,u2r1(exist))
    | ~ r(exist,X72)
    | ~ d(X72) ),
    inference(resolution,[status(thm)],[c131,c45]) ).

cnf(c142,plain,
    ( d(u2r3(exist))
    | f(exist)
    | equalish(u2r2(exist),u2r1(exist))
    | ~ d(u2r2(exist)) ),
    inference(resolution,[status(thm)],[c135,c4]) ).

cnf(c434,plain,
    ( d(u2r3(exist))
    | f(exist)
    | equalish(u2r2(exist),u2r1(exist)) ),
    inference(resolution,[status(thm)],[c142,c181]) ).

cnf(c451,plain,
    ( d(u2r3(exist))
    | f(exist)
    | ~ r3least(exist) ),
    inference(resolution,[status(thm)],[c434,clause_19]) ).

cnf(c452,plain,
    ( d(u2r3(exist))
    | f(exist) ),
    inference(resolution,[status(thm)],[c451,c0]) ).

cnf(c461,plain,
    d(u2r3(exist)),
    inference(resolution,[status(thm)],[c452,clause_2]) ).

cnf(c93,plain,
    ( equalish(u2r2(exist),u2r1(exist))
    | ~ e(exist)
    | ~ c(u2r2(exist))
    | d(u2r1(exist)) ),
    inference(resolution,[status(thm)],[c54,c4]) ).

cnf(c47,plain,
    ( f(exist)
    | equalish(X62,u2r2(exist))
    | ~ r(exist,X62)
    | ~ d(X62)
    | ~ d(u2r2(exist)) ),
    inference(resolution,[status(thm)],[clause_31,c4]) ).

cnf(c90,plain,
    ( f(exist)
    | equalish(X70,u2r2(exist))
    | ~ r(exist,X70)
    | ~ d(X70)
    | c(u2r2(exist)) ),
    inference(resolution,[status(thm)],[c47,c16]) ).

cnf(c107,plain,
    ( f(exist)
    | equalish(u2r3(exist),u2r2(exist))
    | ~ d(u2r3(exist))
    | c(u2r2(exist)) ),
    inference(resolution,[status(thm)],[c90,c6]) ).

cnf(c139,plain,
    ( d(u2r1(exist))
    | f(exist)
    | equalish(u2r3(exist),u2r2(exist))
    | c(u2r2(exist)) ),
    inference(resolution,[status(thm)],[c131,c107]) ).

cnf(c387,plain,
    ( d(u2r1(exist))
    | f(exist)
    | c(u2r2(exist))
    | ~ r3least(exist) ),
    inference(resolution,[status(thm)],[c139,clause_21]) ).

cnf(c392,plain,
    ( d(u2r1(exist))
    | f(exist)
    | c(u2r2(exist)) ),
    inference(resolution,[status(thm)],[c387,c0]) ).

cnf(c401,plain,
    ( d(u2r1(exist))
    | c(u2r2(exist)) ),
    inference(resolution,[status(thm)],[c392,clause_2]) ).

cnf(c410,plain,
    ( d(u2r1(exist))
    | equalish(u2r2(exist),u2r1(exist))
    | ~ e(exist) ),
    inference(resolution,[status(thm)],[c401,c93]) ).

cnf(c427,plain,
    ( d(u2r1(exist))
    | equalish(u2r2(exist),u2r1(exist)) ),
    inference(resolution,[status(thm)],[c410,clause_1]) ).

cnf(c431,plain,
    ( d(u2r1(exist))
    | ~ r3least(exist) ),
    inference(resolution,[status(thm)],[c427,clause_19]) ).

cnf(c432,plain,
    d(u2r1(exist)),
    inference(resolution,[status(thm)],[c431,c0]) ).

cnf(c438,plain,
    ( f(exist)
    | equalish(X86,u2r1(exist))
    | ~ r(exist,X86)
    | ~ d(X86) ),
    inference(resolution,[status(thm)],[c432,c45]) ).

cnf(c440,plain,
    ( f(exist)
    | equalish(u2r3(exist),u2r1(exist))
    | ~ d(u2r3(exist)) ),
    inference(resolution,[status(thm)],[c438,c6]) ).

cnf(c480,plain,
    ( f(exist)
    | equalish(u2r3(exist),u2r1(exist)) ),
    inference(resolution,[status(thm)],[c440,c461]) ).

cnf(c486,plain,
    ( f(exist)
    | ~ r3least(exist) ),
    inference(resolution,[status(thm)],[c480,clause_20]) ).

cnf(c487,plain,
    f(exist),
    inference(resolution,[status(thm)],[c486,c0]) ).

cnf(c492,plain,
    $false,
    inference(resolution,[status(thm)],[c487,clause_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : KRS010-1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.14  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.35  % Computer : n012.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu May  9 00:06:08 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.55/0.74  % Version:  1.5
% 0.55/0.74  % SZS status Unsatisfiable
% 0.55/0.74  % SZS output start CNFRefutation
% See solution above
% 0.55/0.74  
% 0.55/0.74  % Initial clauses    : 31
% 0.55/0.74  % Processed clauses  : 154
% 0.55/0.74  % Factors computed   : 11
% 0.55/0.74  % Resolvents computed: 482
% 0.55/0.74  % Tautologies deleted: 2
% 0.55/0.74  % Forward subsumed   : 133
% 0.55/0.74  % Backward subsumed  : 89
% 0.55/0.74  % -------- CPU Time ---------
% 0.55/0.74  % User time          : 0.371 s
% 0.55/0.74  % System time        : 0.017 s
% 0.55/0.74  % Total time         : 0.388 s
%------------------------------------------------------------------------------