%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL230+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/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:28 PM UTC 2026
% Result : Theorem 6.16s 6.29s
% Output : Proof 6.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 20 unt; 0 def)
% Number of atoms : 48 ( 17 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 41 ( 17 ~; 10 |; 8 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ( ( q
| p )
=> ( r
| p ) )
=> ( ( q
=> r )
| p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel5) ).
fof(f0_neg,negated_conjecture,
~ ( ( ( q
| p )
=> ( r
| p ) )
=> ( ( q
=> r )
| p ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ~ r
& q
& ~ p
& ( r
| p
| ( ~ q
& ~ p ) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
( ~ r
& q
& ~ p
& ( r
| p
| ( ~ q
& ~ p ) ) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c4,plain,
~ r,
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t1,plain,
r = false,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(c2,plain,
~ p,
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t0,plain,
p = false,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t22,plain,
false = p,
inference(orient,[status(thm)],[t0]) ).
cnf(t37,plain,
r = p,
inference(step,[status(thm)],[t1,t22]) ).
cnf(t27,plain,
p = r,
inference(orient,[status(thm)],[t37]) ).
cnf(t3,plain,
or(X1,false) = X1,
introduced(definition) ).
cnf(t12,plain,
or(X1,false) = X1,
inference(orient,[status(thm)],[t3]) ).
cnf(t33,plain,
or(X1,p) = X1,
inference(step,[status(thm)],[t12,t22]) ).
cnf(t23,plain,
or(X1,p) = X1,
inference(rw,[status(thm)],[t33]) ).
cnf(t41,plain,
or(X1,r) = X1,
inference(step,[status(thm)],[t23,t27]) ).
cnf(t31,plain,
or(X1,r) = X1,
inference(orient,[status(thm)],[t41]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c2,c4]) ).
cnf(g0_0,plain,
p != false,
inference(rw,[status(thm)],[goal_0]) ).
cnf(g0_1,plain,
r != false,
inference(rw,[status(thm)],[g0_0,t27]) ).
cnf(g0_2,plain,
r != or(p,r),
inference(rw,[status(thm)],[g0_1]) ).
cnf(g0_3,plain,
r != or(r,r),
inference(rw,[status(thm)],[g0_2,t27]) ).
cnf(g0_4,plain,
r != r,
inference(rw,[status(thm)],[g0_3,t31]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL230+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/5.44 % Computer : n008.cluster.edu
% 0.16/5.44 % Model : x86_64 x86_64
% 0.16/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.44 % Memory : 8046.5625MB
% 0.16/5.44 % OS : Linux 6.8.0-71-generic
% 0.16/5.44 % CPULimit : 300
% 0.16/5.44 % WCLimit : 300
% 0.16/5.44 % DateTime : Wed Sep 23 22:30:01 UTC 2026
% 0.16/5.44 % CPUTime :
% 0.16/5.44 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.16/6.29 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.16/6.29 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------