%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL197-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n011.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.77s 1.43s
% Output : Proof 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 49 ( 41 unt; 0 def)
% Number of atoms : 61 ( 24 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 18 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 64 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f6,axiom,
( ~ axiom(X)
| theorem(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f6_nnf,plain,
! [X] :
( ~ axiom(X)
| theorem(X) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [X] :
( ~ axiom(X)
| theorem(X) ),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(hi6,axiom,
ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(f3,axiom,
axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f3_nnf,plain,
! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi4,axiom,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(f5,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f5_nnf,plain,
! [X,Y] : implies(X,Y) = or(not(X),Y),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [X,Y] : implies(X,Y) = or(not(X),Y),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
implies(X0,X1) = or(not(X0),X1),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(hi1,axiom,
implies(X0,X1) = or(not(X0),X1),
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(h6,plain,
theorem(or(not(or(q,or(p,q))),or(p,or(q,q)))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi4,hi1]) ).
cnf(f0,axiom,
axiom(implies(or(A,A),A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f0_nnf,plain,
! [A] : axiom(implies(or(A,A),A)),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [A] : axiom(implies(or(A,A),A)),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
axiom(implies(or(X0,X0),X0)),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
axiom(implies(or(X0,X0),X0)) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(h0,plain,
axiom(or(not(or(q,q)),q)) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi1]) ).
cnf(h1,plain,
theorem(or(not(or(q,q)),q)) = true,
inference(hyper_resolution,[status(thm)],[hi6,h0]) ).
cnf(f4,axiom,
axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f4_nnf,plain,
! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi5,axiom,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(h2,plain,
theorem(or(not(or(not(or(q,q)),q)),or(not(or(p,or(q,q))),or(p,q)))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi5,hi1]) ).
cnf(f7,axiom,
( ~ theorem(Y)
| ~ theorem(implies(Y,X))
| theorem(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f7_nnf,plain,
! [X,Y] :
( ~ theorem(Y)
| ~ theorem(implies(Y,X))
| theorem(X) ),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [X,Y] :
( ~ theorem(Y)
| ~ theorem(implies(Y,X))
| theorem(X) ),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c7,plain,
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(hi7,axiom,
ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
inference(equality_encoding,[status(esa)],[c7]) ).
cnf(h3,plain,
theorem(or(not(or(p,or(q,q))),or(p,q))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h2,h1,hi1]) ).
cnf(h4,plain,
theorem(or(not(or(not(or(p,or(q,q))),or(p,q))),or(not(or(not(or(q,or(p,q))),or(p,or(q,q)))),or(not(or(q,or(p,q))),or(p,q))))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi5,hi1]) ).
cnf(h5,plain,
theorem(or(not(or(not(or(q,or(p,q))),or(p,or(q,q)))),or(not(or(q,or(p,q))),or(p,q)))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h4,h3,hi1]) ).
cnf(t6,plain,
theorem(or(not(or(q,or(p,q))),or(p,q))) = true,
inference(hyper_resolution,[status(thm)],[hi7,h5,h6,hi1]) ).
cnf(t3,plain,
or(not(X1),X2) = implies(X1,X2),
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t11,plain,
or(not(X1),X2) = implies(X1,X2),
inference(orient,[status(thm)],[t3]) ).
cnf(t28,plain,
theorem(implies(or(q,or(p,q)),or(p,q))) = true,
inference(step,[status(thm)],[t6,t11]) ).
cnf(t27,plain,
theorem(implies(or(q,or(p,q)),or(p,q))) = true,
inference(orient,[status(thm)],[t28]) ).
cnf(f8,negated_conjecture,
~ theorem(implies(or(q,or(p,q)),or(p,q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f8_nnf,plain,
~ theorem(implies(or(q,or(p,q)),or(p,q))),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
~ theorem(implies(or(q,or(p,q)),or(p,q))),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
~ theorem(implies(or(q,or(p,q)),or(p,q))),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(goal_0,negated_conjecture,
theorem(implies(or(q,or(p,q)),or(p,q))) != true,
inference(equality_encoding,[status(esa)],[c8]) ).
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.04 % Problem : LCL197-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 22:17:27 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.77/1.43 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.77/1.43 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------