%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL192-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n014.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 : Fri Sep 25 02:01:17 PM UTC 2026
% Result : Unsatisfiable 7.05s 1.35s
% Output : CNFRefutation 7.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 17 RR)
% Number of literals : 25 ( 24 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-4 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(hi6,axiom,
ifeq(axiom(X),true,theorem(X),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(hi3,axiom,
axiom(implies(or(A,B),or(B,A))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(hi1,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(h9,plain,
theorem(or(not(or(or(p,q),r)),or(r,or(p,q)))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi3,hi1]) ).
cnf(hi4,axiom,
axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(h7,plain,
theorem(or(not(or(r,or(p,q))),or(p,or(r,q)))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi4,hi1]) ).
cnf(hi5,axiom,
axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(h6,plain,
theorem(or(not(or(not(or(r,or(p,q))),or(p,or(r,q)))),or(not(or(not(or(or(p,q),r)),or(r,or(p,q)))),or(not(or(or(p,q),r)),or(p,or(r,q)))))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi5,hi1]) ).
cnf(hi7,axiom,
ifeq(theorem(implies(Y,X)),true,ifeq(theorem(Y),true,theorem(X),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(h8,plain,
theorem(or(not(or(not(or(or(p,q),r)),or(r,or(p,q)))),or(not(or(or(p,q),r)),or(p,or(r,q))))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h6,h7,hi1]) ).
cnf(h10,plain,
theorem(or(not(or(or(p,q),r)),or(p,or(r,q)))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h8,h9,hi1]) ).
cnf(h0,plain,
axiom(or(not(or(r,q)),or(q,r))) = true,
inference(hyper_resolution,[status(thm)],[hi3,hi1]) ).
cnf(h1,plain,
theorem(or(not(or(r,q)),or(q,r))) = true,
inference(hyper_resolution,[status(thm)],[hi6,h0]) ).
cnf(h3,plain,
theorem(or(not(or(not(or(r,q)),or(q,r))),or(not(or(p,or(r,q))),or(p,or(q,r))))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi5,hi1]) ).
cnf(h4,plain,
theorem(or(not(or(p,or(r,q))),or(p,or(q,r)))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h3,h1,hi1]) ).
cnf(h2,plain,
theorem(or(not(or(not(or(p,or(r,q))),or(p,or(q,r)))),or(not(or(not(or(or(p,q),r)),or(p,or(r,q)))),or(not(or(or(p,q),r)),or(p,or(q,r)))))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi5,hi1]) ).
cnf(h5,plain,
theorem(or(not(or(not(or(or(p,q),r)),or(p,or(r,q)))),or(not(or(or(p,q),r)),or(p,or(q,r))))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h2,h4,hi1]) ).
cnf(t8,plain,
theorem(or(not(or(or(p,q),r)),or(p,or(q,r)))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h5,h10,hi1]) ).
cnf(t3,axiom,
or(not(X1),X2) = implies(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t11,plain,
or(not(X1),X2) = implies(X1,X2),
inference(orient,[status(thm)],[t3]) ).
cnf(t28,plain,
theorem(implies(or(or(p,q),r),or(p,or(q,r)))) = true,
inference(step,[status(thm)],[t8,t11]) ).
cnf(t27,plain,
theorem(implies(or(or(p,q),r),or(p,or(q,r)))) = true,
inference(orient,[status(thm)],[t28]) ).
cnf(goal_0,negated_conjecture,
theorem(implies(or(or(p,q),r),or(p,or(q,r)))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t27]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL192-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n014.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.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 22:15:47 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.05/1.35 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.05/1.35 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------