%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL238-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.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:13:29 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named prove_thisERROR: Could not build tree for root finalERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(8,plain,
~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))),
inference(cnf,[status(esa)],[prove_this]) ).
cnf(l0,plain,
~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))),
inference(instantiation,[status(thm)],[8]) ).
cnf(6,plain,
( ~ theorem(X0)
| ~ axiom(or(not(X0),X1))
| theorem(X1) ),
inference(cnf,[status(esa)],[rule_2]) ).
cnf(l1,plain,
( ~ theorem(or(not(or(not(q),not(p))),not(not(or(not(p),not(q))))))
| ~ axiom(or(not(or(not(or(not(q),not(p))),not(not(or(not(p),not(q)))))),or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))))
| theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(7,plain,
( ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(X2),X0))
| theorem(or(not(X2),X1)) ),
inference(cnf,[status(esa)],[rule_3]) ).
cnf(l2,plain,
( ~ theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q))))))
| ~ axiom(or(not(or(not(q),not(p))),or(not(p),not(q))))
| theorem(or(not(or(not(q),not(p))),not(not(or(not(p),not(q)))))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(2,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf,[status(esa)],[axiom_1_4]) ).
cnf(l3,plain,
axiom(or(not(or(not(or(not(q),not(p))),not(not(or(not(p),not(q)))))),or(not(not(or(not(p),not(q)))),not(or(not(q),not(p)))))),
inference(instantiation,[status(thm)],[2]) ).
cnf(l5,plain,
( ~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(p),not(q)))))
| ~ axiom(or(not(or(not(not(or(not(p),not(q)))),not(or(not(p),not(q))))),or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))))
| theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l7,plain,
axiom(or(not(or(not(not(or(not(p),not(q)))),not(or(not(p),not(q))))),or(not(or(not(p),not(q))),not(not(or(not(p),not(q))))))),
inference(instantiation,[status(thm)],[2]) ).
cnf(l4,plain,
axiom(or(not(or(not(q),not(p))),or(not(p),not(q)))),
inference(instantiation,[status(thm)],[2]) ).
cnf(l6,plain,
( ~ theorem(or(not(or(not(or(not(p),not(q))),not(or(not(p),not(q))))),not(or(not(p),not(q)))))
| ~ axiom(or(not(not(or(not(p),not(q)))),or(not(or(not(p),not(q))),not(or(not(p),not(q))))))
| theorem(or(not(not(or(not(p),not(q)))),not(or(not(p),not(q))))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(5,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf,[status(esa)],[rule_1]) ).
cnf(l9,plain,
( ~ axiom(or(not(or(not(or(not(p),not(q))),not(or(not(p),not(q))))),not(or(not(p),not(q)))))
| theorem(or(not(or(not(or(not(p),not(q))),not(or(not(p),not(q))))),not(or(not(p),not(q))))) ),
inference(instantiation,[status(thm)],[5]) ).
cnf(1,plain,
axiom(or(not(X0),or(X1,X0))),
inference(cnf,[status(esa)],[axiom_1_3]) ).
cnf(l8,plain,
axiom(or(not(not(or(not(p),not(q)))),or(not(or(not(p),not(q))),not(or(not(p),not(q)))))),
inference(instantiation,[status(thm)],[1]) ).
cnf(0,plain,
axiom(or(not(or(X0,X0)),X0)),
inference(cnf,[status(esa)],[axiom_1_2]) ).
cnf(l10,plain,
axiom(or(not(or(not(or(not(p),not(q))),not(or(not(p),not(q))))),not(or(not(p),not(q))))),
inference(instantiation,[status(thm)],[0]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l5,l7,l4,l6,l9,l8,l10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL238-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.06 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.42 % Computer : n008.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Sat Sep 5 11:31:38 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.43 % launching worker at depth: 1
% 0.16/0.43 % launching worker at depth: 3
% 0.16/0.43 % launching worker at depth: 2
% 0.16/0.43 % launching worker at depth: 4
% 0.16/0.43 % launching worker at depth: 5
% 0.16/0.43 % launching worker at depth: 6
% 0.16/0.43 % launching worker at depth: 7
% 0.16/0.43 % launching worker at depth: 8
% 0.16/0.43 % launching worker at depth: 9
% 0.16/0.43 % launching worker at depth: 10
% 0.16/0.43 % launching worker at depth: 11
% 0.16/0.44 % launching worker at depth: 12
% 0.16/0.45 % SZS status Theorem for theBenchmark
% 0.16/0.45 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------