%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET576+3 : TPTP v9.2.1. Released v2.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 : n016.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:01 PM UTC 2026
% Result : Theorem 1.23s 1.71s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 3 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 45 ( 21 ~; 12 |; 5 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 20 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th17,conjecture,
! [X1,X2] :
( ! [X3] :
( member(X3,X1)
=> ~ member(X3,X2) )
=> disjoint(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th17) ).
fof(disjoint_defn,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).
fof(intersect_defn,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ! [X3] :
( member(X3,X1)
=> ~ member(X3,X2) )
=> disjoint(X1,X2) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_th17])]) ).
fof(c_0_4,plain,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
inference(fof_simplification,[status(thm)],[disjoint_defn]) ).
fof(c_0_5,negated_conjecture,
! [X26] :
( ( ~ member(X26,esk2_0)
| ~ member(X26,esk3_0) )
& ~ disjoint(esk2_0,esk3_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_6,plain,
! [X14,X15,X17,X18,X19] :
( ( member(esk1_2(X14,X15),X14)
| ~ intersect(X14,X15) )
& ( member(esk1_2(X14,X15),X15)
| ~ intersect(X14,X15) )
& ( ~ member(X19,X17)
| ~ member(X19,X18)
| intersect(X17,X18) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[intersect_defn])])])])])]) ).
fof(c_0_7,plain,
! [X20,X21] :
( ( ~ disjoint(X20,X21)
| ~ intersect(X20,X21) )
& ( intersect(X20,X21)
| disjoint(X20,X21) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
cnf(c_0_8,negated_conjecture,
( ~ member(X1,esk2_0)
| ~ member(X1,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ disjoint(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( intersect(X1,X2)
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( ~ member(esk1_2(X1,esk3_0),esk2_0)
| ~ intersect(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
intersect(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET576+3 : TPTP v9.2.1. Released v2.2.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.13/0.32 % Computer : n016.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:28:21 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.23/1.71 % Version : CSE_E---1.7
% 1.23/1.71 % Problem : theBenchmark.p
% 1.23/1.71 % SZS status Theorem for theBenchmark.p
% 1.23/1.71 % SZS output start CNFRefutation
% See solution above
% 1.23/1.71 % Total time : 1.370s
%------------------------------------------------------------------------------