%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN399+1 : TPTP v9.2.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/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 05:37:01 PM UTC 2026
% Result : Theorem 0.25s 1.61s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 4 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 27 ( 10 ~; 8 |; 3 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 10 ( 4 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish223,conjecture,
( ! [X1] :
( f(X1)
<=> p )
=> ( ! [X2] : f(X2)
<=> p ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish223) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
( f(X1)
<=> p )
=> ( ! [X2] : f(X2)
<=> p ) ),
inference(assume_negation,[status(cth)],[kalish223]) ).
fof(c_0_2,negated_conjecture,
! [X5,X7] :
( ( ~ f(X5)
| p )
& ( ~ p
| f(X5) )
& ( ~ f(esk1_0)
| ~ p )
& ( f(X7)
| p ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3,negated_conjecture,
( f(X1)
| p ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( p
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ f(esk1_0)
| ~ p ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
p,
inference(csr,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( f(X1)
| ~ p ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
~ f(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).
cnf(c_0_9,negated_conjecture,
f(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_6])]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN399+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32 % Computer : n017.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Tue May 5 08:30:13 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 0.25/1.61 % Version : CSE_E---1.7
% 0.25/1.61 % Problem : theBenchmark.p
% 0.25/1.61 % SZS status Theorem for theBenchmark.p
% 0.25/1.61 % SZS output start CNFRefutation
% See solution above
% 0.25/1.61 % Total time : 1.271s
%------------------------------------------------------------------------------