%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL230+1 : TPTP v9.2.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:39:49 PM UTC 2026
% Result : Theorem 0.25s 1.62s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 4 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 30 ( 8 ~; 12 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel5,conjecture,
( ( ( p
| q )
=> ( p
| r ) )
=> ( p
| ( q
=> r ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel5) ).
fof(i_0_1,negated_conjecture,
~ ( ( ( p
| q )
=> ( p
| r ) )
=> ( p
| ( q
=> r ) ) ),
inference(assume_negation,[status(cth)],[pel5]) ).
fof(i_0_2,negated_conjecture,
( ( ~ p
| p
| r )
& ( ~ q
| p
| r )
& ~ p
& q
& ~ r ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_1])]) ).
cnf(i_0_3,negated_conjecture,
( p
| r
| ~ q ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_4,negated_conjecture,
~ r,
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_5,negated_conjecture,
~ p,
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_6,negated_conjecture,
q,
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_7,plain,
$false,
inference(scs_inference,[],[i_0_5,i_0_4,i_0_6,i_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL230+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n017.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 22:12:57 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 0.25/1.62 % Version : CSE_E---1.7
% 0.25/1.62 % Problem : theBenchmark.p
% 0.25/1.62 % SZS status Theorem for theBenchmark.p
% 0.25/1.62 % SZS output start CNFRefutation
% See solution above
% 0.25/1.64 % Total time : 1.271s
%------------------------------------------------------------------------------