%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN398+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 : n022.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.29s 1.62s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 42 ( 15 ~; 17 |; 8 &)
% ( 2 <=>; 0 =>; 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 : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 10 ( 4 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish215,conjecture,
( ! [X1] :
( p
& f(X1) )
<=> ( p
& ! [X2] : f(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish215) ).
fof(i_0_1,negated_conjecture,
~ ( ! [X1] :
( p
& f(X1) )
<=> ( p
& ! [X2] : f(X2) ) ),
inference(assume_negation,[status(cth)],[kalish215]) ).
fof(i_0_2,negated_conjecture,
! [X7,X8] :
( ( ~ p
| ~ f(esk1_0)
| ~ p
| ~ f(esk2_0) )
& ( p
| p )
& ( f(X8)
| p )
& ( p
| f(X7) )
& ( f(X8)
| f(X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_1])])])])]) ).
cnf(i_0_3,negated_conjecture,
( ~ p
| ~ f(esk1_0)
| ~ p
| ~ f(esk2_0) ),
inference(split_conjunct,[status(thm)],[i_0_2]) ).
cnf(i_0_4,negated_conjecture,
( p
| p ),
inference(split_conjunct,[status(thm)],[i_0_2]) ).
cnf(i_0_5,negated_conjecture,
( ~ p
| ~ f(esk1_0)
| ~ f(esk2_0) ),
inference(cn,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_6,negated_conjecture,
( f(X1)
| f(X2) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_7,negated_conjecture,
( f(X1)
| p ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_8,negated_conjecture,
( p
| f(X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_9,negated_conjecture,
p,
inference(cn,[status(thm)],[i_0_4]),
[final] ).
cnf(i_0_10,plain,
( ~ f(esk1_0)
| ~ f(esk2_0) ),
inference(scs_inference,[],[i_0_9,i_0_5]) ).
cnf(i_0_11,plain,
~ f(esk2_0),
inference(scs_inference,[],[i_0_6,i_0_10]) ).
cnf(i_0_12,plain,
$false,
inference(scs_inference,[],[i_0_11,i_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN398+1 : TPTP v9.2.1. Released v2.0.0.
% 0.12/0.12 % 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.16/0.33 % Computer : n022.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.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue May 5 08:31:36 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 0.29/1.62 % Version : CSE_E---1.7
% 0.29/1.62 % Problem : theBenchmark.p
% 0.29/1.62 % SZS status Theorem for theBenchmark.p
% 0.29/1.62 % SZS output start CNFRefutation
% See solution above
% 0.29/1.64 % Total time : 1.273s
%------------------------------------------------------------------------------