%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET883+1 : TPTP v9.2.1. Released v3.2.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 : n004.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:08:54 PM UTC 2026
% Result : Theorem 0.24s 1.61s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 17
% Syntax : Number of formulae : 31 ( 15 unt; 0 def)
% Number of atoms : 55 ( 25 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 51 ( 27 ~; 20 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 45 ( 1 sgn 11 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t24_zfmisc_1,conjecture,
! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_zfmisc_1) ).
fof(rc2_xboole_0,axiom,
? [X1] : ~ empty(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_xboole_0) ).
fof(t6_zfmisc_1,axiom,
! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(i_0_5,negated_conjecture,
~ ! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t24_zfmisc_1]) ).
fof(i_0_6,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[rc2_xboole_0]) ).
fof(i_0_7,plain,
! [X16,X17] :
( ~ subset(singleton(X16),singleton(X17))
| X16 = X17 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_zfmisc_1])]) ).
fof(i_0_8,negated_conjecture,
( subset(singleton(esk3_0),singleton(esk4_0))
& esk3_0 != esk4_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_5])])]) ).
fof(i_0_9,plain,
! [X11] : subset(X11,X11),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(i_0_10,plain,
~ empty(esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[i_0_6])]) ).
fof(i_0_11,plain,
empty(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(i_0_12,plain,
( X1 = X2
| ~ subset(singleton(X1),singleton(X2)) ),
inference(split_conjunct,[status(thm)],[i_0_7]),
[final] ).
cnf(i_0_13,negated_conjecture,
subset(singleton(esk3_0),singleton(esk4_0)),
inference(split_conjunct,[status(thm)],[i_0_8]),
[final] ).
cnf(i_0_14,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[i_0_9]),
[final] ).
cnf(i_0_15,plain,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_16,plain,
empty(esk1_0),
inference(split_conjunct,[status(thm)],[i_0_11]),
[final] ).
cnf(i_0_17,negated_conjecture,
esk3_0 != esk4_0,
inference(split_conjunct,[status(thm)],[i_0_8]),
[final] ).
cnf(i_0_18,axiom,
X1 = X1 ).
cnf(i_0_19,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_20,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_21,axiom,
( X1 != X2
| ~ subset(X1,X3)
| subset(X2,X3) ) ).
cnf(i_0_22,axiom,
( X1 != X2
| ~ subset(X3,X1)
| subset(X3,X2) ) ).
cnf(i_0_23,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_18_001,axiom,
X1 = X1 ).
cnf(i_0_19_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_20_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_21_004,axiom,
( X1 != X2
| ~ subset(X1,X3)
| subset(X2,X3) ) ).
cnf(i_0_22_005,axiom,
( X1 != X2
| ~ subset(X3,X1)
| subset(X3,X2) ) ).
cnf(i_0_23_006,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_24,plain,
$false,
inference(scs_inference,[],[i_0_17,i_0_13,i_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET883+1 : TPTP v9.2.1. Released v3.2.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.13/0.32 % Computer : n004.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 5 02:38:32 EDT 2026
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % start to proof: theBenchmark
% 0.24/1.61 % Version : CSE_E---1.7
% 0.24/1.61 % Problem : theBenchmark.p
% 0.24/1.61 % SZS status Theorem for theBenchmark.p
% 0.24/1.61 % SZS output start CNFRefutation
% See solution above
% 0.24/1.62 % Total time : 1.272s
%------------------------------------------------------------------------------