%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL268-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 : n028.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:32 PM UTC 2026
% Result : Unsatisfiable 233.19s 29.79s
% Output : CNFRefutation 233.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named prove_thisERROR: Could not build tree for root finalERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(10,plain,
~ theorem(equivalent(p,p)),
inference(cnf,[status(esa)],[prove_this]) ).
cnf(l0,plain,
~ theorem(equivalent(p,p)),
inference(instantiation,[status(thm)],[10]) ).
cnf(7,plain,
( ~ theorem(X0)
| ~ theorem(implies(X0,X1))
| theorem(X1) ),
inference(cnf,[status(esa)],[rule_2]) ).
cnf(l1,plain,
( ~ theorem(implies(p,p))
| ~ theorem(implies(implies(p,p),equivalent(p,p)))
| theorem(equivalent(p,p)) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l3,plain,
( ~ theorem(or(and(implies(p,p),implies(p,p)),not(implies(p,p))))
| ~ theorem(implies(or(and(implies(p,p),implies(p,p)),not(implies(p,p))),implies(implies(p,p),equivalent(p,p))))
| theorem(implies(implies(p,p),equivalent(p,p))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(6,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf,[status(esa)],[rule_1]) ).
cnf(l14,plain,
( ~ axiom(implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p))))
| theorem(implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p)))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(5,plain,
implies(X0,X1) = or(not(X0),X1),
inference(cnf,[status(esa)],[implies_definition]) ).
cnf(l18,plain,
implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p))) = or(not(or(not(implies(p,p)),not(implies(p,p)))),not(implies(p,p))),
inference(instantiation,[status(thm)],[5]) ).
cnf(l4,plain,
( ~ theorem(or(not(p),or(p,p)))
| ~ theorem(implies(or(not(p),or(p,p)),or(not(p),p)))
| theorem(or(not(p),p)) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l37,plain,
( ~ theorem(implies(or(p,p),p))
| ~ theorem(implies(implies(or(p,p),p),implies(or(not(p),or(p,p)),or(not(p),p))))
| theorem(implies(or(not(p),or(p,p)),or(not(p),p))) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l38,plain,
( ~ axiom(implies(or(p,p),p))
| theorem(implies(or(p,p),p)) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(0,plain,
axiom(implies(or(X0,X0),X0)),
inference(cnf,[status(esa)],[axiom_1_2]) ).
cnf(l39,plain,
axiom(implies(or(p,p),p)),
inference(instantiation,[status(thm)],[0]) ).
cnf(l41,plain,
( ~ axiom(implies(implies(or(p,p),p),implies(or(not(p),or(p,p)),or(not(p),p))))
| theorem(implies(implies(or(p,p),p),implies(or(not(p),or(p,p)),or(not(p),p)))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l16,plain,
implies(implies(p,p),equivalent(p,p)) = or(not(implies(p,p)),equivalent(p,p)),
inference(instantiation,[status(thm)],[5]) ).
cnf(l17,plain,
( ~ axiom(implies(or(equivalent(p,p),not(implies(p,p))),or(not(implies(p,p)),equivalent(p,p))))
| theorem(implies(or(equivalent(p,p),not(implies(p,p))),or(not(implies(p,p)),equivalent(p,p)))) ),
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(l43,plain,
axiom(implies(implies(or(p,p),p),implies(or(not(p),or(p,p)),or(not(p),p)))),
inference(instantiation,[status(thm)],[4]) ).
cnf(2,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
inference(cnf,[status(esa)],[axiom_1_4]) ).
cnf(l23,plain,
axiom(implies(or(equivalent(p,p),not(implies(p,p))),or(not(implies(p,p)),equivalent(p,p)))),
inference(instantiation,[status(thm)],[2]) ).
cnf(8,plain,
and(X0,X1) = not(or(not(X0),not(X1))),
inference(cnf,[status(esa)],[and_defn]) ).
cnf(l35,plain,
and(implies(p,p),implies(p,p)) = not(or(not(implies(p,p)),not(implies(p,p)))),
inference(instantiation,[status(thm)],[8]) ).
cnf(l40,plain,
implies(p,p) = or(not(p),p),
inference(instantiation,[status(thm)],[5]) ).
cnf(l6,plain,
( ~ axiom(or(not(p),or(p,p)))
| theorem(or(not(p),or(p,p))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l20,plain,
axiom(implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p)))),
inference(instantiation,[status(thm)],[0]) ).
cnf(9,plain,
equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(cnf,[status(esa)],[equivalent_defn]) ).
cnf(l12,plain,
equivalent(p,p) = and(implies(p,p),implies(p,p)),
inference(instantiation,[status(thm)],[9]) ).
cnf(l56,plain,
implies(p,or(p,p)) = or(not(p),or(p,p)),
inference(instantiation,[status(thm)],[5]) ).
cnf(1,plain,
axiom(implies(X0,or(X1,X0))),
inference(cnf,[status(esa)],[axiom_1_3]) ).
cnf(l55,plain,
axiom(implies(p,or(p,p))),
inference(instantiation,[status(thm)],[1]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l3,l14,l18,l4,l37,l38,l39,l41,l16,l17,l43,l23,l35,l40,l6,l20,l12,l56,l55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL268-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n028.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 5 00:23:29 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % launching worker at depth: 1
% 0.09/0.37 % launching worker at depth: 5
% 0.09/0.37 % launching worker at depth: 7
% 0.09/0.37 % launching worker at depth: 3
% 0.09/0.37 % launching worker at depth: 4
% 0.09/0.37 % launching worker at depth: 2
% 0.09/0.37 % launching worker at depth: 8
% 0.09/0.37 % launching worker at depth: 6
% 0.09/0.37 % launching worker at depth: 9
% 0.09/0.37 % launching worker at depth: 10
% 0.09/0.38 % launching worker at depth: 11
% 0.14/0.42 % launching worker at depth: 12
% 44.56/6.14 % launching worker at depth: 13
% 233.19/29.79 % SZS status Theorem for theBenchmark
% 233.19/29.79 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------