%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU140+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/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:10:45 PM UTC 2026
% Result : Theorem 1.12s 1.66s
% Output : CNFRefutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 45 ( 15 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 15 ~; 10 |; 5 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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-2 aty)
% Number of variables : 34 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t63_xboole_1,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& disjoint(X2,X3) )
=> disjoint(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_xboole_1) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(t26_xboole_1,axiom,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(t3_xboole_1,axiom,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& disjoint(X2,X3) )
=> disjoint(X1,X3) ),
inference(assume_negation,[status(cth)],[t63_xboole_1]) ).
fof(c_0_6,plain,
! [X35,X36] :
( ( ~ disjoint(X35,X36)
| set_intersection2(X35,X36) = empty_set )
& ( set_intersection2(X35,X36) != empty_set
| disjoint(X35,X36) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])]) ).
fof(c_0_7,negated_conjecture,
( subset(esk3_0,esk4_0)
& disjoint(esk4_0,esk5_0)
& ~ disjoint(esk3_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X43,X44,X45] :
( ~ subset(X43,X44)
| subset(set_intersection2(X43,X45),set_intersection2(X44,X45)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t26_xboole_1])]) ).
cnf(c_0_9,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
disjoint(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X47] :
( ~ subset(X47,empty_set)
| X47 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_xboole_1])]) ).
cnf(c_0_12,plain,
( subset(set_intersection2(X1,X3),set_intersection2(X2,X3))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
set_intersection2(esk4_0,esk5_0) = empty_set,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ disjoint(esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_16,plain,
! [X33,X34] : set_intersection2(X33,X34) = set_intersection2(X34,X33),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_17,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( subset(set_intersection2(X1,esk5_0),empty_set)
| ~ subset(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
set_intersection2(esk3_0,esk5_0) != empty_set,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( set_intersection2(X1,esk5_0) = empty_set
| ~ subset(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
set_intersection2(esk5_0,esk3_0) != empty_set,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU140+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.10 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.07/0.29 % Computer : n024.cluster.edu
% 0.07/0.29 % Model : x86_64 x86_64
% 0.07/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.29 % Memory : 8042.1875MB
% 0.07/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.29 % CPULimit : 300
% 0.07/0.29 % WCLimit : 300
% 0.07/0.29 % DateTime : Mon May 4 21:44:26 EDT 2026
% 0.07/0.30 % CPUTime :
% 0.07/0.30 % start to proof: theBenchmark
% 1.12/1.66 % Version : CSE_E---1.7
% 1.12/1.66 % Problem : theBenchmark.p
% 1.12/1.66 % SZS status Theorem for theBenchmark.p
% 1.12/1.66 % SZS output start CNFRefutation
% See solution above
% 1.12/1.66 % Total time : 1.361s
%------------------------------------------------------------------------------