TSTP Solution File: SEU109+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU109+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 : Thu Aug 31 17:03:45 EDT 2023
% Result : Theorem 201.33s 27.48s
% Output : CNFRefutation 201.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 91 ( 9 unt; 0 def)
% Number of atoms : 360 ( 17 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 458 ( 189 ~; 177 |; 77 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 145 ( 3 sgn; 86 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',t10_finsub_1) ).
fof(f32,axiom,
! [X0] :
( ( preboolean(X0)
& ~ empty(X0) )
=> in(empty_set,X0) ),
file('/export/starexec/sandbox2/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/sandbox2/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,[],[f35]) ).
fof(f45,axiom,
! [X0,X1] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(f75,plain,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) )
| ~ in(X2,X0)
| ~ in(X1,X0) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f76,plain,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) )
| ~ in(X2,X0)
| ~ in(X1,X0) ) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
! [X0] :
( in(empty_set,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f78,plain,
! [X0] :
( in(empty_set,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(flattening,[],[f77]) ).
fof(f80,plain,
? [X0] :
( ? [X1] :
( ( ~ preboolean(set_intersection2(X0,X1))
| empty(set_intersection2(X0,X1)) )
& preboolean(X1)
& ~ empty(X1) )
& preboolean(X0)
& ~ empty(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f81,plain,
? [X0] :
( ? [X1] :
( ( ~ preboolean(set_intersection2(X0,X1))
| empty(set_intersection2(X0,X1)) )
& preboolean(X1)
& ~ empty(X1) )
& preboolean(X0)
& ~ empty(X0) ),
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,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f91]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f92]) ).
fof(f94,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,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) )
| in(sK0(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f95,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = 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) )
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f93,f94]) ).
fof(f116,plain,
! [X0] :
( ( preboolean(X0)
| ? [X1,X2] :
( ( ~ in(set_difference(X1,X2),X0)
| ~ in(set_union2(X1,X2),X0) )
& in(X2,X0)
& in(X1,X0) ) )
& ( ! [X1,X2] :
( ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) )
| ~ in(X2,X0)
| ~ in(X1,X0) )
| ~ preboolean(X0) ) ),
inference(nnf_transformation,[],[f76]) ).
fof(f117,plain,
! [X0] :
( ( preboolean(X0)
| ? [X1,X2] :
( ( ~ in(set_difference(X1,X2),X0)
| ~ in(set_union2(X1,X2),X0) )
& in(X2,X0)
& in(X1,X0) ) )
& ( ! [X3,X4] :
( ( in(set_difference(X3,X4),X0)
& in(set_union2(X3,X4),X0) )
| ~ in(X4,X0)
| ~ in(X3,X0) )
| ~ preboolean(X0) ) ),
inference(rectify,[],[f116]) ).
fof(f118,plain,
! [X0] :
( ? [X1,X2] :
( ( ~ in(set_difference(X1,X2),X0)
| ~ in(set_union2(X1,X2),X0) )
& in(X2,X0)
& in(X1,X0) )
=> ( ( ~ in(set_difference(sK11(X0),sK12(X0)),X0)
| ~ in(set_union2(sK11(X0),sK12(X0)),X0) )
& in(sK12(X0),X0)
& in(sK11(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
! [X0] :
( ( preboolean(X0)
| ( ( ~ in(set_difference(sK11(X0),sK12(X0)),X0)
| ~ in(set_union2(sK11(X0),sK12(X0)),X0) )
& in(sK12(X0),X0)
& in(sK11(X0),X0) ) )
& ( ! [X3,X4] :
( ( in(set_difference(X3,X4),X0)
& in(set_union2(X3,X4),X0) )
| ~ in(X4,X0)
| ~ in(X3,X0) )
| ~ preboolean(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12])],[f117,f118]) ).
fof(f120,plain,
( ? [X0] :
( ? [X1] :
( ( ~ preboolean(set_intersection2(X0,X1))
| empty(set_intersection2(X0,X1)) )
& preboolean(X1)
& ~ empty(X1) )
& preboolean(X0)
& ~ empty(X0) )
=> ( ? [X1] :
( ( ~ preboolean(set_intersection2(sK13,X1))
| empty(set_intersection2(sK13,X1)) )
& preboolean(X1)
& ~ empty(X1) )
& preboolean(sK13)
& ~ empty(sK13) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X1] :
( ( ~ preboolean(set_intersection2(sK13,X1))
| empty(set_intersection2(sK13,X1)) )
& preboolean(X1)
& ~ empty(X1) )
=> ( ( ~ preboolean(set_intersection2(sK13,sK14))
| empty(set_intersection2(sK13,sK14)) )
& preboolean(sK14)
& ~ empty(sK14) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ( ~ preboolean(set_intersection2(sK13,sK14))
| empty(set_intersection2(sK13,sK14)) )
& preboolean(sK14)
& ~ empty(sK14)
& preboolean(sK13)
& ~ empty(sK13) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f81,f121,f120]) ).
fof(f131,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f95]) ).
fof(f132,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f95]) ).
fof(f133,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f95]) ).
fof(f174,plain,
! [X3,X0,X4] :
( in(set_union2(X3,X4),X0)
| ~ in(X4,X0)
| ~ in(X3,X0)
| ~ preboolean(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f175,plain,
! [X3,X0,X4] :
( in(set_difference(X3,X4),X0)
| ~ in(X4,X0)
| ~ in(X3,X0)
| ~ preboolean(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f176,plain,
! [X0] :
( preboolean(X0)
| in(sK11(X0),X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f177,plain,
! [X0] :
( preboolean(X0)
| in(sK12(X0),X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f178,plain,
! [X0] :
( preboolean(X0)
| ~ in(set_difference(sK11(X0),sK12(X0)),X0)
| ~ in(set_union2(sK11(X0),sK12(X0)),X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f179,plain,
! [X0] :
( in(empty_set,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f182,plain,
~ empty(sK13),
inference(cnf_transformation,[],[f122]) ).
fof(f183,plain,
preboolean(sK13),
inference(cnf_transformation,[],[f122]) ).
fof(f184,plain,
~ empty(sK14),
inference(cnf_transformation,[],[f122]) ).
fof(f185,plain,
preboolean(sK14),
inference(cnf_transformation,[],[f122]) ).
fof(f186,plain,
( ~ preboolean(set_intersection2(sK13,sK14))
| empty(set_intersection2(sK13,sK14)) ),
inference(cnf_transformation,[],[f122]) ).
fof(f195,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f89]) ).
fof(f197,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f133]) ).
fof(f198,plain,
! [X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f132]) ).
fof(f199,plain,
! [X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f131]) ).
cnf(c_60,plain,
( ~ in(X0,X1)
| ~ in(X0,X2)
| in(X0,set_intersection2(X2,X1)) ),
inference(cnf_transformation,[],[f197]) ).
cnf(c_61,plain,
( ~ in(X0,set_intersection2(X1,X2))
| in(X0,X2) ),
inference(cnf_transformation,[],[f198]) ).
cnf(c_62,plain,
( ~ in(X0,set_intersection2(X1,X2))
| in(X0,X1) ),
inference(cnf_transformation,[],[f199]) ).
cnf(c_100,plain,
( ~ in(set_union2(sK11(X0),sK12(X0)),X0)
| ~ in(set_difference(sK11(X0),sK12(X0)),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f178]) ).
cnf(c_101,plain,
( in(sK12(X0),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f177]) ).
cnf(c_102,plain,
( in(sK11(X0),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f176]) ).
cnf(c_103,plain,
( ~ in(X0,X1)
| ~ in(X2,X1)
| ~ preboolean(X1)
| in(set_difference(X2,X0),X1) ),
inference(cnf_transformation,[],[f175]) ).
cnf(c_104,plain,
( ~ in(X0,X1)
| ~ in(X2,X1)
| ~ preboolean(X1)
| in(set_union2(X2,X0),X1) ),
inference(cnf_transformation,[],[f174]) ).
cnf(c_105,plain,
( ~ preboolean(X0)
| in(empty_set,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f179]) ).
cnf(c_108,negated_conjecture,
( ~ preboolean(set_intersection2(sK13,sK14))
| empty(set_intersection2(sK13,sK14)) ),
inference(cnf_transformation,[],[f186]) ).
cnf(c_109,negated_conjecture,
preboolean(sK14),
inference(cnf_transformation,[],[f185]) ).
cnf(c_110,negated_conjecture,
~ empty(sK14),
inference(cnf_transformation,[],[f184]) ).
cnf(c_111,negated_conjecture,
preboolean(sK13),
inference(cnf_transformation,[],[f183]) ).
cnf(c_112,negated_conjecture,
~ empty(sK13),
inference(cnf_transformation,[],[f182]) ).
cnf(c_121,plain,
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f195]) ).
cnf(c_882,plain,
( set_intersection2(sK13,sK14) != X0
| in(sK11(X0),X0)
| empty(set_intersection2(sK13,sK14)) ),
inference(resolution_lifted,[status(thm)],[c_102,c_108]) ).
cnf(c_883,plain,
( in(sK11(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
| empty(set_intersection2(sK13,sK14)) ),
inference(unflattening,[status(thm)],[c_882]) ).
cnf(c_890,plain,
( set_intersection2(sK13,sK14) != X0
| in(sK12(X0),X0)
| empty(set_intersection2(sK13,sK14)) ),
inference(resolution_lifted,[status(thm)],[c_101,c_108]) ).
cnf(c_891,plain,
( in(sK12(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
| empty(set_intersection2(sK13,sK14)) ),
inference(unflattening,[status(thm)],[c_890]) ).
cnf(c_898,plain,
( set_intersection2(sK13,sK14) != X0
| ~ in(set_union2(sK11(X0),sK12(X0)),X0)
| ~ in(set_difference(sK11(X0),sK12(X0)),X0)
| empty(set_intersection2(sK13,sK14)) ),
inference(resolution_lifted,[status(thm)],[c_100,c_108]) ).
cnf(c_899,plain,
( ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14))
| ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14))
| empty(set_intersection2(sK13,sK14)) ),
inference(unflattening,[status(thm)],[c_898]) ).
cnf(c_906,plain,
( ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14))
| ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_899,c_121]) ).
cnf(c_909,plain,
( X0 != sK14
| in(empty_set,X0)
| empty(X0) ),
inference(resolution_lifted,[status(thm)],[c_105,c_109]) ).
cnf(c_910,plain,
( in(empty_set,sK14)
| empty(sK14) ),
inference(unflattening,[status(thm)],[c_909]) ).
cnf(c_916,plain,
( X0 != sK13
| in(empty_set,X0)
| empty(X0) ),
inference(resolution_lifted,[status(thm)],[c_105,c_111]) ).
cnf(c_917,plain,
( in(empty_set,sK13)
| empty(sK13) ),
inference(unflattening,[status(thm)],[c_916]) ).
cnf(c_4630,plain,
( ~ in(empty_set,X0)
| ~ in(empty_set,sK14)
| in(empty_set,set_intersection2(X0,sK14)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_5954,plain,
( ~ in(X0,X1)
| ~ in(X0,sK14)
| in(X0,set_intersection2(X1,sK14)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_6050,plain,
( ~ in(X0,sK13)
| ~ in(X1,sK13)
| ~ preboolean(sK13)
| in(set_union2(X1,X0),sK13) ),
inference(instantiation,[status(thm)],[c_104]) ).
cnf(c_15396,plain,
( ~ in(empty_set,sK13)
| ~ in(empty_set,sK14)
| in(empty_set,set_intersection2(sK13,sK14)) ),
inference(instantiation,[status(thm)],[c_4630]) ).
cnf(c_20877,plain,
( ~ in(X0,sK13)
| ~ in(X0,sK14)
| in(X0,set_intersection2(sK13,sK14)) ),
inference(instantiation,[status(thm)],[c_5954]) ).
cnf(c_22601,plain,
( ~ in(empty_set,set_intersection2(sK13,sK14))
| ~ empty(set_intersection2(sK13,sK14)) ),
inference(instantiation,[status(thm)],[c_121]) ).
cnf(c_48779,plain,
( ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13)
| ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14)
| in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14)) ),
inference(instantiation,[status(thm)],[c_20877]) ).
cnf(c_59712,plain,
( ~ in(sK11(set_intersection2(sK13,sK14)),sK13)
| ~ in(sK12(set_intersection2(sK13,sK14)),sK13)
| ~ preboolean(sK13)
| in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13) ),
inference(instantiation,[status(thm)],[c_6050]) ).
cnf(c_173469,plain,
( ~ in(sK12(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
| in(sK12(set_intersection2(sK13,sK14)),sK13) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_173470,plain,
( ~ in(sK12(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
| in(sK12(set_intersection2(sK13,sK14)),sK14) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_173552,plain,
( ~ in(sK11(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
| in(sK11(set_intersection2(sK13,sK14)),sK13) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_173553,plain,
( ~ in(sK11(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
| in(sK11(set_intersection2(sK13,sK14)),sK14) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_187834,plain,
( ~ in(X0,sK14)
| ~ in(X1,sK14)
| ~ preboolean(sK14)
| in(set_difference(X1,X0),sK14) ),
inference(instantiation,[status(thm)],[c_103]) ).
cnf(c_187954,plain,
( ~ in(X0,X1)
| ~ in(X0,sK13)
| in(X0,set_intersection2(sK13,X1)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_187958,plain,
( ~ in(X0,sK13)
| ~ in(X1,sK13)
| ~ preboolean(sK13)
| in(set_difference(X1,X0),sK13) ),
inference(instantiation,[status(thm)],[c_103]) ).
cnf(c_205145,plain,
( ~ in(X0,sK13)
| ~ in(X0,sK14)
| in(X0,set_intersection2(sK13,sK14)) ),
inference(instantiation,[status(thm)],[c_187954]) ).
cnf(c_213695,plain,
( ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13)
| ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14)
| in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14)) ),
inference(instantiation,[status(thm)],[c_205145]) ).
cnf(c_239988,plain,
( ~ in(sK11(set_intersection2(sK13,sK14)),sK14)
| ~ in(sK12(set_intersection2(sK13,sK14)),sK14)
| ~ preboolean(sK14)
| in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14) ),
inference(instantiation,[status(thm)],[c_187834]) ).
cnf(c_271026,plain,
( ~ in(sK11(set_intersection2(sK13,sK14)),sK13)
| ~ in(sK12(set_intersection2(sK13,sK14)),sK13)
| ~ preboolean(sK13)
| in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13) ),
inference(instantiation,[status(thm)],[c_187958]) ).
cnf(c_419981,plain,
( ~ in(X0,sK14)
| ~ in(X1,sK14)
| ~ preboolean(sK14)
| in(set_union2(X1,X0),sK14) ),
inference(instantiation,[status(thm)],[c_104]) ).
cnf(c_471404,plain,
( ~ in(sK11(set_intersection2(sK13,sK14)),sK14)
| ~ in(sK12(set_intersection2(sK13,sK14)),sK14)
| ~ preboolean(sK14)
| in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14) ),
inference(instantiation,[status(thm)],[c_419981]) ).
cnf(c_471405,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_471404,c_271026,c_239988,c_213695,c_173552,c_173553,c_173469,c_173470,c_59712,c_48779,c_22601,c_15396,c_917,c_910,c_906,c_891,c_883,c_110,c_112,c_109,c_111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SEU109+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.15 % Command : run_iprover %s %d THM
% 0.12/0.36 % Computer : n013.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8042.1875MB
% 0.12/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Wed Aug 23 12:23:32 EDT 2023
% 0.12/0.36 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 201.33/27.48 % SZS status Started for theBenchmark.p
% 201.33/27.48 % SZS status Theorem for theBenchmark.p
% 201.33/27.48
% 201.33/27.48 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 201.33/27.48
% 201.33/27.48 ------ iProver source info
% 201.33/27.48
% 201.33/27.48 git: date: 2023-05-31 18:12:56 +0000
% 201.33/27.48 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 201.33/27.48 git: non_committed_changes: false
% 201.33/27.48 git: last_make_outside_of_git: false
% 201.33/27.48
% 201.33/27.48 ------ Parsing...
% 201.33/27.48 ------ Clausification by vclausify_rel & Parsing by iProver...
% 201.33/27.48
% 201.33/27.48 ------ 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
% 201.33/27.48
% 201.33/27.48 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 201.33/27.48
% 201.33/27.48 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 201.33/27.48 ------ Proving...
% 201.33/27.48 ------ Problem Properties
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48 clauses 55
% 201.33/27.48 conjectures 5
% 201.33/27.48 EPR 17
% 201.33/27.48 Horn 46
% 201.33/27.48 unary 26
% 201.33/27.48 binary 17
% 201.33/27.48 lits 99
% 201.33/27.48 lits eq 13
% 201.33/27.48 fd_pure 0
% 201.33/27.48 fd_pseudo 0
% 201.33/27.48 fd_cond 1
% 201.33/27.48 fd_pseudo_cond 4
% 201.33/27.48 AC symbols 0
% 201.33/27.48
% 201.33/27.48 ------ Schedule dynamic 5 is on
% 201.33/27.48
% 201.33/27.48 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48 ------
% 201.33/27.48 Current options:
% 201.33/27.48 ------
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48 ------ Proving...
% 201.33/27.48 Proof_search_loop: time out after: 3920 full_loop iterations
% 201.33/27.48
% 201.33/27.48 ------ Input Options"--res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48 ------
% 201.33/27.48 Current options:
% 201.33/27.48 ------
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48 ------ Proving...
% 201.33/27.48 Proof_search_loop: time out after: 5394 full_loop iterations
% 201.33/27.48
% 201.33/27.48 ------ Option_1: Negative Selections Time Limit: 35.
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48 ------
% 201.33/27.48 Current options:
% 201.33/27.48 ------
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48 ------ Proving...
% 201.33/27.48
% 201.33/27.48
% 201.33/27.48 % SZS status Theorem for theBenchmark.p
% 201.33/27.48
% 201.33/27.48 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 201.33/27.48
% 201.33/27.49
%------------------------------------------------------------------------------