%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL196-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/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:21 PM UTC 2026
% Result : Unsatisfiable 11.40s 1.85s
% Output : CNFRefutation 11.40s
% 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(or(p,or(p,q))),or(p,q))),
inference(cnf,[status(esa)],[prove_this]) ).
cnf(l0,plain,
~ theorem(or(not(or(p,or(p,q))),or(p,q))),
inference(instantiation,[status(thm)],[8]) ).
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(l1,plain,
( ~ theorem(or(not(or(or(p,q),p)),or(p,q)))
| ~ axiom(or(not(or(p,or(p,q))),or(or(p,q),p)))
| theorem(or(not(or(p,or(p,q))),or(p,q))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l2,plain,
( ~ theorem(or(not(or(q,or(or(p,q),p))),or(p,q)))
| ~ axiom(or(not(or(or(p,q),p)),or(q,or(or(p,q),p))))
| theorem(or(not(or(or(p,q),p)),or(p,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(p,or(p,q))),or(or(p,q),p))),
inference(instantiation,[status(thm)],[2]) ).
cnf(l5,plain,
( ~ theorem(or(not(or(or(or(p,q),p),q)),or(p,q)))
| ~ axiom(or(not(or(q,or(or(p,q),p))),or(or(or(p,q),p),q)))
| theorem(or(not(or(q,or(or(p,q),p))),or(p,q))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l7,plain,
axiom(or(not(or(q,or(or(p,q),p))),or(or(or(p,q),p),q))),
inference(instantiation,[status(thm)],[2]) ).
cnf(1,plain,
axiom(or(not(X0),or(X1,X0))),
inference(cnf,[status(esa)],[axiom_1_3]) ).
cnf(l4,plain,
axiom(or(not(or(or(p,q),p)),or(q,or(or(p,q),p)))),
inference(instantiation,[status(thm)],[1]) ).
cnf(6,plain,
( ~ theorem(X0)
| ~ axiom(or(not(X0),X1))
| theorem(X1) ),
inference(cnf,[status(esa)],[rule_2]) ).
cnf(l6,plain,
( ~ theorem(or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(not(or(or(or(p,q),p),q)),or(p,q))))
| ~ axiom(or(not(or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(not(or(or(or(p,q),p),q)),or(p,q)))),or(not(or(or(or(p,q),p),q)),or(p,q))))
| theorem(or(not(or(or(or(p,q),p),q)),or(p,q))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(0,plain,
axiom(or(not(or(X0,X0)),X0)),
inference(cnf,[status(esa)],[axiom_1_2]) ).
cnf(l8,plain,
axiom(or(not(or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(not(or(or(or(p,q),p),q)),or(p,q)))),or(not(or(or(or(p,q),p),q)),or(p,q)))),
inference(instantiation,[status(thm)],[0]) ).
cnf(l9,plain,
( ~ theorem(or(not(or(or(or(p,q),p),q)),or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(p,q))))
| ~ axiom(or(not(or(not(or(or(or(p,q),p),q)),or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(p,q)))),or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(not(or(or(or(p,q),p),q)),or(p,q)))))
| theorem(or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(not(or(or(or(p,q),p),q)),or(p,q)))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(3,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf,[status(esa)],[axiom_1_5]) ).
cnf(l11,plain,
axiom(or(not(or(not(or(or(or(p,q),p),q)),or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(p,q)))),or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(not(or(or(or(p,q),p),q)),or(p,q))))),
inference(instantiation,[status(thm)],[3]) ).
cnf(l10,plain,
( ~ theorem(or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(p,q)))
| ~ axiom(or(not(or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(p,q))),or(not(or(or(or(p,q),p),q)),or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(p,q)))))
| theorem(or(not(or(or(or(p,q),p),q)),or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(p,q)))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l14,plain,
axiom(or(not(or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(p,q))),or(not(or(or(or(p,q),p),q)),or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(p,q))))),
inference(instantiation,[status(thm)],[1]) ).
cnf(l12,plain,
( ~ theorem(or(or(p,q),or(not(or(or(or(p,q),p),q)),or(p,q))))
| ~ axiom(or(not(or(or(p,q),or(not(or(or(or(p,q),p),q)),or(p,q)))),or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(p,q))))
| theorem(or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(p,q))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l15,plain,
axiom(or(not(or(or(p,q),or(not(or(or(or(p,q),p),q)),or(p,q)))),or(or(not(or(or(or(p,q),p),q)),or(p,q)),or(p,q)))),
inference(instantiation,[status(thm)],[2]) ).
cnf(l13,plain,
( ~ theorem(or(not(or(or(or(p,q),p),q)),or(or(p,q),or(p,q))))
| ~ axiom(or(not(or(not(or(or(or(p,q),p),q)),or(or(p,q),or(p,q)))),or(or(p,q),or(not(or(or(or(p,q),p),q)),or(p,q)))))
| theorem(or(or(p,q),or(not(or(or(or(p,q),p),q)),or(p,q)))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l17,plain,
( ~ theorem(or(not(or(q,or(or(p,q),p))),or(or(p,q),or(p,q))))
| ~ axiom(or(not(or(or(or(p,q),p),q)),or(q,or(or(p,q),p))))
| theorem(or(not(or(or(or(p,q),p),q)),or(or(p,q),or(p,q)))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l16,plain,
axiom(or(not(or(not(or(or(or(p,q),p),q)),or(or(p,q),or(p,q)))),or(or(p,q),or(not(or(or(or(p,q),p),q)),or(p,q))))),
inference(instantiation,[status(thm)],[3]) ).
cnf(l20,plain,
axiom(or(not(or(or(or(p,q),p),q)),or(q,or(or(p,q),p)))),
inference(instantiation,[status(thm)],[2]) ).
cnf(l18,plain,
( ~ theorem(or(not(or(or(p,q),or(q,p))),or(or(p,q),or(p,q))))
| ~ axiom(or(not(or(q,or(or(p,q),p))),or(or(p,q),or(q,p))))
| theorem(or(not(or(q,or(or(p,q),p))),or(or(p,q),or(p,q)))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l19,plain,
( ~ theorem(or(not(or(q,p)),or(p,q)))
| ~ axiom(or(not(or(not(or(q,p)),or(p,q))),or(not(or(or(p,q),or(q,p))),or(or(p,q),or(p,q)))))
| theorem(or(not(or(or(p,q),or(q,p))),or(or(p,q),or(p,q)))) ),
inference(instantiation,[status(thm)],[6]) ).
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(l24,plain,
axiom(or(not(or(not(or(q,p)),or(p,q))),or(not(or(or(p,q),or(q,p))),or(or(p,q),or(p,q))))),
inference(instantiation,[status(thm)],[4]) ).
cnf(5,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf,[status(esa)],[rule_1]) ).
cnf(l22,plain,
( ~ axiom(or(not(or(q,p)),or(p,q)))
| theorem(or(not(or(q,p)),or(p,q))) ),
inference(instantiation,[status(thm)],[5]) ).
cnf(l21,plain,
axiom(or(not(or(q,or(or(p,q),p))),or(or(p,q),or(q,p)))),
inference(instantiation,[status(thm)],[3]) ).
cnf(l23,plain,
axiom(or(not(or(q,p)),or(p,q))),
inference(instantiation,[status(thm)],[2]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l5,l7,l4,l6,l8,l9,l11,l10,l14,l12,l15,l13,l17,l16,l20,l18,l19,l24,l22,l21,l23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL196-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n018.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sat Sep 5 04:11:48 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.37 % launching worker at depth: 1
% 0.11/0.37 % launching worker at depth: 5
% 0.11/0.37 % launching worker at depth: 3
% 0.11/0.37 % launching worker at depth: 4
% 0.11/0.37 % launching worker at depth: 8
% 0.11/0.37 % launching worker at depth: 2
% 0.11/0.37 % launching worker at depth: 7
% 0.11/0.37 % launching worker at depth: 6
% 0.11/0.37 % launching worker at depth: 9
% 0.11/0.37 % launching worker at depth: 10
% 0.11/0.37 % launching worker at depth: 11
% 0.11/0.38 % launching worker at depth: 12
% 0.11/0.41 % launching worker at depth: 13
% 0.83/0.57 % launching worker at depth: 14
% 4.26/0.96 % launching worker at depth: 15
% 11.40/1.85 % SZS status Theorem for theBenchmark
% 11.40/1.85 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------