↑ Up

PyRes---1.5.UNS-CRf.s

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

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 12:57:51 PM UTC 2026

% Result   : Unsatisfiable 1.82s 2.10s
% Output   : CNFRefutation 1.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   19 (  14 unt;   0 nHn;   6 RR)
%            Number of literals    :   25 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   65 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_p_1,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p_1) ).

cnf(condensed_detachment,axiom,
    ( ~ is_a_theorem(equivalent(X3,X2))
    | ~ is_a_theorem(X3)
    | is_a_theorem(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(lg_2,axiom,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X7)),equivalent(X4,X7)),X6),X6)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_2) ).

cnf(c0,plain,
    ( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X12,X13),equivalent(X12,X15)),equivalent(X13,X15)),X14))
    | is_a_theorem(X14) ),
    inference(resolution,[status(thm)],[lg_2,condensed_detachment]) ).

cnf(p_4,axiom,
    is_a_theorem(equivalent(X9,equivalent(equivalent(equivalent(equivalent(X8,X11),equivalent(X8,X10)),equivalent(X11,X10)),X9))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p_4) ).

cnf(c2,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X20,X21),equivalent(X20,X25)),equivalent(X21,X25)),equivalent(equivalent(equivalent(X24,X23),equivalent(X24,X22)),equivalent(X23,X22)))),
    inference(resolution,[status(thm)],[c0,p_4]) ).

cnf(c6,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X28,X26),equivalent(X28,X27)),equivalent(X26,X27))),
    inference(resolution,[status(thm)],[c2,c0]) ).

cnf(c9,plain,
    ( ~ is_a_theorem(equivalent(equivalent(X29,X30),equivalent(X29,X31)))
    | is_a_theorem(equivalent(X30,X31)) ),
    inference(resolution,[status(thm)],[c6,condensed_detachment]) ).

cnf(c1,plain,
    ( ~ is_a_theorem(X18)
    | is_a_theorem(equivalent(equivalent(equivalent(equivalent(X16,X19),equivalent(X16,X17)),equivalent(X19,X17)),X18)) ),
    inference(resolution,[status(thm)],[p_4,condensed_detachment]) ).

cnf(c11,plain,
    is_a_theorem(equivalent(equivalent(X32,X33),equivalent(X32,X33))),
    inference(resolution,[status(thm)],[c9,c2]) ).

cnf(c16,plain,
    is_a_theorem(equivalent(X34,X34)),
    inference(resolution,[status(thm)],[c11,c9]) ).

cnf(c17,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X67,X68),equivalent(X67,X70)),equivalent(X68,X70)),equivalent(X69,X69))),
    inference(resolution,[status(thm)],[c16,c1]) ).

cnf(c32,plain,
    is_a_theorem(equivalent(equivalent(X74,X72),equivalent(equivalent(X73,X74),equivalent(X73,X72)))),
    inference(resolution,[status(thm)],[c17,c9]) ).

cnf(c34,plain,
    is_a_theorem(equivalent(equivalent(X111,equivalent(equivalent(X112,X114),equivalent(X112,X113))),equivalent(X111,equivalent(X114,X113)))),
    inference(resolution,[status(thm)],[c32,c0]) ).

cnf(c56,plain,
    ( ~ is_a_theorem(equivalent(X156,equivalent(equivalent(X155,X158),equivalent(X155,X157))))
    | is_a_theorem(equivalent(X156,equivalent(X158,X157))) ),
    inference(resolution,[status(thm)],[c34,condensed_detachment]) ).

cnf(c4,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X55,X56),equivalent(X55,X53)),equivalent(X56,X53)),equivalent(X57,equivalent(equivalent(equivalent(equivalent(X52,X54),equivalent(X52,X58)),equivalent(X54,X58)),X57)))),
    inference(resolution,[status(thm)],[c1,p_4]) ).

cnf(c28,plain,
    is_a_theorem(equivalent(equivalent(X262,X264),equivalent(equivalent(equivalent(equivalent(X260,X263),equivalent(X260,X265)),equivalent(X263,X265)),equivalent(equivalent(X261,X262),equivalent(X261,X264))))),
    inference(resolution,[status(thm)],[c4,c9]) ).

cnf(c172,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1866,X1863),X1865),equivalent(equivalent(X1864,X1863),equivalent(equivalent(X1866,X1864),X1865)))),
    inference(resolution,[status(thm)],[c28,c56]) ).

cnf(c2646,plain,
    $false,
    inference(resolution,[status(thm)],[c172,prove_p_1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL101-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.10/0.36  % Computer : n011.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Fri Sep  4 15:28:28 UTC 2026
% 0.14/0.36  % CPUTime  : 
% 0.14/0.42  /export/starexec/sandbox2/solver/bin/lexer.py:155: SyntaxWarning: invalid escape sequence '\.'
% 0.14/0.42    (re.compile("\."),                    Token.FullStop),
% 0.14/0.42  /export/starexec/sandbox2/solver/bin/lexer.py:156: SyntaxWarning: invalid escape sequence '\('
% 0.14/0.42    (re.compile("\("),                    Token.OpenPar),
% 0.14/0.42  /export/starexec/sandbox2/solver/bin/lexer.py:157: SyntaxWarning: invalid escape sequence '\)'
% 0.14/0.42    (re.compile("\)"),                    Token.ClosePar),
% 0.14/0.42  /export/starexec/sandbox2/solver/bin/lexer.py:158: SyntaxWarning: invalid escape sequence '\['
% 0.14/0.42    (re.compile("\["),                    Token.OpenSquare),
% 0.14/0.42  /export/starexec/sandbox2/solver/bin/lexer.py:159: SyntaxWarning: invalid escape sequence '\]'
% 0.14/0.42    (re.compile("\]"),                    Token.CloseSquare),
% 0.14/0.42  /export/starexec/sandbox2/solver/bin/lexer.py:162: SyntaxWarning: invalid escape sequence '\|'
% 0.14/0.42    (re.compile("~\|"),                   Token.Nor),
% 0.14/0.42  /export/starexec/sandbox2/solver/bin/lexer.py:164: SyntaxWarning: invalid escape sequence '\|'
% 0.14/0.42    (re.compile("\|"),                    Token.Or),
% 0.14/0.42  /export/starexec/sandbox2/solver/bin/lexer.py:175: SyntaxWarning: invalid escape sequence '\?'
% 0.14/0.42    (re.compile("\?"),                    Token.Existential),
% 0.14/0.42  /export/starexec/sandbox2/solver/bin/lexer.py:176: SyntaxWarning: invalid escape sequence '\s'
% 0.14/0.42    (re.compile("\s+"),                   Token.WhiteSpace),
% 0.14/0.42  /export/starexec/sandbox2/solver/bin/lexer.py:180: SyntaxWarning: invalid escape sequence '\$'
% 0.14/0.42    (re.compile("\$[_a-z0-9_A-Z]*"),      Token.DefFunctor),
% 0.24/0.49  /export/starexec/sandbox2/solver/bin/signature.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.24/0.49    """
% 0.24/0.49  /export/starexec/sandbox2/solver/bin/literals.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.24/0.49    """
% 0.34/0.58  /export/starexec/sandbox2/solver/bin/unification.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.34/0.58    """
% 1.82/2.10  % Version:  1.5
% 1.82/2.10  % SZS status Unsatisfiable
% 1.82/2.10  % SZS output start CNFRefutation
% See solution above
% 1.82/2.10  
% 1.82/2.10  % Initial clauses    : 4
% 1.82/2.10  % Processed clauses  : 152
% 1.82/2.10  % Factors computed   : 0
% 1.82/2.10  % Resolvents computed: 2659
% 1.82/2.10  % Tautologies deleted: 2
% 1.82/2.10  % Forward subsumed   : 482
% 1.82/2.10  % Backward subsumed  : 1
% 1.82/2.10  % -------- CPU Time ---------
% 1.82/2.10  % User time          : 1.715 s
% 1.82/2.10  % System time        : 0.027 s
% 1.82/2.10  % Total time         : 1.742 s
%------------------------------------------------------------------------------