%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU128+2 : 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 : n020.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:42 PM UTC 2026
% Result : Theorem 1.71s 1.87s
% Output : CNFRefutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 69 ( 8 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 73 ( 26 ~; 29 |; 12 &)
% ( 3 <=>; 3 =>; 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 : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t19_xboole_1,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_xboole_1) ).
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(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(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
inference(assume_negation,[status(cth)],[t19_xboole_1]) ).
fof(c_0_4,negated_conjecture,
( subset(esk7_0,esk8_0)
& subset(esk7_0,esk9_0)
& ~ subset(esk7_0,set_intersection2(esk8_0,esk9_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X95,X96,X97,X98,X99] :
( ( ~ subset(X95,X96)
| ~ in(X97,X95)
| in(X97,X96) )
& ( in(esk3_2(X98,X99),X98)
| subset(X98,X99) )
& ( ~ in(esk3_2(X98,X99),X99)
| subset(X98,X99) ) ),
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_6,negated_conjecture,
~ subset(esk7_0,set_intersection2(esk8_0,esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X101,X102,X103,X104,X105,X106,X107,X108] :
( ( in(X104,X101)
| ~ in(X104,X103)
| X103 != set_intersection2(X101,X102) )
& ( in(X104,X102)
| ~ in(X104,X103)
| X103 != set_intersection2(X101,X102) )
& ( ~ in(X105,X101)
| ~ in(X105,X102)
| in(X105,X103)
| X103 != set_intersection2(X101,X102) )
& ( ~ in(esk4_3(X106,X107,X108),X108)
| ~ in(esk4_3(X106,X107,X108),X106)
| ~ in(esk4_3(X106,X107,X108),X107)
| X108 = set_intersection2(X106,X107) )
& ( in(esk4_3(X106,X107,X108),X106)
| in(esk4_3(X106,X107,X108),X108)
| X108 = set_intersection2(X106,X107) )
& ( in(esk4_3(X106,X107,X108),X107)
| in(esk4_3(X106,X107,X108),X108)
| X108 = set_intersection2(X106,X107) ) ),
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_9,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),esk7_0),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),X1)
| ~ subset(esk7_0,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
subset(esk7_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),esk9_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
subset(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),set_intersection2(X1,esk9_0))
| ~ in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),esk8_0),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),set_intersection2(esk8_0,esk9_0)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU128+2 : 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 : n020.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:45:05 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.71/1.87 % Version : CSE_E---1.7
% 1.71/1.87 % Problem : theBenchmark.p
% 1.71/1.87 % SZS status Theorem for theBenchmark.p
% 1.71/1.87 % SZS output start CNFRefutation
% See solution above
% 1.71/1.87 % Total time : 1.369s
%------------------------------------------------------------------------------