%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL186-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/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:19 PM UTC 2026
% Result : Unsatisfiable 254.20s 32.34s
% Output : CNFRefutation 254.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named prove_thisERROR: Could not build tree for root finalERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(9,plain,
theorem(or(not(not(p)),or(not(p),q))) != true,
inference(cnf,[status(esa)],[prove_this]) ).
cnf(l0,plain,
theorem(or(not(not(p)),or(not(p),q))) != true,
inference(instantiation,[status(thm)],[9]) ).
cnf(0,plain,
ifeq(X0,X0,X1,X2) = X1,
inference(cnf,[status(esa)],[ifeq_axiom]) ).
cnf(l16,plain,
ifeq(axiom(or(not(not(p)),or(q,not(p)))),axiom(or(not(not(p)),or(q,not(p)))),theorem(or(not(not(p)),or(not(p),q))),axiom(or(not(or(not(X0_59),X1_59)),or(not(or(X2_59,X0_59)),or(X2_59,X1_59))))) = theorem(or(not(not(p)),or(not(p),q))),
inference(instantiation,[status(thm)],[0]) ).
cnf(l5,plain,
ifeq(ifeq(axiom(or(not(or(q,not(p))),or(not(p),q))),ifeq(theorem(or(not(X0_28),X1_28)),true,ifeq(axiom(or(not(X2_28),X0_28)),true,theorem(or(not(X2_28),X1_28)),true),true),ifeq(X0_30,X0_30,theorem(or(not(or(q,not(p))),or(not(p),q))),X2_30),axiom(or(not(or(X0_31,X1_31)),or(X1_31,X0_31)))),ifeq(axiom(or(not(or(q,not(p))),or(not(p),q))),ifeq(theorem(or(not(X0_28),X1_28)),true,ifeq(axiom(or(not(X2_28),X0_28)),true,theorem(or(not(X2_28),X1_28)),true),true),ifeq(X0_30,X0_30,theorem(or(not(or(q,not(p))),or(not(p),q))),X2_30),axiom(or(not(or(X0_31,X1_31)),or(X1_31,X0_31)))),ifeq(axiom(or(not(not(p)),or(q,not(p)))),axiom(or(not(not(p)),or(q,not(p)))),theorem(or(not(not(p)),or(not(p),q))),axiom(or(not(or(not(X0_59),X1_59)),or(not(or(X2_59,X0_59)),or(X2_59,X1_59))))),axiom(or(not(X0_36),or(X1_36,X0_36)))) = ifeq(axiom(or(not(not(p)),or(q,not(p)))),axiom(or(not(not(p)),or(q,not(p)))),theorem(or(not(not(p)),or(not(p),q))),axiom(or(not(or(not(X0_59),X1_59)),or(not(or(X2_59,X0_59)),or(X2_59,X1_59))))),
inference(instantiation,[status(thm)],[0]) ).
cnf(3,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(cnf,[status(esa)],[axiom_1_4]) ).
cnf(l53,plain,
axiom(or(not(or(X0_31,X1_31)),or(X1_31,X0_31))) = true,
inference(instantiation,[status(thm)],[3]) ).
cnf(8,plain,
ifeq(theorem(or(not(X0),X1)),true,ifeq(axiom(or(not(X2),X0)),true,theorem(or(not(X2),X1)),true),true) = true,
inference(cnf,[status(esa)],[rule_3]) ).
cnf(l29,plain,
ifeq(theorem(or(not(X0_28),X1_28)),true,ifeq(axiom(or(not(X2_28),X0_28)),true,theorem(or(not(X2_28),X1_28)),true),true) = true,
inference(instantiation,[status(thm)],[8]) ).
cnf(l34,plain,
ifeq(theorem(or(not(or(q,not(p))),or(not(p),q))),true,ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),true) = true,
inference(instantiation,[status(thm)],[8]) ).
cnf(l52,plain,
ifeq(X0_30,X0_30,theorem(or(not(or(q,not(p))),or(not(p),q))),X2_30) = theorem(or(not(or(q,not(p))),or(not(p),q))),
inference(instantiation,[status(thm)],[0]) ).
cnf(2,plain,
axiom(or(not(X0),or(X1,X0))) = true,
inference(cnf,[status(esa)],[axiom_1_3]) ).
cnf(l36,plain,
axiom(or(not(X0_36),or(X1_36,X0_36))) = true,
inference(instantiation,[status(thm)],[2]) ).
cnf(l33,plain,
ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true) = theorem(or(not(or(q,not(p))),or(not(p),q))),
inference(instantiation,[status(thm)],[0]) ).
cnf(l31,plain,
axiom(or(not(or(X0_31,X1_31)),or(X1_31,X0_31))) = true,
inference(instantiation,[status(thm)],[3]) ).
cnf(5,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) = true,
inference(cnf,[status(esa)],[axiom_1_6]) ).
cnf(l59,plain,
axiom(or(not(or(not(X0_59),X1_59)),or(not(or(X2_59,X0_59)),or(X2_59,X1_59)))) = true,
inference(instantiation,[status(thm)],[5]) ).
cnf(l30,plain,
ifeq(X0_30,X0_30,theorem(or(not(or(q,not(p))),or(not(p),q))),X2_30) = theorem(or(not(or(q,not(p))),or(not(p),q))),
inference(instantiation,[status(thm)],[0]) ).
cnf(6,plain,
ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(cnf,[status(esa)],[rule_1]) ).
cnf(l37,plain,
ifeq(axiom(or(not(or(q,not(p))),or(not(p),q))),true,theorem(or(not(or(q,not(p))),or(not(p),q))),true) = true,
inference(instantiation,[status(thm)],[6]) ).
cnf(l28,plain,
ifeq(theorem(or(not(X0_28),X1_28)),true,ifeq(axiom(or(not(X2_28),X0_28)),true,theorem(or(not(X2_28),X1_28)),true),true) = true,
inference(instantiation,[status(thm)],[8]) ).
cnf(l27,plain,
axiom(or(not(or(q,not(p))),or(not(p),q))) = true,
inference(instantiation,[status(thm)],[3]) ).
cnf(l55,plain,
axiom(or(not(not(p)),or(q,not(p)))) = true,
inference(instantiation,[status(thm)],[2]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l16,l5,l53,l29,l34,l52,l36,l33,l31,l59,l30,l37,l28,l27,l55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL186-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/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 11:51:42 UTC 2026
% 0.10/0.36 % 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: 3
% 0.10/0.37 % launching worker at depth: 4
% 0.10/0.37 % launching worker at depth: 8
% 0.10/0.37 % launching worker at depth: 2
% 0.10/0.37 % launching worker at depth: 7
% 0.10/0.37 % launching worker at depth: 5
% 0.10/0.37 % launching worker at depth: 9
% 0.10/0.37 % launching worker at depth: 10
% 0.14/0.37 % launching worker at depth: 11
% 2.71/0.71 % launching worker at depth: 12
% 254.20/32.34 % SZS status Theorem for theBenchmark
% 254.20/32.34 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------