%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL176-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 : n003.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:12 PM UTC 2026
% Result : Unsatisfiable 5.82s 6.17s
% Output : Proof 5.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 22 unt; 0 def)
% Number of atoms : 42 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 18 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-4 aty)
% Number of variables : 38 ( 3 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(hi5,axiom,
ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(f0,axiom,
axiom(or(not(or(A,A)),A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f0_nnf,plain,
! [A] : axiom(or(not(or(A,A)),A)),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [A] : axiom(or(not(or(A,A)),A)),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
axiom(or(not(or(X0,X0)),X0)) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(h0,plain,
theorem(or(not(or(V0,V0)),V0)) = true,
inference(hyper_resolution,[status(thm)],[hi5,hi0]) ).
cnf(f7,axiom,
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_3) ).
fof(f7_nnf,plain,
! [X,Z,Y] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [X,Z,Y] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c7,plain,
( ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2))
| theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(hi7,axiom,
ifeq(axiom(or(not(X0),X1)),true,ifeq(theorem(or(not(X1),X2)),true,theorem(or(not(X0),X2)),true),true) = true,
inference(equality_encoding,[status(esa)],[c7]) ).
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(hi1,axiom,
axiom(or(not(X0),or(X1,X0))) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t1,plain,
theorem(or(not(X1),X1)) = true,
inference(hyper_resolution,[status(thm)],[hi7,hi1,h0]) ).
cnf(t16,plain,
theorem(or(not(X1),X1)) = true,
inference(orient,[status(thm)],[t1]) ).
cnf(f8,negated_conjecture,
~ theorem(or(not(p),p)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f8_nnf,plain,
~ theorem(or(not(p),p)),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
~ theorem(or(not(p),p)),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
~ theorem(or(not(p),p)),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(goal_0,negated_conjecture,
theorem(or(not(p),p)) != true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t16]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL176-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/5.36 % Computer : n003.cluster.edu
% 0.08/5.36 % Model : x86_64 x86_64
% 0.08/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36 % Memory : 8046.5625MB
% 0.08/5.36 % OS : Linux 6.8.0-71-generic
% 0.08/5.36 % CPULimit : 300
% 0.08/5.36 % WCLimit : 300
% 0.08/5.36 % DateTime : Wed Sep 23 22:12:54 UTC 2026
% 0.08/5.37 % CPUTime :
% 0.08/5.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.82/6.17 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.82/6.17 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------