%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : LCL397-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n029.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:58:24 PM UTC 2026
% Result : Unsatisfiable 0.40s 0.68s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 12 unt; 0 nHn; 4 RR)
% Number of literals : 23 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_cn_63,negated_conjecture,
~ is_a_theorem(implies(x,implies(y,y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_63) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X2),X2),X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(implies(X5,X6))
| ~ is_a_theorem(X5)
| is_a_theorem(X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(cn_1,axiom,
is_a_theorem(implies(implies(X10,X11),implies(implies(X11,X12),implies(X10,X12)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).
cnf(c5,plain,
( ~ is_a_theorem(implies(X30,X31))
| is_a_theorem(implies(implies(X31,X32),implies(X30,X32))) ),
inference(resolution,[status(thm)],[cn_1,condensed_detachment]) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X3,implies(not(X3),X4))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
cnf(c20,plain,
is_a_theorem(implies(implies(implies(not(X37),X35),X36),implies(X37,X36))),
inference(resolution,[status(thm)],[c5,cn_3]) ).
cnf(c24,plain,
( ~ is_a_theorem(implies(implies(not(X63),X62),X61))
| is_a_theorem(implies(X63,X61)) ),
inference(resolution,[status(thm)],[c20,condensed_detachment]) ).
cnf(c1,plain,
( ~ is_a_theorem(X9)
| is_a_theorem(implies(not(X9),X8)) ),
inference(resolution,[status(thm)],[condensed_detachment,cn_3]) ).
cnf(c56,plain,
is_a_theorem(implies(X64,X64)),
inference(resolution,[status(thm)],[c24,cn_2]) ).
cnf(c61,plain,
is_a_theorem(implies(not(implies(X75,X75)),X74)),
inference(resolution,[status(thm)],[c56,c1]) ).
cnf(c74,plain,
is_a_theorem(implies(implies(X120,X119),implies(not(implies(X118,X118)),X119))),
inference(resolution,[status(thm)],[c61,c5]) ).
cnf(c119,plain,
is_a_theorem(implies(X123,implies(not(implies(X122,X122)),X121))),
inference(resolution,[status(thm)],[c74,c24]) ).
cnf(c125,plain,
is_a_theorem(implies(implies(implies(not(implies(X216,X216)),X215),X214),implies(X213,X214))),
inference(resolution,[status(thm)],[c119,c5]) ).
cnf(c244,plain,
( ~ is_a_theorem(implies(implies(not(implies(X218,X218)),X220),X219))
| is_a_theorem(implies(X217,X219)) ),
inference(resolution,[status(thm)],[c125,condensed_detachment]) ).
cnf(c256,plain,
is_a_theorem(implies(X222,implies(X221,X221))),
inference(resolution,[status(thm)],[c244,cn_2]) ).
cnf(c269,plain,
$false,
inference(resolution,[status(thm)],[c256,prove_cn_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL397-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.37 % Computer : n029.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sat Sep 5 18:44:40 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.43 /export/starexec/sandbox2/solver/bin/lexer.py:155: SyntaxWarning: invalid escape sequence '\.'
% 0.12/0.43 (re.compile("\."), Token.FullStop),
% 0.12/0.43 /export/starexec/sandbox2/solver/bin/lexer.py:156: SyntaxWarning: invalid escape sequence '\('
% 0.12/0.43 (re.compile("\("), Token.OpenPar),
% 0.12/0.43 /export/starexec/sandbox2/solver/bin/lexer.py:157: SyntaxWarning: invalid escape sequence '\)'
% 0.12/0.43 (re.compile("\)"), Token.ClosePar),
% 0.12/0.43 /export/starexec/sandbox2/solver/bin/lexer.py:158: SyntaxWarning: invalid escape sequence '\['
% 0.12/0.43 (re.compile("\["), Token.OpenSquare),
% 0.12/0.43 /export/starexec/sandbox2/solver/bin/lexer.py:159: SyntaxWarning: invalid escape sequence '\]'
% 0.12/0.43 (re.compile("\]"), Token.CloseSquare),
% 0.12/0.43 /export/starexec/sandbox2/solver/bin/lexer.py:162: SyntaxWarning: invalid escape sequence '\|'
% 0.12/0.43 (re.compile("~\|"), Token.Nor),
% 0.12/0.43 /export/starexec/sandbox2/solver/bin/lexer.py:164: SyntaxWarning: invalid escape sequence '\|'
% 0.12/0.43 (re.compile("\|"), Token.Or),
% 0.12/0.43 /export/starexec/sandbox2/solver/bin/lexer.py:175: SyntaxWarning: invalid escape sequence '\?'
% 0.12/0.43 (re.compile("\?"), Token.Existential),
% 0.12/0.43 /export/starexec/sandbox2/solver/bin/lexer.py:176: SyntaxWarning: invalid escape sequence '\s'
% 0.12/0.43 (re.compile("\s+"), Token.WhiteSpace),
% 0.12/0.43 /export/starexec/sandbox2/solver/bin/lexer.py:180: SyntaxWarning: invalid escape sequence '\$'
% 0.12/0.43 (re.compile("\$[_a-z0-9_A-Z]*"), Token.DefFunctor),
% 0.23/0.50 /export/starexec/sandbox2/solver/bin/signature.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.23/0.50 """
% 0.23/0.50 /export/starexec/sandbox2/solver/bin/literals.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.23/0.50 """
% 0.33/0.59 /export/starexec/sandbox2/solver/bin/unification.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.33/0.59 """
% 0.40/0.68 % Version: 1.5
% 0.40/0.68 % SZS status Unsatisfiable
% 0.40/0.68 % SZS output start CNFRefutation
% See solution above
% 0.40/0.68
% 0.40/0.68 % Initial clauses : 5
% 0.40/0.68 % Processed clauses : 49
% 0.40/0.68 % Factors computed : 0
% 0.40/0.68 % Resolvents computed: 275
% 0.40/0.68 % Tautologies deleted: 1
% 0.40/0.68 % Forward subsumed : 32
% 0.40/0.68 % Backward subsumed : 3
% 0.40/0.68 % -------- CPU Time ---------
% 0.40/0.68 % User time : 0.291 s
% 0.40/0.68 % System time : 0.016 s
% 0.40/0.68 % Total time : 0.307 s
%------------------------------------------------------------------------------