%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL187-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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:20 PM UTC 2026
% Result : Unsatisfiable 131.52s 16.98s
% Output : CNFRefutation 131.52s
% 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(implies(p,implies(not(p),q))),
inference(cnf,[status(esa)],[prove_this]) ).
cnf(l0,plain,
~ theorem(implies(p,implies(not(p),q))),
inference(instantiation,[status(thm)],[8]) ).
cnf(7,plain,
( ~ theorem(X0)
| ~ theorem(implies(X0,X1))
| theorem(X1) ),
inference(cnf,[status(esa)],[rule_2]) ).
cnf(l3,plain,
( ~ theorem(or(not(not(p)),or(not(p),q)))
| ~ theorem(implies(or(not(not(p)),or(not(p),q)),implies(p,or(not(not(p)),q))))
| theorem(implies(p,or(not(not(p)),q))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l8,plain,
( ~ theorem(or(not(not(p)),or(q,not(p))))
| ~ theorem(implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q))))
| theorem(or(not(not(p)),or(not(p),q))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(5,plain,
implies(X0,X1) = or(not(X0),X1),
inference(cnf,[status(esa)],[implies_definition]) ).
cnf(l20,plain,
implies(not(p),or(q,not(p))) = or(not(not(p)),or(q,not(p))),
inference(instantiation,[status(thm)],[5]) ).
cnf(l12,plain,
implies(not(p),q) = or(not(not(p)),q),
inference(instantiation,[status(thm)],[5]) ).
cnf(l42,plain,
( ~ theorem(implies(or(q,not(p)),or(not(p),q)))
| ~ theorem(implies(implies(or(q,not(p)),or(not(p),q)),implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q)))))
| theorem(implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q)))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(6,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf,[status(esa)],[rule_1]) ).
cnf(l46,plain,
( ~ axiom(implies(or(q,not(p)),or(not(p),q)))
| theorem(implies(or(q,not(p)),or(not(p),q))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l16,plain,
( ~ axiom(implies(not(p),or(q,not(p))))
| theorem(implies(not(p),or(q,not(p)))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(1,plain,
axiom(implies(X0,or(X1,X0))),
inference(cnf,[status(esa)],[axiom_1_3]) ).
cnf(l25,plain,
axiom(implies(not(p),or(q,not(p)))),
inference(instantiation,[status(thm)],[1]) ).
cnf(l45,plain,
( ~ axiom(implies(implies(or(q,not(p)),or(not(p),q)),implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q)))))
| theorem(implies(implies(or(q,not(p)),or(not(p),q)),implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(4,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(cnf,[status(esa)],[axiom_1_6]) ).
cnf(l49,plain,
axiom(implies(implies(or(q,not(p)),or(not(p),q)),implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q))))),
inference(instantiation,[status(thm)],[4]) ).
cnf(l36,plain,
implies(p,or(not(not(p)),q)) = or(not(p),or(not(not(p)),q)),
inference(instantiation,[status(thm)],[5]) ).
cnf(l13,plain,
( ~ axiom(implies(or(not(not(p)),or(not(p),q)),or(not(p),or(not(not(p)),q))))
| theorem(implies(or(not(not(p)),or(not(p),q)),or(not(p),or(not(not(p)),q)))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(3,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(cnf,[status(esa)],[axiom_1_5]) ).
cnf(l15,plain,
axiom(implies(or(not(not(p)),or(not(p),q)),or(not(p),or(not(not(p)),q)))),
inference(instantiation,[status(thm)],[3]) ).
cnf(2,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
inference(cnf,[status(esa)],[axiom_1_4]) ).
cnf(l47,plain,
axiom(implies(or(q,not(p)),or(not(p),q))),
inference(instantiation,[status(thm)],[2]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l3,l8,l20,l12,l42,l46,l16,l25,l45,l49,l36,l13,l15,l47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL187-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n018.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 : Fri Sep 4 13:33:32 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % launching worker at depth: 1
% 0.08/0.35 % launching worker at depth: 3
% 0.08/0.35 % launching worker at depth: 2
% 0.08/0.35 % launching worker at depth: 4
% 0.08/0.35 % launching worker at depth: 5
% 0.08/0.35 % launching worker at depth: 6
% 0.08/0.35 % launching worker at depth: 7
% 0.08/0.35 % launching worker at depth: 8
% 0.08/0.36 % launching worker at depth: 9
% 0.14/0.36 % launching worker at depth: 10
% 0.14/0.36 % launching worker at depth: 11
% 0.14/0.40 % launching worker at depth: 12
% 56.02/7.45 % launching worker at depth: 13
% 131.52/16.98 % SZS status Theorem for theBenchmark
% 131.52/16.98 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------