↑ Up

PyRes---1.5.THM-CRf.s

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

% Computer : n031.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:59:36 PM UTC 2026

% Result   : Theorem 0.34s 0.60s
% Output   : CNFRefutation 0.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (  14 unt;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  16   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :   13 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   82 (  18 sgn  22   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_cn_1,conjecture,
    ! [A,B,C] : is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_1) ).

fof(c0,negated_conjecture,
    ~ ! [A,B,C] : is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
    inference(assume_negation,[status(cth)],[prove_cn_1]) ).

fof(c1,negated_conjecture,
    ? [A,B,C] : ~ is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
    inference(fof_nnf,[status(thm)],[c0]) ).

fof(c2,negated_conjecture,
    ? [X2,X3,X4] : ~ is_a_theorem(implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4)))),
    inference(variable_rename,[status(thm)],[c1]) ).

fof(c3,negated_conjecture,
    ~ is_a_theorem(implies(implies(skolem0001,skolem0002),implies(implies(skolem0002,skolem0003),implies(skolem0001,skolem0003)))),
    inference(skolemize,[status(esa)],[c2]) ).

cnf(c4,negated_conjecture,
    ~ is_a_theorem(implies(implies(skolem0001,skolem0002),implies(implies(skolem0002,skolem0003),implies(skolem0001,skolem0003)))),
    inference(split_conjunct,[status(thm)],[c3]) ).

fof(condensed_detachment,axiom,
    ! [X,Y] :
      ( ~ is_a_theorem(implies(X,Y))
      | ~ is_a_theorem(X)
      | is_a_theorem(Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

fof(c7,plain,
    ! [X,Y] :
      ( ~ is_a_theorem(implies(X,Y))
      | ~ is_a_theorem(X)
      | is_a_theorem(Y) ),
    inference(fof_simplification,[status(thm)],[condensed_detachment]) ).

fof(c8,plain,
    ! [X10,X11] :
      ( ~ is_a_theorem(implies(X10,X11))
      | ~ is_a_theorem(X10)
      | is_a_theorem(X11) ),
    inference(variable_rename,[status(thm)],[c7]) ).

cnf(c9,plain,
    ( ~ is_a_theorem(implies(X12,X13))
    | ~ is_a_theorem(X12)
    | is_a_theorem(X13) ),
    inference(split_conjunct,[status(thm)],[c8]) ).

fof(a5,axiom,
    ! [A,B,C,D,E] : is_a_theorem(implies(implies(A,B),implies(implies(implies(C,implies(D,E)),implies(B,implies(not(D),not(A)))),implies(A,D)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a5) ).

fof(c5,plain,
    ! [X5,X6,X7,X8,X9] : is_a_theorem(implies(implies(X5,X6),implies(implies(implies(X7,implies(X8,X9)),implies(X6,implies(not(X8),not(X5)))),implies(X5,X8)))),
    inference(variable_rename,[status(thm)],[a5]) ).

cnf(c6,plain,
    is_a_theorem(implies(implies(X16,X14),implies(implies(implies(X18,implies(X17,X15)),implies(X14,implies(not(X17),not(X16)))),implies(X16,X17)))),
    inference(split_conjunct,[status(thm)],[c5]) ).

cnf(c10,plain,
    ( ~ is_a_theorem(implies(X19,X22))
    | is_a_theorem(implies(implies(implies(X20,implies(X23,X21)),implies(X22,implies(not(X23),not(X19)))),implies(X19,X23))) ),
    inference(resolution,[status(thm)],[c6,c9]) ).

cnf(c11,plain,
    is_a_theorem(implies(implies(implies(X31,implies(X25,X28)),implies(implies(implies(implies(X27,implies(X24,X29)),implies(X30,implies(not(X24),not(X26)))),implies(X26,X24)),implies(not(X25),not(implies(X26,X30))))),implies(implies(X26,X30),X25))),
    inference(resolution,[status(thm)],[c10,c6]) ).

cnf(c12,plain,
    is_a_theorem(implies(implies(implies(X41,implies(X32,X40)),implies(implies(implies(X39,X35),X42),implies(not(X32),not(implies(implies(X38,implies(X42,X36)),implies(implies(implies(implies(X37,implies(X33,X34)),implies(X35,implies(not(X33),not(X39)))),implies(X39,X33)),implies(not(X42),not(implies(X39,X35))))))))),implies(implies(implies(X38,implies(X42,X36)),implies(implies(implies(implies(X37,implies(X33,X34)),implies(X35,implies(not(X33),not(X39)))),implies(X39,X33)),implies(not(X42),not(implies(X39,X35))))),X32))),
    inference(resolution,[status(thm)],[c11,c10]) ).

cnf(c13,plain,
    ( ~ is_a_theorem(implies(implies(X48,implies(X50,X46)),implies(implies(implies(implies(X47,implies(X43,X44)),implies(X45,implies(not(X43),not(X49)))),implies(X49,X43)),implies(not(X50),not(implies(X49,X45))))))
    | is_a_theorem(implies(implies(X49,X45),X50)) ),
    inference(resolution,[status(thm)],[c11,c9]) ).

cnf(c16,plain,
    is_a_theorem(implies(implies(implies(implies(implies(X51,implies(X55,X53)),implies(X54,implies(not(X55),not(X56)))),implies(X56,X55)),X52),implies(implies(X56,X54),X52))),
    inference(resolution,[status(thm)],[c13,c12]) ).

cnf(c19,plain,
    ( ~ is_a_theorem(implies(implies(implies(implies(X58,implies(X60,X57)),implies(X62,implies(not(X60),not(X59)))),implies(X59,X60)),X61))
    | is_a_theorem(implies(implies(X59,X62),X61)) ),
    inference(resolution,[status(thm)],[c16,c9]) ).

cnf(c22,plain,
    is_a_theorem(implies(implies(X65,X63),implies(implies(X63,X64),implies(X65,X64)))),
    inference(resolution,[status(thm)],[c19,c16]) ).

cnf(c24,plain,
    $false,
    inference(resolution,[status(thm)],[c22,c4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL982+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.03  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.07/0.34  % Computer : n031.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Sat Sep  5 16:17:10 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.13/0.41  /export/starexec/sandbox/solver/bin/lexer.py:155: SyntaxWarning: invalid escape sequence '\.'
% 0.13/0.41    (re.compile("\."),                    Token.FullStop),
% 0.13/0.41  /export/starexec/sandbox/solver/bin/lexer.py:156: SyntaxWarning: invalid escape sequence '\('
% 0.13/0.41    (re.compile("\("),                    Token.OpenPar),
% 0.13/0.41  /export/starexec/sandbox/solver/bin/lexer.py:157: SyntaxWarning: invalid escape sequence '\)'
% 0.13/0.41    (re.compile("\)"),                    Token.ClosePar),
% 0.13/0.41  /export/starexec/sandbox/solver/bin/lexer.py:158: SyntaxWarning: invalid escape sequence '\['
% 0.13/0.41    (re.compile("\["),                    Token.OpenSquare),
% 0.13/0.41  /export/starexec/sandbox/solver/bin/lexer.py:159: SyntaxWarning: invalid escape sequence '\]'
% 0.13/0.41    (re.compile("\]"),                    Token.CloseSquare),
% 0.13/0.41  /export/starexec/sandbox/solver/bin/lexer.py:162: SyntaxWarning: invalid escape sequence '\|'
% 0.13/0.41    (re.compile("~\|"),                   Token.Nor),
% 0.13/0.41  /export/starexec/sandbox/solver/bin/lexer.py:164: SyntaxWarning: invalid escape sequence '\|'
% 0.13/0.41    (re.compile("\|"),                    Token.Or),
% 0.13/0.41  /export/starexec/sandbox/solver/bin/lexer.py:175: SyntaxWarning: invalid escape sequence '\?'
% 0.13/0.41    (re.compile("\?"),                    Token.Existential),
% 0.13/0.41  /export/starexec/sandbox/solver/bin/lexer.py:176: SyntaxWarning: invalid escape sequence '\s'
% 0.13/0.41    (re.compile("\s+"),                   Token.WhiteSpace),
% 0.13/0.41  /export/starexec/sandbox/solver/bin/lexer.py:180: SyntaxWarning: invalid escape sequence '\$'
% 0.13/0.41    (re.compile("\$[_a-z0-9_A-Z]*"),      Token.DefFunctor),
% 0.23/0.48  /export/starexec/sandbox/solver/bin/signature.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.23/0.48    """
% 0.23/0.48  /export/starexec/sandbox/solver/bin/literals.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.23/0.48    """
% 0.34/0.57  /export/starexec/sandbox/solver/bin/unification.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.34/0.57    """
% 0.34/0.60  % Version:  1.5
% 0.34/0.60  % SZS status Theorem
% 0.34/0.60  % SZS output start CNFRefutation
% See solution above
% 0.34/0.60  
% 0.34/0.60  % Initial clauses    : 3
% 0.34/0.60  % Processed clauses  : 10
% 0.34/0.60  % Factors computed   : 0
% 0.34/0.60  % Resolvents computed: 18
% 0.34/0.60  % Tautologies deleted: 0
% 0.34/0.60  % Forward subsumed   : 0
% 0.34/0.60  % Backward subsumed  : 0
% 0.34/0.60  % -------- CPU Time ---------
% 0.34/0.60  % User time          : 0.228 s
% 0.34/0.60  % System time        : 0.021 s
% 0.34/0.60  % Total time         : 0.249 s
%------------------------------------------------------------------------------