%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL181+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n026.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:13 PM UTC 2026
% Result : Theorem 3.99s 1.01s
% Output : Proof 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 47 ( 19 ~; 14 |; 8 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 3 ( 2 usr; 3 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ( ~ p
=> q )
<=> ( ~ q
=> p ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel4) ).
fof(f0_neg,negated_conjecture,
~ ( ( ~ p
=> q )
<=> ( ~ q
=> p ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ( ( p
| q )
& ~ q
& ~ p )
| ( ~ p
& ~ q
& ( q
| p ) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
( ( ( p
| q )
& ~ q
& ~ p )
| ( ~ p
& ~ q
& ( q
| p ) ) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c2,plain,
( p
| q
| q
| p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p11,plain,
( q
| q
| p ),
inference(factoring,[status(thm)],[c2]) ).
cnf(p13,plain,
( q
| p ),
inference(factoring,[status(thm)],[p11]) ).
cnf(c4,plain,
( ~ q
| ~ q ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p9,plain,
~ q,
inference(factoring,[status(thm)],[c4]) ).
cnf(p14,plain,
p,
inference(resolution,[status(thm)],[p13,p9]) ).
cnf(c6,plain,
( ~ p
| ~ p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p10,plain,
~ p,
inference(factoring,[status(thm)],[c6]) ).
cnf(p15,plain,
$false,
inference(resolution,[status(thm)],[p14,p10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL181+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n026.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 22:14:54 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.99/1.01 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.99/1.01 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------