%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET917+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 : n017.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:58 PM UTC 2026
% Result : Theorem 1.20s 1.71s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 28 ( 11 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 20 ( 10 ~; 6 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t58_zfmisc_1,conjecture,
! [X1,X2] :
( disjoint(singleton(X1),X2)
| set_intersection2(singleton(X1),X2) = singleton(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t58_zfmisc_1) ).
fof(l28_zfmisc_1,axiom,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_zfmisc_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(l32_zfmisc_1,axiom,
! [X1,X2] :
( in(X1,X2)
=> set_intersection2(X2,singleton(X1)) = singleton(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_zfmisc_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( disjoint(singleton(X1),X2)
| set_intersection2(singleton(X1),X2) = singleton(X1) ),
inference(assume_negation,[status(cth)],[t58_zfmisc_1]) ).
fof(c_0_5,plain,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(fof_simplification,[status(thm)],[l28_zfmisc_1]) ).
fof(c_0_6,negated_conjecture,
( ~ disjoint(singleton(esk3_0),esk4_0)
& set_intersection2(singleton(esk3_0),esk4_0) != singleton(esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X24,X25] :
( in(X24,X25)
| disjoint(singleton(X24),X25) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_8,plain,
! [X21,X22] : set_intersection2(X21,X22) = set_intersection2(X22,X21),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_9,plain,
! [X26,X27] :
( ~ in(X26,X27)
| set_intersection2(X27,singleton(X26)) = singleton(X26) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l32_zfmisc_1])]) ).
cnf(c_0_10,negated_conjecture,
~ disjoint(singleton(esk3_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( in(X1,X2)
| disjoint(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
set_intersection2(singleton(esk3_0),esk4_0) != singleton(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( set_intersection2(X2,singleton(X1)) = singleton(X1)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
in(esk3_0,esk4_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
set_intersection2(esk4_0,singleton(esk3_0)) != singleton(esk3_0),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET917+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 : n017.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:37:57 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.20/1.71 % Version : CSE_E---1.7
% 1.20/1.71 % Problem : theBenchmark.p
% 1.20/1.71 % SZS status Theorem for theBenchmark.p
% 1.20/1.71 % SZS output start CNFRefutation
% See solution above
% 1.20/1.71 % Total time : 1.370s
%------------------------------------------------------------------------------