%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL175-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n008.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:11 PM UTC 2026
% Result : Unsatisfiable 6.93s 1.32s
% Output : Proof 6.93s
% Verified :
% Comments :
%------------------------------------------------------------------------------
cnf(t9,axiom,
sFlat0 = not(p),
introduced(definition) ).
cnf(t48,plain,
not(p) = sFlat0,
inference(orient,[status(thm)],[t9]) ).
cnf(t10,axiom,
sFlat1 = or(p,p),
introduced(definition) ).
cnf(t15,plain,
or(p,p) = sFlat1,
inference(orient,[status(thm)],[t10]) ).
cnf(t11,axiom,
sFlat2 = or(not(p),or(p,p)),
introduced(definition) ).
cnf(t14,plain,
or(not(p),or(p,p)) = sFlat2,
inference(orient,[status(thm)],[t11]) ).
cnf(t90,plain,
or(not(p),sFlat1) = sFlat2,
inference(step,[status(thm)],[t14,t15]) ).
cnf(t16,plain,
or(not(p),sFlat1) = sFlat2,
inference(rw,[status(thm)],[t90]) ).
cnf(t93,plain,
or(sFlat0,sFlat1) = sFlat2,
inference(step,[status(thm)],[t16,t48]) ).
cnf(t59,plain,
or(sFlat0,sFlat1) = sFlat2,
inference(orient,[status(thm)],[t93]) ).
cnf(t12,axiom,
sFlat3 = theorem(or(not(p),or(p,p))),
introduced(definition) ).
cnf(t91,plain,
sFlat3 = theorem(or(sFlat0,or(p,p))),
inference(step,[status(thm)],[t12,t48]) ).
cnf(t92,plain,
sFlat3 = theorem(or(sFlat0,sFlat1)),
inference(step,[status(thm)],[t91,t15]) ).
cnf(t55,plain,
theorem(or(sFlat0,sFlat1)) = sFlat3,
inference(orient,[status(thm)],[t92]) ).
cnf(t94,plain,
theorem(sFlat2) = sFlat3,
inference(step,[status(thm)],[t55,t59]) ).
cnf(t67,plain,
theorem(sFlat2) = sFlat3,
inference(rw,[status(thm)],[t94]) ).
cnf(t68,plain,
theorem(sFlat2) = sFlat3,
inference(orient,[status(thm)],[t67]) ).
cnf(f5,axiom,
( ~ axiom(X)
| theorem(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f5_nnf,plain,
! [X] :
( ~ axiom(X)
| theorem(X) ),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [X] :
( ~ axiom(X)
| theorem(X) ),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(t3,plain,
ifeq(axiom(X1),true,theorem(X1),true) = true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t30,plain,
ifeq(axiom(X1),true,theorem(X1),true) = true,
inference(orient,[status(thm)],[t3]) ).
cnf(f1,axiom,
axiom(or(not(A),or(B,A))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f1_nnf,plain,
! [A,B] : axiom(or(not(A),or(B,A))),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [A,B] : axiom(or(not(A),or(B,A))),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(t1,plain,
axiom(or(not(X1),or(X2,X1))) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t17,plain,
axiom(or(not(X1),or(X2,X1))) = true,
inference(orient,[status(thm)],[t1]) ).
cnf(t18,plain,
true = axiom(or(not(p),sFlat1)),
inference(cp,[status(thm)],[t17,t15]) ).
cnf(t95,plain,
true = axiom(or(sFlat0,sFlat1)),
inference(step,[status(thm)],[t18,t48]) ).
cnf(t96,plain,
true = axiom(sFlat2),
inference(step,[status(thm)],[t95,t59]) ).
cnf(t72,plain,
axiom(sFlat2) = true,
inference(orient,[status(thm)],[t96]) ).
cnf(t73,plain,
true = ifeq(true,true,theorem(sFlat2),true),
inference(cp,[status(thm)],[t30,t72]) ).
cnf(t0,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t13,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t0]) ).
cnf(t97,plain,
true = theorem(sFlat2),
inference(step,[status(thm)],[t73,t13]) ).
cnf(t98,plain,
true = sFlat3,
inference(step,[status(thm)],[t97,t68]) ).
cnf(t74,plain,
true = sFlat3,
inference(orient,[status(thm)],[t98]) ).
cnf(f8,negated_conjecture,
~ theorem(or(not(p),or(p,p))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f8_nnf,plain,
~ theorem(or(not(p),or(p,p))),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
~ theorem(or(not(p),or(p,p))),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
~ theorem(or(not(p),or(p,p))),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(goal_0,negated_conjecture,
theorem(or(not(p),or(p,p))) != true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(g0_0,plain,
theorem(or(sFlat0,or(p,p))) != true,
inference(rw,[status(thm)],[goal_0,t48]) ).
cnf(g0_1,plain,
theorem(or(sFlat0,sFlat1)) != true,
inference(rw,[status(thm)],[g0_0,t15]) ).
cnf(g0_2,plain,
theorem(sFlat2) != true,
inference(rw,[status(thm)],[g0_1,t59]) ).
cnf(g0_3,plain,
sFlat3 != true,
inference(rw,[status(thm)],[g0_2,t68]) ).
cnf(g0_4,plain,
sFlat3 != sFlat3,
inference(rw,[status(thm)],[g0_3,t74]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL175-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/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:11:09 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.93/1.32 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.93/1.32 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------