%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN396+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 : n024.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.12s 1.51s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 2 unt; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 17 ( 10 ~; 4 |; 1 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 8 ( 2 sgn 4 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish203,conjecture,
( ~ ! [X1] : f(X1)
<=> ? [X2] : ~ f(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish203) ).
fof(i_0_1,negated_conjecture,
~ ( ~ ! [X1] : f(X1)
<=> ? [X2] : ~ f(X2) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[kalish203])]) ).
fof(i_0_2,negated_conjecture,
! [X5,X6] :
( ( f(X5)
| f(X6) )
& ( ~ f(esk1_0)
| ~ f(esk2_0) ) ),
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,
( ~ f(esk1_0)
| ~ f(esk2_0) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_4,negated_conjecture,
( f(X1)
| f(X2) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_5,plain,
~ f(esk2_0),
inference(scs_inference,[],[i_0_3,i_0_4]) ).
cnf(i_0_6,plain,
$false,
inference(scs_inference,[],[i_0_5,i_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SYN396+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.06 % 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.06/0.24 % Computer : n024.cluster.edu
% 0.06/0.24 % Model : x86_64 x86_64
% 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24 % Memory : 8042.1875MB
% 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24 % CPULimit : 300
% 0.06/0.24 % WCLimit : 300
% 0.06/0.24 % DateTime : Tue May 5 03:41:41 EDT 2026
% 0.06/0.24 % CPUTime :
% 0.06/0.25 % start to proof: theBenchmark
% 0.12/1.51 % Version : CSE_E---1.7
% 0.12/1.51 % Problem : theBenchmark.p
% 0.12/1.51 % SZS status Theorem for theBenchmark.p
% 0.12/1.51 % SZS output start CNFRefutation
% See solution above
% 0.12/1.52 % Total time : 1.261s
%------------------------------------------------------------------------------