%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL169-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n005.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:07 PM UTC 2026
% Result : Unsatisfiable 6.30s 1.21s
% Output : Proof 6.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 22 unt; 0 def)
% Number of atoms : 30 ( 13 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 11 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-4 aty)
% Number of variables : 24 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f6,axiom,
( ~ axiom(X)
| theorem(X) ),
file('/export/starexec/sandbox/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(f0,axiom,
axiom(implies(or(A,A),A)),
file('/export/starexec/sandbox/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(f5,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox/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(t4,plain,
theorem(or(not(or(X1,X1)),X1)) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi0,hi1]) ).
cnf(t30,plain,
theorem(or(not(or(X1,X1)),X1)) = true,
inference(orient,[status(thm)],[t4]) ).
cnf(f8,negated_conjecture,
~ theorem(implies(implies(p,not(p)),not(p))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f8_nnf,plain,
~ theorem(implies(implies(p,not(p)),not(p))),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
~ theorem(implies(implies(p,not(p)),not(p))),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
~ theorem(implies(implies(p,not(p)),not(p))),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(u6,negated_conjecture,
theorem(implies(implies(p,not(p)),not(p))) != true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(d0,axiom,
implies(X0,X1) = or(not(X0),X1),
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(goal_0,negated_conjecture,
theorem(or(not(or(not(p),not(p))),not(p))) != true,
inference(definition_unfolding,[status(thm)],[u6,d0]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t30]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL169-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n005.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:08:47 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.30/1.21 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.30/1.21 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------