%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU109+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:55:26 PM UTC 2026
% Result : Theorem 7.31s 1.77s
% Output : CNFRefutation 7.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 94 ( 22 unt; 1 def)
% Number of atoms : 380 ( 15 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 401 ( 169 ~; 164 |; 57 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 135 ( 0 sgn 124 !; 11 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f31,axiom,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ( in(X2,X0)
& in(X1,X0) )
=> ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1) ).
fof(f32,axiom,
! [X0] :
( ( preboolean(X0)
& ~ empty(X0) )
=> in(empty_set,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_finsub_1) ).
fof(f35,conjecture,
! [X0] :
( ( preboolean(X0)
& ~ empty(X0) )
=> ! [X1] :
( ( preboolean(X1)
& ~ empty(X1) )
=> ( preboolean(set_intersection2(X0,X1))
& ~ empty(set_intersection2(X0,X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t21_finsub_1) ).
fof(f36,negated_conjecture,
~ ! [X0] :
( ( preboolean(X0)
& ~ empty(X0) )
=> ! [X1] :
( ( preboolean(X1)
& ~ empty(X1) )
=> ( preboolean(set_intersection2(X0,X1))
& ~ empty(set_intersection2(X0,X1)) ) ) ),
inference(negated_conjecture,[status(cth)],[f35]) ).
fof(f45,axiom,
! [X0,X1] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(f75,plain,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ~ in(X2,X0)
| ~ in(X1,X0)
| ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) ) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f76,plain,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ~ in(X2,X0)
| ~ in(X1,X0)
| ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) ) ) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
! [X0] :
( ~ preboolean(X0)
| empty(X0)
| in(empty_set,X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f78,plain,
! [X0] :
( ~ preboolean(X0)
| empty(X0)
| in(empty_set,X0) ),
inference(flattening,[],[f77]) ).
fof(f80,plain,
? [X0] :
( preboolean(X0)
& ~ empty(X0)
& ? [X1] :
( preboolean(X1)
& ~ empty(X1)
& ( ~ preboolean(set_intersection2(X0,X1))
| empty(set_intersection2(X0,X1)) ) ) ),
inference(ennf_transformation,[],[f36]) ).
fof(f81,plain,
? [X0] :
( preboolean(X0)
& ~ empty(X0)
& ? [X1] :
( preboolean(X1)
& ~ empty(X1)
& ( ~ preboolean(set_intersection2(X0,X1))
| empty(set_intersection2(X0,X1)) ) ) ),
inference(flattening,[],[f80]) ).
fof(f89,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f45]) ).
fof(f91,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| ( in(X3,X1)
& in(X3,X0) ) )
& ( ~ in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ( in(X3,X1)
& in(X3,X0) ) )
& ( ~ in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) ) )
| X2 = set_intersection2(X0,X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| ( in(X3,X1)
& in(X3,X0) ) )
& ( ~ in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ( in(X3,X1)
& in(X3,X0) ) )
& ( ~ in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) ) )
| X2 = set_intersection2(X0,X1) ) ),
inference(flattening,[],[f91]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| ( in(X4,X1)
& in(X4,X0) ) )
& ( ~ in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ( in(X3,X1)
& in(X3,X0) ) )
& ( ~ in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) ) )
| X2 = set_intersection2(X0,X1) ) ),
inference(rectify,[],[f92]) ).
fof(f94,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| ( in(X4,X1)
& in(X4,X0) ) )
& ( ~ in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ) ) )
& ( ( ( in(sK0(X0,X1,X2),X2)
| ( in(sK0(X0,X1,X2),X1)
& in(sK0(X0,X1,X2),X0) ) )
& ( ~ in(sK0(X0,X1,X2),X2)
| ~ in(sK0(X0,X1,X2),X1)
| ~ in(sK0(X0,X1,X2),X0) ) )
| X2 = set_intersection2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f93]) ).
fof(f105,plain,
! [X0] :
( ( ~ preboolean(X0)
| ! [X1,X2] :
( ~ in(X2,X0)
| ~ in(X1,X0)
| ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) ) ) )
& ( ? [X1,X2] :
( in(X2,X0)
& in(X1,X0)
& ( ~ in(set_difference(X1,X2),X0)
| ~ in(set_union2(X1,X2),X0) ) )
| preboolean(X0) ) ),
inference(nnf_transformation,[],[f76]) ).
fof(f106,plain,
! [X0] :
( ( ~ preboolean(X0)
| ! [X3,X4] :
( ~ in(X4,X0)
| ~ in(X3,X0)
| ( in(set_difference(X3,X4),X0)
& in(set_union2(X3,X4),X0) ) ) )
& ( ? [X1,X2] :
( in(X2,X0)
& in(X1,X0)
& ( ~ in(set_difference(X1,X2),X0)
| ~ in(set_union2(X1,X2),X0) ) )
| preboolean(X0) ) ),
inference(rectify,[],[f105]) ).
fof(f107,plain,
! [X0] :
( ( ~ preboolean(X0)
| ! [X3,X4] :
( ~ in(X4,X0)
| ~ in(X3,X0)
| ( in(set_difference(X3,X4),X0)
& in(set_union2(X3,X4),X0) ) ) )
& ( ( in(sK12(X0),X0)
& in(sK11(X0),X0)
& ( ~ in(set_difference(sK11(X0),sK12(X0)),X0)
| ~ in(set_union2(sK11(X0),sK12(X0)),X0) ) )
| preboolean(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12]),skolemize(X1,sK11(X0)),skolemize(X2,sK12(X0))],[f106]) ).
fof(f108,plain,
( preboolean(sK13)
& ~ empty(sK13)
& preboolean(sK14)
& ~ empty(sK14)
& ( ~ preboolean(set_intersection2(sK13,sK14))
| empty(set_intersection2(sK13,sK14)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14]),skolemize(X0,sK13),skolemize(X1,sK14)],[f81]) ).
fof(f117,plain,
! [X2,X0,X1,X4] :
( set_intersection2(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X1) ),
inference(cnf_transformation,[],[f94]) ).
fof(f118,plain,
! [X2,X0,X1,X4] :
( set_intersection2(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X0) ),
inference(cnf_transformation,[],[f94]) ).
fof(f119,plain,
! [X2,X0,X1,X4] :
( set_intersection2(X0,X1) != X2
| ~ in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ),
inference(cnf_transformation,[],[f94]) ).
fof(f160,plain,
! [X3,X0,X4] :
( ~ preboolean(X0)
| ~ in(X4,X0)
| ~ in(X3,X0)
| in(set_difference(X3,X4),X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f161,plain,
! [X3,X0,X4] :
( ~ preboolean(X0)
| ~ in(X4,X0)
| ~ in(X3,X0)
| in(set_union2(X3,X4),X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f162,plain,
! [X0] :
( in(sK12(X0),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f163,plain,
! [X0] :
( in(sK11(X0),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f164,plain,
! [X0] :
( ~ in(set_difference(sK11(X0),sK12(X0)),X0)
| ~ in(set_union2(sK11(X0),sK12(X0)),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f165,plain,
! [X0] :
( ~ preboolean(X0)
| empty(X0)
| in(empty_set,X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f168,plain,
preboolean(sK13),
inference(cnf_transformation,[],[f108]) ).
fof(f169,plain,
~ empty(sK13),
inference(cnf_transformation,[],[f108]) ).
fof(f170,plain,
preboolean(sK14),
inference(cnf_transformation,[],[f108]) ).
fof(f171,plain,
~ empty(sK14),
inference(cnf_transformation,[],[f108]) ).
fof(f172,plain,
( ~ preboolean(set_intersection2(sK13,sK14))
| empty(set_intersection2(sK13,sK14)) ),
inference(cnf_transformation,[],[f108]) ).
fof(f181,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f89]) ).
fof(f183,plain,
! [X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X0)
| in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f119]) ).
fof(f184,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f118]) ).
fof(f185,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f117]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,set_intersection2(X2,X1))
| ~ in(X0,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f183]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X1)
| ~ in(X0,set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f184]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ in(X0,set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_100,plain,
! [X0: $i] :
( preboolean(X0)
| ~ in(set_difference(sK11(X0),sK12(X0)),X0)
| ~ in(set_union2(sK11(X0),sK12(X0)),X0) ),
inference(cnf_transformation,[],[f164]) ).
tcf(c_101,plain,
! [X0: $i] :
( preboolean(X0)
| in(sK11(X0),X0) ),
inference(cnf_transformation,[],[f163]) ).
tcf(c_102,plain,
! [X0: $i] :
( preboolean(X0)
| in(sK12(X0),X0) ),
inference(cnf_transformation,[],[f162]) ).
tcf(c_103,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(set_union2(X2,X0),X1)
| ~ preboolean(X1)
| ~ in(X2,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f161]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(set_difference(X2,X0),X1)
| ~ preboolean(X1)
| ~ in(X2,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f160]) ).
tcf(c_105,plain,
! [X0: $i] :
( empty(X0)
| in(empty_set,X0)
| ~ preboolean(X0) ),
inference(cnf_transformation,[],[f165]) ).
tcf(c_108,negated_conjecture,
( empty(set_intersection2(sK13,sK14))
| ~ preboolean(set_intersection2(sK13,sK14)) ),
inference(cnf_transformation,[],[f172]) ).
tcf(c_109,negated_conjecture,
~ empty(sK14),
inference(cnf_transformation,[],[f171]) ).
tcf(c_110,negated_conjecture,
preboolean(sK14),
inference(cnf_transformation,[],[f170]) ).
tcf(c_111,negated_conjecture,
~ empty(sK13),
inference(cnf_transformation,[],[f169]) ).
tcf(c_112,negated_conjecture,
preboolean(sK13),
inference(cnf_transformation,[],[f168]) ).
tcf(c_121,plain,
! [X0: $i,X1: $i] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f181]) ).
tcf(c_909,plain,
! [X0: $i] :
( empty(X0)
| in(empty_set,X0)
| ( X0 != sK14 ) ),
inference(resolution_lifted,[status(thm)],[c_105,c_110]) ).
tcf(c_910,plain,
( empty(sK14)
| in(empty_set,sK14) ),
inference(unflattening,[status(thm)],[c_909]) ).
tcf(c_916,plain,
! [X0: $i] :
( empty(X0)
| in(empty_set,X0)
| ( X0 != sK13 ) ),
inference(resolution_lifted,[status(thm)],[c_105,c_112]) ).
tcf(c_917,plain,
( empty(sK13)
| in(empty_set,sK13) ),
inference(unflattening,[status(thm)],[c_916]) ).
tcf(c_1753,definition,
iPr_def_10 = set_intersection2(sK13,sK14),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1754,negated_conjecture,
preboolean(sK13),
inference(demodulation,[status(thm)],[c_112]) ).
tcf(c_1756,negated_conjecture,
preboolean(sK14),
inference(demodulation,[status(thm)],[c_110]) ).
tcf(c_1758,negated_conjecture,
( empty(iPr_def_10)
| ~ preboolean(iPr_def_10) ),
inference(demodulation,[status(thm)],[c_108,c_1753]) ).
tcf(c_2425,plain,
! [X0: $i] :
( in(X0,sK13)
| ~ in(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1753,c_61]) ).
tcf(c_2467,plain,
( preboolean(iPr_def_10)
| in(sK11(iPr_def_10),sK13) ),
inference(superposition,[status(thm)],[c_101,c_2425]) ).
tcf(c_2468,plain,
( preboolean(iPr_def_10)
| in(sK12(iPr_def_10),sK13) ),
inference(superposition,[status(thm)],[c_102,c_2425]) ).
tcf(c_2469,plain,
( empty(iPr_def_10)
| in(empty_set,sK13)
| ~ preboolean(iPr_def_10) ),
inference(superposition,[status(thm)],[c_105,c_2425]) ).
tcf(c_2517,plain,
! [X0: $i] :
( in(X0,sK14)
| ~ in(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1753,c_62]) ).
tcf(c_2775,plain,
! [X0: $i] :
( in(X0,iPr_def_10)
| ~ in(X0,sK14)
| ~ in(X0,sK13) ),
inference(superposition,[status(thm)],[c_1753,c_60]) ).
tcf(c_2956,plain,
( preboolean(iPr_def_10)
| in(sK11(iPr_def_10),sK14) ),
inference(superposition,[status(thm)],[c_101,c_2517]) ).
tcf(c_2957,plain,
( preboolean(iPr_def_10)
| in(sK12(iPr_def_10),sK14) ),
inference(superposition,[status(thm)],[c_102,c_2517]) ).
tcf(c_2960,plain,
( empty(iPr_def_10)
| in(empty_set,sK14)
| ~ preboolean(iPr_def_10) ),
inference(superposition,[status(thm)],[c_105,c_2517]) ).
tcf(c_3309,plain,
in(empty_set,sK13),
inference(global_subsumption_just,[status(thm)],[c_2469,c_111,c_917]) ).
tcf(c_3319,plain,
in(empty_set,sK14),
inference(global_subsumption_just,[status(thm)],[c_2960,c_109,c_910]) ).
tcf(c_11140,plain,
! [X0: $i,X1: $i] :
( in(set_union2(X0,X1),iPr_def_10)
| ~ preboolean(sK14)
| ~ in(X1,sK14)
| ~ in(X0,sK14)
| ~ in(set_union2(X0,X1),sK13) ),
inference(superposition,[status(thm)],[c_103,c_2775]) ).
tcf(c_11141,plain,
! [X0: $i,X1: $i] :
( in(set_difference(X0,X1),iPr_def_10)
| ~ preboolean(sK14)
| ~ in(X1,sK14)
| ~ in(X0,sK14)
| ~ in(set_difference(X0,X1),sK13) ),
inference(superposition,[status(thm)],[c_104,c_2775]) ).
tcf(c_11143,plain,
( in(empty_set,iPr_def_10)
| ~ in(empty_set,sK13) ),
inference(superposition,[status(thm)],[c_3319,c_2775]) ).
tcf(c_11199,plain,
in(empty_set,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_11143,c_3309]) ).
tcf(c_11362,plain,
! [X0: $i,X1: $i] :
( in(set_difference(X0,X1),iPr_def_10)
| ~ in(X1,sK14)
| ~ in(X0,sK14)
| ~ in(set_difference(X0,X1),sK13) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11141,c_1756]) ).
tcf(c_11367,plain,
! [X0: $i,X1: $i] :
( in(set_union2(X0,X1),iPr_def_10)
| ~ in(X1,sK14)
| ~ in(X0,sK14)
| ~ in(set_union2(X0,X1),sK13) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11140,c_1756]) ).
tcf(c_11676,plain,
~ empty(iPr_def_10),
inference(superposition,[status(thm)],[c_11199,c_121]) ).
tcf(c_11728,plain,
~ preboolean(iPr_def_10),
inference(backward_subsumption_resolution,[status(thm)],[c_1758,c_11676]) ).
tcf(c_11781,plain,
in(sK12(iPr_def_10),sK14),
inference(backward_subsumption_resolution,[status(thm)],[c_2957,c_11728]) ).
tcf(c_11782,plain,
in(sK11(iPr_def_10),sK14),
inference(backward_subsumption_resolution,[status(thm)],[c_2956,c_11728]) ).
tcf(c_11787,plain,
in(sK12(iPr_def_10),sK13),
inference(backward_subsumption_resolution,[status(thm)],[c_2468,c_11728]) ).
tcf(c_11788,plain,
in(sK11(iPr_def_10),sK13),
inference(backward_subsumption_resolution,[status(thm)],[c_2467,c_11728]) ).
tcf(c_11892,plain,
! [X0: $i,X1: $i] :
( in(set_difference(X1,X0),iPr_def_10)
| ~ preboolean(sK13)
| ~ in(X1,sK14)
| ~ in(X1,sK13)
| ~ in(X0,sK14)
| ~ in(X0,sK13) ),
inference(superposition,[status(thm)],[c_104,c_11362]) ).
tcf(c_11898,plain,
! [X0: $i,X1: $i] :
( in(set_difference(X1,X0),iPr_def_10)
| ~ in(X1,sK14)
| ~ in(X1,sK13)
| ~ in(X0,sK14)
| ~ in(X0,sK13) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11892,c_1754]) ).
tcf(c_11913,plain,
! [X0: $i,X1: $i] :
( in(set_union2(X1,X0),iPr_def_10)
| ~ preboolean(sK13)
| ~ in(X1,sK14)
| ~ in(X1,sK13)
| ~ in(X0,sK14)
| ~ in(X0,sK13) ),
inference(superposition,[status(thm)],[c_103,c_11367]) ).
tcf(c_11928,plain,
! [X0: $i,X1: $i] :
( in(set_union2(X1,X0),iPr_def_10)
| ~ in(X1,sK14)
| ~ in(X1,sK13)
| ~ in(X0,sK14)
| ~ in(X0,sK13) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11913,c_1754]) ).
tcf(c_11993,plain,
( preboolean(iPr_def_10)
| ~ in(sK12(iPr_def_10),sK14)
| ~ in(sK12(iPr_def_10),sK13)
| ~ in(sK11(iPr_def_10),sK14)
| ~ in(sK11(iPr_def_10),sK13)
| ~ in(set_difference(sK11(iPr_def_10),sK12(iPr_def_10)),iPr_def_10) ),
inference(superposition,[status(thm)],[c_11928,c_100]) ).
tcf(c_12016,plain,
( ~ in(sK12(iPr_def_10),sK13)
| ~ in(sK11(iPr_def_10),sK13)
| ~ in(set_difference(sK11(iPr_def_10),sK12(iPr_def_10)),iPr_def_10) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11993,c_11728,c_11781,c_11782]) ).
tcf(c_12044,plain,
~ in(set_difference(sK11(iPr_def_10),sK12(iPr_def_10)),iPr_def_10),
inference(global_subsumption_just,[status(thm)],[c_12016,c_2468,c_2467,c_11728,c_12016]) ).
tcf(c_12047,plain,
( ~ in(sK12(iPr_def_10),sK14)
| ~ in(sK12(iPr_def_10),sK13)
| ~ in(sK11(iPr_def_10),sK14)
| ~ in(sK11(iPr_def_10),sK13) ),
inference(superposition,[status(thm)],[c_11898,c_12044]) ).
tcf(c_12048,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12047,c_11781,c_11787,c_11782,c_11788]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU109+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n026.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 12:48:39 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.44 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 7.31/1.77 % SZS status Started for theBenchmark.p
% 7.31/1.77 % SZS status Theorem for theBenchmark.p
% 7.31/1.77
% 7.31/1.77 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.31/1.77
% 7.31/1.77 % ------ iProver source info
% 7.31/1.77
% 7.31/1.77 % git: date: 2026-07-19 20:42:38 +0200
% 7.31/1.77 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.31/1.77 % git: non_committed_changes: false
% 7.31/1.77
% 7.31/1.77 % ------ Parsing...
% 7.31/1.77 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 7.31/1.77
% 7.31/1.77 % ------ Preprocessing... sup_sim: 0 sf_s rm: 12 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 7.31/1.77
% 7.31/1.77 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 7.31/1.77
% 7.31/1.77 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.31/1.77 % ------ Proving...
% 7.31/1.77 % ------ Problem Properties
% 7.31/1.77
% 7.31/1.77 %
% 7.31/1.77 % clauses 56
% 7.31/1.77 % conjectures 5
% 7.31/1.77 % EPR 18
% 7.31/1.77 % Horn 47
% 7.31/1.77 % unary 27
% 7.31/1.77 % binary 17
% 7.31/1.77 % lits 100
% 7.31/1.77 % lits eq 14
% 7.31/1.77 % fd_pure 0
% 7.31/1.77 % fd_pseudo 0
% 7.31/1.77 % fd_cond 1
% 7.31/1.77 % fd_pseudo_cond 4
% 7.31/1.77 % AC symbols 0
% 7.31/1.77
% 7.31/1.77 % ------ Schedule dynamic 5 is on
% 7.31/1.77
% 7.31/1.77 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.31/1.77
% 7.31/1.77
% 7.31/1.77 % ------
% 7.31/1.77 % Current options:
% 7.31/1.77 % ------
% 7.31/1.77
% 7.31/1.77
% 7.31/1.77 %
% 7.31/1.77
% 7.31/1.77 % ------ Proving...
% 7.31/1.77 %
% 7.31/1.77
% 7.31/1.77 % SZS status Theorem for theBenchmark.p
% 7.31/1.77
% 7.31/1.77 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.31/1.78
% 7.31/1.78
%------------------------------------------------------------------------------