%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN936+1 : TPTP v9.2.1. Released v3.1.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 : n010.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:50:56 PM UTC 2026
% Result : Theorem 0.27s 1.60s
% Output : CNFRefutation 0.27s
% 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 |; 4 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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 : 12 ( 6 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ! [X1] :
( c
=> p(X1) )
<=> ( c
=> ! [X1] : p(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(i_0_1,negated_conjecture,
~ ( ! [X1] :
( c
=> p(X1) )
<=> ( c
=> ! [X1] : p(X1) ) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(i_0_2,negated_conjecture,
! [X6,X7] :
( ( c
| c )
& ( ~ p(esk2_0)
| c )
& ( c
| ~ p(esk1_0) )
& ( ~ p(esk2_0)
| ~ p(esk1_0) )
& ( ~ c
| p(X6)
| ~ c
| p(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(X1)
| p(X2)
| ~ c
| ~ c ),
inference(split_conjunct,[status(thm)],[i_0_2]) ).
cnf(i_0_4,negated_conjecture,
( c
| c ),
inference(split_conjunct,[status(thm)],[i_0_2]) ).
cnf(i_0_5,negated_conjecture,
( p(X2)
| p(X1)
| ~ c ),
inference(cn,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_6,negated_conjecture,
( ~ p(esk2_0)
| ~ p(esk1_0) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_7,negated_conjecture,
( c
| ~ p(esk2_0) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_8,negated_conjecture,
( c
| ~ p(esk1_0) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_9,negated_conjecture,
c,
inference(cn,[status(thm)],[i_0_4]),
[final] ).
cnf(i_0_10,plain,
( p(X1)
| p(X2) ),
inference(scs_inference,[],[i_0_9,i_0_5]) ).
cnf(i_0_11,plain,
~ p(esk1_0),
inference(scs_inference,[],[i_0_6,i_0_10]) ).
cnf(i_0_12,plain,
$false,
inference(scs_inference,[],[i_0_11,i_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN936+1 : TPTP v9.2.1. Released v3.1.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.14/0.32 % Computer : n010.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 08:49:21 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 0.27/1.60 % Version : CSE_E---1.7
% 0.27/1.60 % Problem : theBenchmark.p
% 0.27/1.60 % SZS status Theorem for theBenchmark.p
% 0.27/1.60 % SZS output start CNFRefutation
% See solution above
% 0.27/1.62 % Total time : 1.270s
%------------------------------------------------------------------------------