%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL226-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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:27 PM UTC 2026
% Result : Unsatisfiable 237.38s 30.21s
% Output : CNFRefutation 237.38s
% 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(or(q,r),implies(or(not(r),s),or(q,s)))),
inference(cnf,[status(esa)],[prove_this]) ).
cnf(l0,plain,
~ theorem(implies(or(q,r),implies(or(not(r),s),or(q,s)))),
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(implies(r,s)),or(not(or(q,r)),or(q,s))))
| ~ theorem(implies(or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),implies(or(q,r),implies(implies(r,s),or(q,s)))))
| theorem(implies(or(q,r),implies(implies(r,s),or(q,s)))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l8,plain,
( ~ theorem(or(or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),implies(implies(r,s),or(not(or(q,r)),or(q,s)))))
| ~ theorem(implies(or(or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),implies(implies(r,s),or(not(or(q,r)),or(q,s)))),or(not(implies(r,s)),or(not(or(q,r)),or(q,s)))))
| theorem(or(not(implies(r,s)),or(not(or(q,r)),or(q,s)))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l14,plain,
( ~ theorem(implies(implies(r,s),or(not(or(q,r)),or(q,s))))
| ~ theorem(implies(implies(implies(r,s),or(not(or(q,r)),or(q,s))),or(or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),implies(implies(r,s),or(not(or(q,r)),or(q,s))))))
| theorem(or(or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),implies(implies(r,s),or(not(or(q,r)),or(q,s))))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(6,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf,[status(esa)],[rule_1]) ).
cnf(l16,plain,
( ~ axiom(implies(implies(implies(r,s),or(not(or(q,r)),or(q,s))),or(or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),implies(implies(r,s),or(not(or(q,r)),or(q,s))))))
| theorem(implies(implies(implies(r,s),or(not(or(q,r)),or(q,s))),or(or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),implies(implies(r,s),or(not(or(q,r)),or(q,s)))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l71,plain,
( ~ axiom(implies(or(implies(implies(r,s),or(not(or(q,r)),or(q,s))),implies(implies(r,s),or(not(or(q,r)),or(q,s)))),implies(implies(r,s),or(not(or(q,r)),or(q,s)))))
| theorem(implies(or(implies(implies(r,s),or(not(or(q,r)),or(q,s))),implies(implies(r,s),or(not(or(q,r)),or(q,s)))),implies(implies(r,s),or(not(or(q,r)),or(q,s))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(0,plain,
axiom(implies(or(X0,X0),X0)),
inference(cnf,[status(esa)],[axiom_1_2]) ).
cnf(l73,plain,
axiom(implies(or(implies(implies(r,s),or(not(or(q,r)),or(q,s))),implies(implies(r,s),or(not(or(q,r)),or(q,s)))),implies(implies(r,s),or(not(or(q,r)),or(q,s))))),
inference(instantiation,[status(thm)],[0]) ).
cnf(l44,plain,
( ~ axiom(implies(implies(r,s),implies(or(q,r),or(q,s))))
| theorem(implies(implies(r,s),implies(or(q,r),or(q,s)))) ),
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(implies(implies(r,s),or(not(or(q,r)),or(q,s))),or(or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),implies(implies(r,s),or(not(or(q,r)),or(q,s)))))),
inference(instantiation,[status(thm)],[1]) ).
cnf(5,plain,
implies(X0,X1) = or(not(X0),X1),
inference(cnf,[status(esa)],[implies_definition]) ).
cnf(l56,plain,
implies(or(q,r),or(q,s)) = or(not(or(q,r)),or(q,s)),
inference(instantiation,[status(thm)],[5]) ).
cnf(l28,plain,
implies(r,s) = or(not(r),s),
inference(instantiation,[status(thm)],[5]) ).
cnf(4,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(cnf,[status(esa)],[axiom_1_6]) ).
cnf(l45,plain,
axiom(implies(implies(r,s),implies(or(q,r),or(q,s)))),
inference(instantiation,[status(thm)],[4]) ).
cnf(l76,plain,
implies(implies(r,s),or(not(or(q,r)),or(q,s))) = or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),
inference(instantiation,[status(thm)],[5]) ).
cnf(l52,plain,
implies(implies(r,s),or(q,s)) = or(not(implies(r,s)),or(q,s)),
inference(instantiation,[status(thm)],[5]) ).
cnf(l80,plain,
implies(implies(r,s),or(not(or(q,r)),or(q,s))) = or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),
inference(instantiation,[status(thm)],[5]) ).
cnf(l24,plain,
implies(implies(r,s),or(not(or(q,r)),or(q,s))) = or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),
inference(instantiation,[status(thm)],[5]) ).
cnf(l115,plain,
( ~ axiom(implies(or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),or(not(or(q,r)),or(not(implies(r,s)),or(q,s)))))
| theorem(implies(or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),or(not(or(q,r)),or(not(implies(r,s)),or(q,s))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l35,plain,
implies(or(q,r),or(not(implies(r,s)),or(q,s))) = or(not(or(q,r)),or(not(implies(r,s)),or(q,s))),
inference(instantiation,[status(thm)],[5]) ).
cnf(l34,plain,
implies(implies(r,s),or(not(or(q,r)),or(q,s))) = or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),
inference(instantiation,[status(thm)],[5]) ).
cnf(3,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(cnf,[status(esa)],[axiom_1_5]) ).
cnf(l119,plain,
axiom(implies(or(not(implies(r,s)),or(not(or(q,r)),or(q,s))),or(not(or(q,r)),or(not(implies(r,s)),or(q,s))))),
inference(instantiation,[status(thm)],[3]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l3,l8,l14,l16,l71,l73,l44,l25,l56,l28,l45,l76,l52,l80,l24,l115,l35,l34,l119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL226-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n005.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 5 11:45:50 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.13/0.36 % launching worker at depth: 1
% 0.13/0.36 % launching worker at depth: 5
% 0.13/0.36 % launching worker at depth: 3
% 0.13/0.36 % launching worker at depth: 4
% 0.13/0.36 % launching worker at depth: 2
% 0.13/0.36 % launching worker at depth: 6
% 0.13/0.36 % launching worker at depth: 7
% 0.13/0.36 % launching worker at depth: 8
% 0.13/0.36 % launching worker at depth: 9
% 0.13/0.36 % launching worker at depth: 10
% 0.13/0.36 % launching worker at depth: 11
% 0.13/0.41 % launching worker at depth: 12
% 93.07/12.12 % launching worker at depth: 13
% 237.38/30.21 % SZS status Theorem for theBenchmark
% 237.38/30.21 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------