%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWW469+1 : TPTP v9.2.1. Released v5.3.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 : n019.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:32:26 PM UTC 2026
% Result : Theorem 1.25s 1.71s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 39 ( 11 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 40 ( 18 ~; 11 |; 6 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn 7 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
! [X2] :
( is_state(X2)
=> ~ ! [X1] :
( is_state(X1)
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
fof(fact_0_state__not__singleton__def,axiom,
( hoare_165779456gleton
<=> ? [X1,X2] :
( is_state(X1)
& is_state(X2)
& X1 != X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).
fof(conj_0,hypothesis,
hoare_165779456gleton,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(c_0_3,negated_conjecture,
~ ! [X2] :
( is_state(X2)
=> ~ ! [X1] :
( is_state(X1)
=> X1 = X2 ) ),
inference(assume_negation,[status(cth)],[conj_1]) ).
fof(c_0_4,plain,
! [X9,X10] :
( ( is_state(esk1_0)
| ~ hoare_165779456gleton )
& ( is_state(esk2_0)
| ~ hoare_165779456gleton )
& ( esk1_0 != esk2_0
| ~ hoare_165779456gleton )
& ( ~ is_state(X9)
| ~ is_state(X10)
| X9 = X10
| hoare_165779456gleton ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_state__not__singleton__def])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X12] :
( is_state(esk3_0)
& ( ~ is_state(X12)
| X12 = esk3_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( is_state(esk2_0)
| ~ hoare_165779456gleton ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
hoare_165779456gleton,
inference(split_conjunct,[status(thm)],[conj_0]) ).
cnf(c_0_8,plain,
( esk1_0 != esk2_0
| ~ hoare_165779456gleton ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( X1 = esk3_0
| ~ is_state(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
is_state(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_11,plain,
( is_state(esk1_0)
| ~ hoare_165779456gleton ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
esk2_0 != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 = esk3_0,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
is_state(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7])]) ).
cnf(c_0_15,plain,
esk1_0 != esk3_0,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW469+1 : TPTP v9.2.1. Released v5.3.0.
% 0.00/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 : n019.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 : Tue May 5 06:51:29 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.25/1.71 % Version : CSE_E---1.7
% 1.25/1.71 % Problem : theBenchmark.p
% 1.25/1.71 % SZS status Theorem for theBenchmark.p
% 1.25/1.71 % SZS output start CNFRefutation
% See solution above
% 1.25/1.71 % Total time : 1.368s
%------------------------------------------------------------------------------