%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL234-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 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:13:28 PM UTC 2026
% Result : Unsatisfiable 89.96s 11.73s
% Output : CNFRefutation 89.96s
% 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(p),or(not(q),not(or(not(p),not(q)))))),
inference(cnf,[status(esa)],[prove_this]) ).
cnf(l0,plain,
~ theorem(or(not(p),or(not(q),not(or(not(p),not(q)))))),
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(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q)))))))
| ~ axiom(or(not(or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q))))))),or(not(p),or(not(q),not(or(not(p),not(q)))))))
| theorem(or(not(p),or(not(q),not(or(not(p),not(q)))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l2,plain,
( ~ theorem(or(not(p),or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(q),not(or(not(p),not(q)))))))
| ~ axiom(or(not(or(not(p),or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(q),not(or(not(p),not(q))))))),or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q))))))))
| theorem(or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q))))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(0,plain,
axiom(or(not(or(X0,X0)),X0)),
inference(cnf,[status(esa)],[axiom_1_2]) ).
cnf(l3,plain,
axiom(or(not(or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q))))))),or(not(p),or(not(q),not(or(not(p),not(q))))))),
inference(instantiation,[status(thm)],[0]) ).
cnf(3,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf,[status(esa)],[axiom_1_5]) ).
cnf(l4,plain,
axiom(or(not(or(not(p),or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(q),not(or(not(p),not(q))))))),or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q)))))))),
inference(instantiation,[status(thm)],[3]) ).
cnf(l5,plain,
( ~ theorem(or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(q),not(or(not(p),not(q))))))
| ~ axiom(or(not(or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(q),not(or(not(p),not(q)))))),or(not(p),or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(q),not(or(not(p),not(q))))))))
| theorem(or(not(p),or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(q),not(or(not(p),not(q))))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l6,plain,
( ~ theorem(or(not(q),or(or(not(p),or(not(q),not(or(not(p),not(q))))),not(or(not(p),not(q))))))
| ~ axiom(or(not(or(not(q),or(or(not(p),or(not(q),not(or(not(p),not(q))))),not(or(not(p),not(q)))))),or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(q),not(or(not(p),not(q)))))))
| theorem(or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(q),not(or(not(p),not(q)))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l9,plain,
( ~ theorem(or(or(not(p),or(not(q),not(or(not(p),not(q))))),not(or(not(p),not(q)))))
| ~ axiom(or(not(or(or(not(p),or(not(q),not(or(not(p),not(q))))),not(or(not(p),not(q))))),or(not(q),or(or(not(p),or(not(q),not(or(not(p),not(q))))),not(or(not(p),not(q)))))))
| theorem(or(not(q),or(or(not(p),or(not(q),not(or(not(p),not(q))))),not(or(not(p),not(q)))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l10,plain,
( ~ theorem(or(not(or(not(p),not(q))),or(not(p),or(not(q),not(or(not(p),not(q)))))))
| ~ axiom(or(not(or(not(or(not(p),not(q))),or(not(p),or(not(q),not(or(not(p),not(q))))))),or(or(not(p),or(not(q),not(or(not(p),not(q))))),not(or(not(p),not(q))))))
| theorem(or(or(not(p),or(not(q),not(or(not(p),not(q))))),not(or(not(p),not(q))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l12,plain,
( ~ theorem(or(not(not(q)),or(not(q),not(or(not(p),not(q))))))
| ~ axiom(or(not(or(not(not(q)),or(not(q),not(or(not(p),not(q)))))),or(not(or(not(p),not(q))),or(not(p),or(not(q),not(or(not(p),not(q))))))))
| theorem(or(not(or(not(p),not(q))),or(not(p),or(not(q),not(or(not(p),not(q))))))) ),
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(l13,plain,
( ~ theorem(or(not(or(not(or(not(p),not(q))),not(q))),or(not(q),not(or(not(p),not(q))))))
| ~ axiom(or(not(not(q)),or(not(or(not(p),not(q))),not(q))))
| theorem(or(not(not(q)),or(not(q),not(or(not(p),not(q)))))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(1,plain,
axiom(or(not(X0),or(X1,X0))),
inference(cnf,[status(esa)],[axiom_1_3]) ).
cnf(l11,plain,
axiom(or(not(or(or(not(p),or(not(q),not(or(not(p),not(q))))),not(or(not(p),not(q))))),or(not(q),or(or(not(p),or(not(q),not(or(not(p),not(q))))),not(or(not(p),not(q))))))),
inference(instantiation,[status(thm)],[1]) ).
cnf(5,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf,[status(esa)],[rule_1]) ).
cnf(l16,plain,
( ~ axiom(or(not(or(not(or(not(p),not(q))),not(q))),or(not(q),not(or(not(p),not(q))))))
| theorem(or(not(or(not(or(not(p),not(q))),not(q))),or(not(q),not(or(not(p),not(q)))))) ),
inference(instantiation,[status(thm)],[5]) ).
cnf(2,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf,[status(esa)],[axiom_1_4]) ).
cnf(l14,plain,
axiom(or(not(or(not(or(not(p),not(q))),or(not(p),or(not(q),not(or(not(p),not(q))))))),or(or(not(p),or(not(q),not(or(not(p),not(q))))),not(or(not(p),not(q)))))),
inference(instantiation,[status(thm)],[2]) ).
cnf(l8,plain,
axiom(or(not(or(not(q),or(or(not(p),or(not(q),not(or(not(p),not(q))))),not(or(not(p),not(q)))))),or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(q),not(or(not(p),not(q))))))),
inference(instantiation,[status(thm)],[3]) ).
cnf(l18,plain,
axiom(or(not(or(not(or(not(p),not(q))),not(q))),or(not(q),not(or(not(p),not(q)))))),
inference(instantiation,[status(thm)],[2]) ).
cnf(l7,plain,
axiom(or(not(or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(q),not(or(not(p),not(q)))))),or(not(p),or(or(not(p),or(not(q),not(or(not(p),not(q))))),or(not(q),not(or(not(p),not(q)))))))),
inference(instantiation,[status(thm)],[1]) ).
cnf(4,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(cnf,[status(esa)],[axiom_1_6]) ).
cnf(l15,plain,
axiom(or(not(or(not(not(q)),or(not(q),not(or(not(p),not(q)))))),or(not(or(not(p),not(q))),or(not(p),or(not(q),not(or(not(p),not(q)))))))),
inference(instantiation,[status(thm)],[4]) ).
cnf(l17,plain,
axiom(or(not(not(q)),or(not(or(not(p),not(q))),not(q)))),
inference(instantiation,[status(thm)],[1]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l4,l5,l6,l9,l10,l12,l13,l11,l16,l14,l8,l18,l7,l15,l17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL234-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n015.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 5 16:43:42 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % launching worker at depth: 1
% 0.10/0.37 % launching worker at depth: 6
% 0.10/0.37 % launching worker at depth: 2
% 0.10/0.37 % launching worker at depth: 4
% 0.10/0.37 % launching worker at depth: 5
% 0.10/0.37 % launching worker at depth: 8
% 0.10/0.37 % launching worker at depth: 7
% 0.10/0.37 % launching worker at depth: 3
% 0.10/0.37 % launching worker at depth: 9
% 0.10/0.37 % launching worker at depth: 10
% 0.10/0.37 % launching worker at depth: 11
% 0.10/0.38 % launching worker at depth: 12
% 0.10/0.41 % launching worker at depth: 13
% 0.81/0.53 % launching worker at depth: 14
% 6.19/1.15 % launching worker at depth: 15
% 32.03/4.41 % launching worker at depth: 16
% 86.72/11.37 % launching worker at depth: 17
% 89.96/11.73 % SZS status Theorem for theBenchmark
% 89.96/11.73 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------