%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL225-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 : 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 : Fri Sep 25 02:01:26 PM UTC 2026
% Result : Unsatisfiable 17.60s 3.02s
% Output : CNFRefutation 17.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 3 RR)
% Number of literals : 26 ( 25 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-4 aty)
% Number of variables : 56 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(hi5,axiom,
ifeq(axiom(X),true,theorem(X),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(hi0,axiom,
axiom(or(not(or(A,A)),A)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h0,plain,
theorem(or(not(or(V0,V0)),V0)) = true,
inference(hyper_resolution,[status(thm)],[hi5,hi0]) ).
cnf(hi7,axiom,
ifeq(theorem(or(not(Y),Z)),true,ifeq(axiom(or(not(X),Y)),true,theorem(or(not(X),Z)),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(hi1,axiom,
axiom(or(not(A),or(B,A))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h2,plain,
theorem(or(not(V0),V0)) = true,
inference(hyper_resolution,[status(thm)],[hi7,h0,hi1]) ).
cnf(hi2,axiom,
axiom(or(not(or(A,B)),or(B,A))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h10,plain,
theorem(or(not(or(V0,V1)),or(V1,V0))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h2,hi2]) ).
cnf(h43,plain,
theorem(or(not(V0),or(V0,V1))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h10,hi1]) ).
cnf(hi6,axiom,
ifeq(theorem(Y),true,ifeq(axiom(or(not(Y),X)),true,theorem(X),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(hi4,axiom,
axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h3636,plain,
theorem(or(not(or(V0,V1)),or(V0,or(V1,V2)))) = true,
inference(hyper_resolution,[status(thm)],[hi6,h43,hi4]) ).
cnf(hi3,axiom,
axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h3657,plain,
theorem(or(V0,or(not(or(V0,V1)),or(V1,V2)))) = true,
inference(hyper_resolution,[status(thm)],[hi6,h3636,hi3]) ).
cnf(h3679,plain,
theorem(or(or(not(or(V0,V1)),or(V1,V2)),V0)) = true,
inference(hyper_resolution,[status(thm)],[hi6,h3657,hi2]) ).
cnf(h3704,plain,
theorem(or(V0,or(or(not(or(V1,V2)),or(V2,V3)),V1))) = true,
inference(hyper_resolution,[status(thm)],[hi6,h3679,hi1]) ).
cnf(h3871,plain,
theorem(or(or(not(or(V0,V1)),or(V1,V2)),or(V3,V0))) = true,
inference(hyper_resolution,[status(thm)],[hi6,h3704,hi3]) ).
cnf(h4209,plain,
theorem(or(not(or(or(V0,V1),V0)),or(V0,V1))) = true,
inference(hyper_resolution,[status(thm)],[hi6,h3871,hi0]) ).
cnf(h4211,plain,
theorem(or(not(or(V0,or(V0,V1))),or(V0,V1))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h4209,hi2]) ).
cnf(h4218,plain,
theorem(or(not(or(V0,or(V1,or(V1,V2)))),or(V0,or(V1,V2)))) = true,
inference(hyper_resolution,[status(thm)],[hi6,h4211,hi4]) ).
cnf(h8530,plain,
theorem(or(not(or(not(V0),or(V1,V2))),or(not(or(V1,V0)),or(V1,V2)))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h4218,hi4]) ).
cnf(t254,plain,
theorem(or(not(or(X1,or(not(X2),X3))),or(not(or(X1,X2)),or(X1,X3)))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h8530,hi3]) ).
cnf(t460,plain,
theorem(or(not(or(X1,or(not(X2),X3))),or(not(or(X1,X2)),or(X1,X3)))) = true,
inference(orient,[status(thm)],[t254]) ).
cnf(goal_0,negated_conjecture,
theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t460]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL225-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.07/0.35 % Computer : n018.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Wed Sep 23 22:29:47 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 17.60/3.02 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.60/3.02 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------