%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : LCL527+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n014.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:38 PM UTC 2026
% Result : Theorem 0.67s 0.99s
% Output : CNFRefutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL527+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.08/0.35 % Computer : n014.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 6 00:37:27 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.14/0.39 /export/starexec/sandbox/solver/bin/lexer.py:155: SyntaxWarning: invalid escape sequence '\.'
% 0.14/0.39 (re.compile("\."), Token.FullStop),
% 0.14/0.39 /export/starexec/sandbox/solver/bin/lexer.py:156: SyntaxWarning: invalid escape sequence '\('
% 0.14/0.39 (re.compile("\("), Token.OpenPar),
% 0.14/0.39 /export/starexec/sandbox/solver/bin/lexer.py:157: SyntaxWarning: invalid escape sequence '\)'
% 0.14/0.39 (re.compile("\)"), Token.ClosePar),
% 0.14/0.39 /export/starexec/sandbox/solver/bin/lexer.py:158: SyntaxWarning: invalid escape sequence '\['
% 0.14/0.39 (re.compile("\["), Token.OpenSquare),
% 0.14/0.39 /export/starexec/sandbox/solver/bin/lexer.py:159: SyntaxWarning: invalid escape sequence '\]'
% 0.14/0.39 (re.compile("\]"), Token.CloseSquare),
% 0.14/0.39 /export/starexec/sandbox/solver/bin/lexer.py:162: SyntaxWarning: invalid escape sequence '\|'
% 0.14/0.39 (re.compile("~\|"), Token.Nor),
% 0.14/0.39 /export/starexec/sandbox/solver/bin/lexer.py:164: SyntaxWarning: invalid escape sequence '\|'
% 0.14/0.39 (re.compile("\|"), Token.Or),
% 0.14/0.39 /export/starexec/sandbox/solver/bin/lexer.py:175: SyntaxWarning: invalid escape sequence '\?'
% 0.14/0.39 (re.compile("\?"), Token.Existential),
% 0.14/0.39 /export/starexec/sandbox/solver/bin/lexer.py:176: SyntaxWarning: invalid escape sequence '\s'
% 0.14/0.39 (re.compile("\s+"), Token.WhiteSpace),
% 0.14/0.39 /export/starexec/sandbox/solver/bin/lexer.py:180: SyntaxWarning: invalid escape sequence '\$'
% 0.14/0.39 (re.compile("\$[_a-z0-9_A-Z]*"), Token.DefFunctor),
% 0.14/0.42 /export/starexec/sandbox/solver/bin/signature.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.14/0.42 """
% 0.14/0.42 /export/starexec/sandbox/solver/bin/literals.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.14/0.42 """
% 0.23/0.46 /export/starexec/sandbox/solver/bin/unification.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.23/0.46 """
% 0.67/0.99 % Version: 1.5
% 0.67/0.99 % SZS status Theorem
% 0.67/0.99 % SZS output start CNFRefutation
% 0.67/0.99 fof(s1_0_adjunction,conjecture,adjunction,file('/export/starexec/sandbox/benchmark/theBenchmark.p', s1_0_adjunction)).
% 0.67/0.99 fof(c10,negated_conjecture,(~adjunction),inference(assume_negation,[status(cth)],[s1_0_adjunction])).
% 0.67/0.99 fof(c11,negated_conjecture,~adjunction,inference(fof_simplification,[status(thm)],[c10])).
% 0.67/0.99 cnf(c12,negated_conjecture,~adjunction,inference(split_conjunct,[status(thm)],[c11])).
% 0.67/0.99 fof(adjunction,axiom,(adjunction<=>(![X]:(![Y]:((is_a_theorem(X)&is_a_theorem(Y))=>is_a_theorem(and(X,Y)))))),file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax', adjunction)).
% 0.67/0.99 fof(c162,plain,((~adjunction|(![X]:(![Y]:((~is_a_theorem(X)|~is_a_theorem(Y))|is_a_theorem(and(X,Y))))))&((?[X]:(?[Y]:((is_a_theorem(X)&is_a_theorem(Y))&~is_a_theorem(and(X,Y)))))|adjunction)),inference(fof_nnf,[status(thm)],[adjunction])).
% 0.67/0.99 fof(c163,plain,((~adjunction|(![X76]:(![X77]:((~is_a_theorem(X76)|~is_a_theorem(X77))|is_a_theorem(and(X76,X77))))))&((?[X78]:(?[X79]:((is_a_theorem(X78)&is_a_theorem(X79))&~is_a_theorem(and(X78,X79)))))|adjunction)),inference(variable_rename,[status(thm)],[c162])).
% 0.67/0.99 fof(c165,plain,(![X76]:(![X77]:((~adjunction|((~is_a_theorem(X76)|~is_a_theorem(X77))|is_a_theorem(and(X76,X77))))&(((is_a_theorem(skolem0035)&is_a_theorem(skolem0036))&~is_a_theorem(and(skolem0035,skolem0036)))|adjunction)))),inference(shift_quantors,[status(thm)],[fof(c164,plain,((~adjunction|(![X76]:(![X77]:((~is_a_theorem(X76)|~is_a_theorem(X77))|is_a_theorem(and(X76,X77))))))&(((is_a_theorem(skolem0035)&is_a_theorem(skolem0036))&~is_a_theorem(and(skolem0035,skolem0036)))|adjunction)),inference(skolemize,[status(esa)],[c163])).])).
% 0.67/0.99 fof(c166,plain,(![X76]:(![X77]:((~adjunction|((~is_a_theorem(X76)|~is_a_theorem(X77))|is_a_theorem(and(X76,X77))))&(((is_a_theorem(skolem0035)|adjunction)&(is_a_theorem(skolem0036)|adjunction))&(~is_a_theorem(and(skolem0035,skolem0036))|adjunction))))),inference(distribute,[status(thm)],[c165])).
% 0.67/0.99 cnf(c170,plain,~is_a_theorem(and(skolem0035,skolem0036))|adjunction,inference(split_conjunct,[status(thm)],[c166])).
% 0.67/0.99 fof(hilbert_modus_ponens,axiom,modus_ponens,file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax', hilbert_modus_ponens)).
% 0.67/0.99 cnf(c202,plain,modus_ponens,inference(split_conjunct,[status(thm)],[hilbert_modus_ponens])).
% 0.67/0.99 cnf(c169,plain,is_a_theorem(skolem0036)|adjunction,inference(split_conjunct,[status(thm)],[c166])).
% 0.67/0.99 cnf(c396,plain,is_a_theorem(skolem0036),inference(resolution,[status(thm)],[c169, c12])).
% 0.67/0.99 fof(modus_ponens,axiom,(modus_ponens<=>(![X]:(![Y]:((is_a_theorem(X)&is_a_theorem(implies(X,Y)))=>is_a_theorem(Y))))),file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', modus_ponens)).
% 0.67/0.99 fof(c378,plain,((~modus_ponens|(![X]:(![Y]:((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))))&((?[X]:(?[Y]:((is_a_theorem(X)&is_a_theorem(implies(X,Y)))&~is_a_theorem(Y))))|modus_ponens)),inference(fof_nnf,[status(thm)],[modus_ponens])).
% 0.67/0.99 fof(c379,plain,((~modus_ponens|(![X202]:(![X203]:((~is_a_theorem(X202)|~is_a_theorem(implies(X202,X203)))|is_a_theorem(X203)))))&((?[X204]:(?[X205]:((is_a_theorem(X204)&is_a_theorem(implies(X204,X205)))&~is_a_theorem(X205))))|modus_ponens)),inference(variable_rename,[status(thm)],[c378])).
% 0.67/0.99 fof(c381,plain,(![X202]:(![X203]:((~modus_ponens|((~is_a_theorem(X202)|~is_a_theorem(implies(X202,X203)))|is_a_theorem(X203)))&(((is_a_theorem(skolem0093)&is_a_theorem(implies(skolem0093,skolem0094)))&~is_a_theorem(skolem0094))|modus_ponens)))),inference(shift_quantors,[status(thm)],[fof(c380,plain,((~modus_ponens|(![X202]:(![X203]:((~is_a_theorem(X202)|~is_a_theorem(implies(X202,X203)))|is_a_theorem(X203)))))&(((is_a_theorem(skolem0093)&is_a_theorem(implies(skolem0093,skolem0094)))&~is_a_theorem(skolem0094))|modus_ponens)),inference(skolemize,[status(esa)],[c379])).])).
% 0.67/0.99 fof(c382,plain,(![X202]:(![X203]:((~modus_ponens|((~is_a_theorem(X202)|~is_a_theorem(implies(X202,X203)))|is_a_theorem(X203)))&(((is_a_theorem(skolem0093)|modus_ponens)&(is_a_theorem(implies(skolem0093,skolem0094))|modus_ponens))&(~is_a_theorem(skolem0094)|modus_ponens))))),inference(distribute,[status(thm)],[c381])).
% 0.67/0.99 cnf(c383,plain,~modus_ponens|~is_a_theorem(X369)|~is_a_theorem(implies(X369,X368))|is_a_theorem(X368),inference(split_conjunct,[status(thm)],[c382])).
% 0.67/0.99 cnf(c168,plain,is_a_theorem(skolem0035)|adjunction,inference(split_conjunct,[status(thm)],[c166])).
% 0.67/0.99 cnf(c395,plain,is_a_theorem(skolem0035),inference(resolution,[status(thm)],[c168, c12])).
% 0.67/0.99 fof(hilbert_and_3,axiom,and_3,file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax', hilbert_and_3)).
% 0.67/0.99 cnf(c195,plain,and_3,inference(split_conjunct,[status(thm)],[hilbert_and_3])).
% 0.67/0.99 fof(and_3,axiom,(and_3<=>(![X]:(![Y]:is_a_theorem(implies(X,implies(Y,and(X,Y))))))),file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', and_3)).
% 0.67/0.99 fof(c328,plain,((~and_3|(![X]:(![Y]:is_a_theorem(implies(X,implies(Y,and(X,Y)))))))&((?[X]:(?[Y]:~is_a_theorem(implies(X,implies(Y,and(X,Y))))))|and_3)),inference(fof_nnf,[status(thm)],[and_3])).
% 0.67/0.99 fof(c329,plain,((~and_3|(![X168]:(![X169]:is_a_theorem(implies(X168,implies(X169,and(X168,X169)))))))&((?[X170]:(?[X171]:~is_a_theorem(implies(X170,implies(X171,and(X170,X171))))))|and_3)),inference(variable_rename,[status(thm)],[c328])).
% 0.67/0.99 fof(c331,plain,(![X168]:(![X169]:((~and_3|is_a_theorem(implies(X168,implies(X169,and(X168,X169)))))&(~is_a_theorem(implies(skolem0076,implies(skolem0077,and(skolem0076,skolem0077))))|and_3)))),inference(shift_quantors,[status(thm)],[fof(c330,plain,((~and_3|(![X168]:(![X169]:is_a_theorem(implies(X168,implies(X169,and(X168,X169)))))))&(~is_a_theorem(implies(skolem0076,implies(skolem0077,and(skolem0076,skolem0077))))|and_3)),inference(skolemize,[status(esa)],[c329])).])).
% 0.67/0.99 cnf(c332,plain,~and_3|is_a_theorem(implies(X365,implies(X364,and(X365,X364)))),inference(split_conjunct,[status(thm)],[c331])).
% 0.67/0.99 cnf(c514,plain,is_a_theorem(implies(X367,implies(X366,and(X367,X366)))),inference(resolution,[status(thm)],[c332, c195])).
% 0.67/0.99 cnf(c516,plain,~modus_ponens|~is_a_theorem(X1097)|is_a_theorem(implies(X1096,and(X1097,X1096))),inference(resolution,[status(thm)],[c383, c514])).
% 0.67/0.99 cnf(c2501,plain,~modus_ponens|is_a_theorem(implies(X1098,and(skolem0035,X1098))),inference(resolution,[status(thm)],[c516, c395])).
% 0.67/0.99 cnf(c2578,plain,is_a_theorem(implies(X1099,and(skolem0035,X1099))),inference(resolution,[status(thm)],[c2501, c202])).
% 0.67/0.99 cnf(c2582,plain,~modus_ponens|~is_a_theorem(X1104)|is_a_theorem(and(skolem0035,X1104)),inference(resolution,[status(thm)],[c2578, c383])).
% 0.67/0.99 cnf(c2674,plain,~modus_ponens|is_a_theorem(and(skolem0035,skolem0036)),inference(resolution,[status(thm)],[c2582, c396])).
% 0.67/0.99 cnf(c2733,plain,is_a_theorem(and(skolem0035,skolem0036)),inference(resolution,[status(thm)],[c2674, c202])).
% 0.67/0.99 cnf(c2744,plain,adjunction,inference(resolution,[status(thm)],[c2733, c170])).
% 0.67/0.99 cnf(c2748,plain,$false,inference(resolution,[status(thm)],[c2744, c12])).
% 0.67/0.99 % SZS output end CNFRefutation
% 0.67/0.99
% 0.67/0.99 % Initial clauses : 159
% 0.67/0.99 % Processed clauses : 465
% 0.67/0.99 % Factors computed : 7
% 0.67/0.99 % Resolvents computed: 2356
% 0.67/0.99 % Tautologies deleted: 5
% 0.67/0.99 % Forward subsumed : 238
% 0.67/0.99 % Backward subsumed : 155
% 0.67/0.99 % -------- CPU Time ---------
% 0.67/0.99 % User time : 0.618 s
% 0.67/0.99 % System time : 0.016 s
% 0.67/0.99 % Total time : 0.634 s
%------------------------------------------------------------------------------