%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : LCL238-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n015.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:08 PM UTC 2026
% Result : Unsatisfiable 4.16s 4.46s
% Output : CNFRefutation 4.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 19 ( 12 unt; 0 nHn; 9 RR)
% Number of literals : 28 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X9,X10)),or(X10,X9))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(rule_2,axiom,
( theorem(X11)
| ~ axiom(or(not(X12),X11))
| ~ theorem(X12) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(c5,plain,
( theorem(or(X16,X17))
| ~ theorem(or(X17,X16)) ),
inference(resolution,[status(thm)],[rule_2,axiom_1_4]) ).
cnf(rule_3,axiom,
( theorem(or(not(X46),X45))
| ~ axiom(or(not(X46),X47))
| ~ theorem(or(not(X47),X45)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X3,X3)),X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(c3,plain,
( theorem(X13)
| ~ theorem(or(X13,X13)) ),
inference(resolution,[status(thm)],[rule_2,axiom_1_2]) ).
cnf(rule_1,axiom,
( theorem(X2)
| ~ axiom(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X4),or(X5,X4))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(c1,plain,
theorem(or(not(X8),or(X7,X8))),
inference(resolution,[status(thm)],[axiom_1_3,rule_1]) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X20,or(X22,X21))),or(X22,or(X20,X21)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(c12,plain,
( theorem(or(X68,or(X70,X69)))
| ~ theorem(or(X70,or(X68,X69))) ),
inference(resolution,[status(thm)],[axiom_1_5,rule_2]) ).
cnf(c56,plain,
theorem(or(X72,or(not(X73),X73))),
inference(resolution,[status(thm)],[c12,c1]) ).
cnf(c65,plain,
theorem(or(not(X74),X74)),
inference(resolution,[status(thm)],[c56,c3]) ).
cnf(c71,plain,
theorem(or(X75,not(X75))),
inference(resolution,[status(thm)],[c65,c5]) ).
cnf(c76,plain,
( theorem(or(not(X503),not(not(X504))))
| ~ axiom(or(not(X503),X504)) ),
inference(resolution,[status(thm)],[c71,rule_3]) ).
cnf(c401,plain,
theorem(or(not(or(X2776,X2775)),not(not(or(X2775,X2776))))),
inference(resolution,[status(thm)],[c76,axiom_1_4]) ).
cnf(c1657,plain,
theorem(or(not(not(or(X2825,X2826))),not(or(X2826,X2825)))),
inference(resolution,[status(thm)],[c401,c5]) ).
cnf(c1719,plain,
$false,
inference(resolution,[status(thm)],[c1657,prove_this]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL238-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.04 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.10/0.37 % Computer : n015.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 5 11:34:12 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.43 /export/starexec/sandbox/solver/bin/lexer.py:155: SyntaxWarning: invalid escape sequence '\.'
% 0.10/0.43 (re.compile("\."), Token.FullStop),
% 0.10/0.43 /export/starexec/sandbox/solver/bin/lexer.py:156: SyntaxWarning: invalid escape sequence '\('
% 0.10/0.43 (re.compile("\("), Token.OpenPar),
% 0.10/0.43 /export/starexec/sandbox/solver/bin/lexer.py:157: SyntaxWarning: invalid escape sequence '\)'
% 0.10/0.43 (re.compile("\)"), Token.ClosePar),
% 0.10/0.43 /export/starexec/sandbox/solver/bin/lexer.py:158: SyntaxWarning: invalid escape sequence '\['
% 0.10/0.44 (re.compile("\["), Token.OpenSquare),
% 0.10/0.44 /export/starexec/sandbox/solver/bin/lexer.py:159: SyntaxWarning: invalid escape sequence '\]'
% 0.10/0.44 (re.compile("\]"), Token.CloseSquare),
% 0.10/0.44 /export/starexec/sandbox/solver/bin/lexer.py:162: SyntaxWarning: invalid escape sequence '\|'
% 0.10/0.44 (re.compile("~\|"), Token.Nor),
% 0.10/0.44 /export/starexec/sandbox/solver/bin/lexer.py:164: SyntaxWarning: invalid escape sequence '\|'
% 0.10/0.44 (re.compile("\|"), Token.Or),
% 0.10/0.44 /export/starexec/sandbox/solver/bin/lexer.py:175: SyntaxWarning: invalid escape sequence '\?'
% 0.10/0.44 (re.compile("\?"), Token.Existential),
% 0.10/0.44 /export/starexec/sandbox/solver/bin/lexer.py:176: SyntaxWarning: invalid escape sequence '\s'
% 0.10/0.44 (re.compile("\s+"), Token.WhiteSpace),
% 0.10/0.44 /export/starexec/sandbox/solver/bin/lexer.py:180: SyntaxWarning: invalid escape sequence '\$'
% 0.10/0.44 (re.compile("\$[_a-z0-9_A-Z]*"), Token.DefFunctor),
% 0.22/0.50 /export/starexec/sandbox/solver/bin/signature.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.22/0.50 """
% 0.22/0.51 /export/starexec/sandbox/solver/bin/literals.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.22/0.51 """
% 0.32/0.60 /export/starexec/sandbox/solver/bin/unification.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.32/0.60 """
% 4.16/4.46 % Version: 1.5
% 4.16/4.46 % SZS status Unsatisfiable
% 4.16/4.46 % SZS output start CNFRefutation
% See solution above
% 4.16/4.46
% 4.16/4.46 % Initial clauses : 9
% 4.16/4.46 % Processed clauses : 393
% 4.16/4.46 % Factors computed : 0
% 4.16/4.46 % Resolvents computed: 1724
% 4.16/4.46 % Tautologies deleted: 0
% 4.16/4.46 % Forward subsumed : 522
% 4.16/4.46 % Backward subsumed : 0
% 4.16/4.46 % -------- CPU Time ---------
% 4.16/4.46 % User time : 4.053 s
% 4.16/4.46 % System time : 0.027 s
% 4.16/4.46 % Total time : 4.080 s
%------------------------------------------------------------------------------