%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL186-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n016.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:15 PM UTC 2026
% Result : Unsatisfiable 5.67s 1.25s
% Output : CNFRefutation 5.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 3 RR)
% Number of literals : 10 ( 9 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 14 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(hi5,axiom,
ifeq(axiom(X),true,theorem(X),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(hi2,axiom,
axiom(or(not(or(A,B)),or(B,A))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h2,plain,
theorem(or(not(or(V0,V1)),or(V1,V0))) = true,
inference(hyper_resolution,[status(thm)],[hi5,hi2]) ).
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(t7,plain,
theorem(or(not(X1),or(X1,X2))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h2,hi1]) ).
cnf(t62,plain,
theorem(or(not(X1),or(X1,X2))) = true,
inference(orient,[status(thm)],[t7]) ).
cnf(goal_0,negated_conjecture,
theorem(or(not(not(p)),or(not(p),q))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t62]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL186-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.36 % Computer : n016.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Wed Sep 23 22:18:43 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.67/1.25 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.67/1.25 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------