↑ Up

PyRes---1.5.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : KRS002-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n023.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:26 EDT 2024

% Result   : Unsatisfiable 0.42s 0.60s
% Output   : Refutation 0.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   24 (  11 unt;   0 nHn;  24 RR)
%            Number of literals    :   42 (   0 equ;  20 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   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   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_2,axiom,
    ( s2least(X2)
    | ~ c(X2) ),
    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_14,axiom,
    ( r(X11,u4r2(X11))
    | ~ e(X11) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_14) ).

cnf(c2,plain,
    r(exist,u4r2(exist)),
    inference(resolution,[status(thm)],[clause_14,clause_1]) ).

cnf(clause_16,axiom,
    ( c(X24)
    | ~ e(X25)
    | ~ r(X25,X24) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).

cnf(c16,plain,
    ( c(u4r2(exist))
    | ~ e(exist) ),
    inference(resolution,[status(thm)],[clause_16,c2]) ).

cnf(c20,plain,
    c(u4r2(exist)),
    inference(resolution,[status(thm)],[c16,clause_1]) ).

cnf(c21,plain,
    s2least(u4r2(exist)),
    inference(resolution,[status(thm)],[c20,clause_2]) ).

cnf(clause_4,axiom,
    ( ~ s2least(X6)
    | ~ equalish(u1r2(X6),u1r1(X6)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_8,axiom,
    ( s1most(X4)
    | ~ d(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

cnf(clause_15,axiom,
    ( d(X22)
    | ~ e(X23)
    | ~ r(X23,X22) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).

cnf(c15,plain,
    ( d(u4r2(exist))
    | ~ e(exist) ),
    inference(resolution,[status(thm)],[clause_15,c2]) ).

cnf(c17,plain,
    d(u4r2(exist)),
    inference(resolution,[status(thm)],[c15,clause_1]) ).

cnf(c18,plain,
    s1most(u4r2(exist)),
    inference(resolution,[status(thm)],[c17,clause_8]) ).

cnf(clause_6,axiom,
    ( s(X8,u1r2(X8))
    | ~ s2least(X8) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

cnf(c23,plain,
    s(u4r2(exist),u1r2(u4r2(exist))),
    inference(resolution,[status(thm)],[c21,clause_6]) ).

cnf(clause_10,axiom,
    ( equalish(X19,X20)
    | ~ s1most(X21)
    | ~ s(X21,X19)
    | ~ s(X21,X20) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).

cnf(clause_5,axiom,
    ( s(X7,u1r1(X7))
    | ~ s2least(X7) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

cnf(c24,plain,
    s(u4r2(exist),u1r1(u4r2(exist))),
    inference(resolution,[status(thm)],[c21,clause_5]) ).

cnf(c41,plain,
    ( equalish(X139,u1r1(u4r2(exist)))
    | ~ s1most(u4r2(exist))
    | ~ s(u4r2(exist),X139) ),
    inference(resolution,[status(thm)],[c24,clause_10]) ).

cnf(c158,plain,
    ( equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist)))
    | ~ s1most(u4r2(exist)) ),
    inference(resolution,[status(thm)],[c41,c23]) ).

cnf(c176,plain,
    equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))),
    inference(resolution,[status(thm)],[c158,c18]) ).

cnf(c180,plain,
    ~ s2least(u4r2(exist)),
    inference(resolution,[status(thm)],[c176,clause_4]) ).

cnf(c183,plain,
    $false,
    inference(resolution,[status(thm)],[c180,c21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : KRS002-1 : TPTP v8.1.2. Released v2.0.0.
% 0.04/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.35  % Computer : n023.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:38 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.42/0.60  % Version:  1.5
% 0.42/0.60  % SZS status Unsatisfiable
% 0.42/0.60  % SZS output start CNFRefutation
% See solution above
% 0.42/0.60  
% 0.42/0.60  % Initial clauses    : 18
% 0.42/0.60  % Processed clauses  : 64
% 0.42/0.60  % Factors computed   : 2
% 0.42/0.60  % Resolvents computed: 182
% 0.42/0.60  % Tautologies deleted: 8
% 0.42/0.60  % Forward subsumed   : 86
% 0.42/0.60  % Backward subsumed  : 20
% 0.42/0.60  % -------- CPU Time ---------
% 0.42/0.60  % User time          : 0.234 s
% 0.42/0.60  % System time        : 0.016 s
% 0.42/0.60  % Total time         : 0.250 s
%------------------------------------------------------------------------------