%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL195-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 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 : Fri Sep 25 02:01:18 PM UTC 2026
% Result : Unsatisfiable 7.94s 1.56s
% Output : CNFRefutation 7.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 25 RR)
% Number of literals : 33 ( 32 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 3 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/sandbox2/benchmark/theBenchmark.p') ).
cnf(hi5,axiom,
axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(hi1,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h16,plain,
theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(p,r)))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi5,hi1]) ).
cnf(h14,plain,
theorem(or(not(or(not(or(p,q)),or(p,r))),or(not(or(not(or(q,p)),or(p,q))),or(not(or(q,p)),or(p,r))))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi5,hi1]) ).
cnf(h13,plain,
theorem(or(not(or(not(or(not(or(p,q)),or(p,r))),or(not(or(not(or(q,p)),or(p,q))),or(not(or(q,p)),or(p,r))))),or(not(or(not(or(not(q),r)),or(not(or(p,q)),or(p,r)))),or(not(or(not(q),r)),or(not(or(not(or(q,p)),or(p,q))),or(not(or(q,p)),or(p,r))))))) = 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/sandbox2/benchmark/theBenchmark.p') ).
cnf(h15,plain,
theorem(or(not(or(not(or(not(q),r)),or(not(or(p,q)),or(p,r)))),or(not(or(not(q),r)),or(not(or(not(or(q,p)),or(p,q))),or(not(or(q,p)),or(p,r)))))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h13,h14,hi1]) ).
cnf(h17,plain,
theorem(or(not(or(not(q),r)),or(not(or(not(or(q,p)),or(p,q))),or(not(or(q,p)),or(p,r))))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h15,h16,hi1]) ).
cnf(hi3,axiom,
axiom(implies(or(A,B),or(B,A))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h11,plain,
theorem(or(not(or(q,p)),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/sandbox2/benchmark/theBenchmark.p') ).
cnf(h9,plain,
theorem(or(not(or(not(or(not(q),r)),or(not(or(not(or(q,p)),or(p,q))),or(not(or(q,p)),or(p,r))))),or(not(or(not(or(q,p)),or(p,q))),or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi4,hi1]) ).
cnf(h8,plain,
theorem(or(not(or(not(or(not(or(not(q),r)),or(not(or(not(or(q,p)),or(p,q))),or(not(or(q,p)),or(p,r))))),or(not(or(not(or(q,p)),or(p,q))),or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))))),or(not(or(not(or(q,p)),or(p,q))),or(not(or(not(or(not(q),r)),or(not(or(not(or(q,p)),or(p,q))),or(not(or(q,p)),or(p,r))))),or(not(or(not(q),r)),or(not(or(q,p)),or(p,r))))))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi4,hi1]) ).
cnf(h10,plain,
theorem(or(not(or(not(or(q,p)),or(p,q))),or(not(or(not(or(not(q),r)),or(not(or(not(or(q,p)),or(p,q))),or(not(or(q,p)),or(p,r))))),or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h8,h9,hi1]) ).
cnf(h12,plain,
theorem(or(not(or(not(or(not(q),r)),or(not(or(not(or(q,p)),or(p,q))),or(not(or(q,p)),or(p,r))))),or(not(or(not(q),r)),or(not(or(q,p)),or(p,r))))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h10,h11,hi1]) ).
cnf(h18,plain,
theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h12,h17,hi1]) ).
cnf(h2,plain,
axiom(or(not(or(p,r)),or(r,p))) = true,
inference(hyper_resolution,[status(thm)],[hi3,hi1]) ).
cnf(h3,plain,
theorem(or(not(or(p,r)),or(r,p))) = true,
inference(hyper_resolution,[status(thm)],[hi6,h2]) ).
cnf(h5,plain,
theorem(or(not(or(not(or(p,r)),or(r,p))),or(not(or(not(or(q,p)),or(p,r))),or(not(or(q,p)),or(r,p))))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi5,hi1]) ).
cnf(h6,plain,
theorem(or(not(or(not(or(q,p)),or(p,r))),or(not(or(q,p)),or(r,p)))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h5,h3,hi1]) ).
cnf(h4,plain,
theorem(or(not(or(not(or(not(or(q,p)),or(p,r))),or(not(or(q,p)),or(r,p)))),or(not(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi5,hi1]) ).
cnf(h7,plain,
theorem(or(not(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h4,h6,hi1]) ).
cnf(t9,plain,
theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h7,h18,hi1]) ).
cnf(t3,axiom,
or(not(X1),X2) = implies(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t11,plain,
or(not(X1),X2) = implies(X1,X2),
inference(orient,[status(thm)],[t3]) ).
cnf(t28,plain,
theorem(implies(or(not(q),r),or(not(or(q,p)),or(r,p)))) = true,
inference(step,[status(thm)],[t9,t11]) ).
cnf(t29,plain,
theorem(implies(implies(q,r),or(not(or(q,p)),or(r,p)))) = true,
inference(step,[status(thm)],[t28,t11]) ).
cnf(t30,plain,
theorem(implies(implies(q,r),implies(or(q,p),or(r,p)))) = true,
inference(step,[status(thm)],[t29,t11]) ).
cnf(t27,plain,
theorem(implies(implies(q,r),implies(or(q,p),or(r,p)))) = true,
inference(orient,[status(thm)],[t30]) ).
cnf(goal_0,negated_conjecture,
theorem(implies(implies(q,r),implies(or(q,p),or(r,p)))) != true,
file('/export/starexec/sandbox2/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 : LCL195-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n005.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 : Wed Sep 23 22:16:32 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.94/1.56 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.94/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------