%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU127+1 : TPTP v9.2.1. Released v3.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 : n006.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:41 PM UTC 2026
% Result : Theorem 1.27s 1.72s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 55 ( 11 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 56 ( 20 ~; 24 |; 8 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 48 ( 4 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(t17_xboole_1,conjecture,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_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(c_0_4,plain,
! [X40,X41,X42,X43,X44,X45,X46,X47] :
( ( in(X43,X40)
| ~ in(X43,X42)
| X42 != set_intersection2(X40,X41) )
& ( in(X43,X41)
| ~ in(X43,X42)
| X42 != set_intersection2(X40,X41) )
& ( ~ in(X44,X40)
| ~ in(X44,X41)
| in(X44,X42)
| X42 != set_intersection2(X40,X41) )
& ( ~ in(esk2_3(X45,X46,X47),X47)
| ~ in(esk2_3(X45,X46,X47),X45)
| ~ in(esk2_3(X45,X46,X47),X46)
| X47 = set_intersection2(X45,X46) )
& ( in(esk2_3(X45,X46,X47),X45)
| in(esk2_3(X45,X46,X47),X47)
| X47 = set_intersection2(X45,X46) )
& ( in(esk2_3(X45,X46,X47),X46)
| in(esk2_3(X45,X46,X47),X47)
| X47 = set_intersection2(X45,X46) ) ),
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)],[d3_xboole_0])])])])])]) ).
cnf(c_0_5,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X34,X35,X36,X37,X38] :
( ( ~ subset(X34,X35)
| ~ in(X36,X34)
| in(X36,X35) )
& ( in(esk1_2(X37,X38),X37)
| subset(X37,X38) )
& ( ~ in(esk1_2(X37,X38),X38)
| subset(X37,X38) ) ),
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)],[d3_tarski])])])])])]) ).
cnf(c_0_7,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] : subset(set_intersection2(X1,X2),X1),
inference(assume_negation,[status(cth)],[t17_xboole_1]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( subset(set_intersection2(X1,X2),X3)
| in(esk1_2(set_intersection2(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_12,plain,
! [X32,X33] : set_intersection2(X32,X33) = set_intersection2(X33,X32),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_13,negated_conjecture,
~ subset(set_intersection2(esk5_0,esk6_0),esk5_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_14,plain,
subset(set_intersection2(X1,X2),X2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ subset(set_intersection2(esk5_0,esk6_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
subset(set_intersection2(X1,X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU127+1 : TPTP v9.2.1. Released v3.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 : n006.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 02:44:16 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.27/1.72 % Version : CSE_E---1.7
% 1.27/1.72 % Problem : theBenchmark.p
% 1.27/1.72 % SZS status Theorem for theBenchmark.p
% 1.27/1.72 % SZS output start CNFRefutation
% See solution above
% 1.27/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------