TSTP Solution File: SEU170+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU170+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : Thu Aug 31 17:04:21 EDT 2023
% Result : Theorem 14.68s 2.68s
% Output : CNFRefutation 14.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 22
% Syntax : Number of formulae : 122 ( 53 unt; 0 def)
% Number of atoms : 299 ( 64 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 278 ( 101 ~; 107 |; 45 &)
% ( 11 <=>; 13 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 212 ( 9 sgn; 124 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f5,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f9,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f10,axiom,
! [X0,X1] :
( ( empty(X0)
=> ( element(X1,X0)
<=> empty(X1) ) )
& ( ~ empty(X0)
=> ( element(X1,X0)
<=> in(X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_subset_1) ).
fof(f18,axiom,
! [X0,X1] :
( element(X1,powerset(X0))
=> set_difference(X0,X1) = subset_complement(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_subset_1) ).
fof(f35,axiom,
! [X0] : ~ empty(powerset(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(f60,axiom,
! [X0,X1] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f77,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_difference(X0,X2),set_difference(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_xboole_1) ).
fof(f79,axiom,
! [X0,X1] : subset(set_difference(X0,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_xboole_1) ).
fof(f80,axiom,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f83,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_xboole_1) ).
fof(f85,axiom,
! [X0] : set_difference(X0,empty_set) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_boole) ).
fof(f88,axiom,
! [X0,X1] : set_difference(X0,X1) = set_difference(set_union2(X0,X1),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t40_xboole_1) ).
fof(f89,conjecture,
! [X0,X1] :
( element(X1,powerset(X0))
=> ! [X2] :
( element(X2,powerset(X0))
=> ( disjoint(X1,X2)
<=> subset(X1,subset_complement(X0,X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t43_subset_1) ).
fof(f90,negated_conjecture,
~ ! [X0,X1] :
( element(X1,powerset(X0))
=> ! [X2] :
( element(X2,powerset(X0))
=> ( disjoint(X1,X2)
<=> subset(X1,subset_complement(X0,X2)) ) ) ),
inference(negated_conjecture,[],[f89]) ).
fof(f93,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(f97,axiom,
! [X0,X1,X2] :
( ( disjoint(X1,X2)
& subset(X0,X1) )
=> disjoint(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_xboole_1) ).
fof(f103,axiom,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f104,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(f125,plain,
! [X0,X1] :
( ( ( element(X1,X0)
<=> empty(X1) )
| ~ empty(X0) )
& ( ( element(X1,X0)
<=> in(X1,X0) )
| empty(X0) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f127,plain,
! [X0,X1] :
( set_difference(X0,X1) = subset_complement(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f18]) ).
fof(f142,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f60]) ).
fof(f157,plain,
! [X0,X1,X2] :
( subset(set_difference(X0,X2),set_difference(X1,X2))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f77]) ).
fof(f161,plain,
? [X0,X1] :
( ? [X2] :
( ( disjoint(X1,X2)
<~> subset(X1,subset_complement(X0,X2)) )
& element(X2,powerset(X0)) )
& element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f90]) ).
fof(f166,plain,
! [X0,X1,X2] :
( disjoint(X0,X2)
| ~ disjoint(X1,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f97]) ).
fof(f167,plain,
! [X0,X1,X2] :
( disjoint(X0,X2)
| ~ disjoint(X1,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f166]) ).
fof(f179,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f180,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f179]) ).
fof(f189,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f190,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f189]) ).
fof(f191,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ subset(sK2(X0,X1),X0)
| ~ in(sK2(X0,X1),X1) )
& ( subset(sK2(X0,X1),X0)
| in(sK2(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f192,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ( ( ~ subset(sK2(X0,X1),X0)
| ~ in(sK2(X0,X1),X1) )
& ( subset(sK2(X0,X1),X0)
| in(sK2(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f190,f191]) ).
fof(f193,plain,
! [X0,X1] :
( ( ( ( element(X1,X0)
| ~ empty(X1) )
& ( empty(X1)
| ~ element(X1,X0) ) )
| ~ empty(X0) )
& ( ( ( element(X1,X0)
| ~ in(X1,X0) )
& ( in(X1,X0)
| ~ element(X1,X0) ) )
| empty(X0) ) ),
inference(nnf_transformation,[],[f125]) ).
fof(f255,plain,
! [X0,X1] :
( ( empty_set = set_difference(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| empty_set != set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f80]) ).
fof(f263,plain,
? [X0,X1] :
( ? [X2] :
( ( ~ subset(X1,subset_complement(X0,X2))
| ~ disjoint(X1,X2) )
& ( subset(X1,subset_complement(X0,X2))
| disjoint(X1,X2) )
& element(X2,powerset(X0)) )
& element(X1,powerset(X0)) ),
inference(nnf_transformation,[],[f161]) ).
fof(f264,plain,
? [X0,X1] :
( ? [X2] :
( ( ~ subset(X1,subset_complement(X0,X2))
| ~ disjoint(X1,X2) )
& ( subset(X1,subset_complement(X0,X2))
| disjoint(X1,X2) )
& element(X2,powerset(X0)) )
& element(X1,powerset(X0)) ),
inference(flattening,[],[f263]) ).
fof(f265,plain,
( ? [X0,X1] :
( ? [X2] :
( ( ~ subset(X1,subset_complement(X0,X2))
| ~ disjoint(X1,X2) )
& ( subset(X1,subset_complement(X0,X2))
| disjoint(X1,X2) )
& element(X2,powerset(X0)) )
& element(X1,powerset(X0)) )
=> ( ? [X2] :
( ( ~ subset(sK25,subset_complement(sK24,X2))
| ~ disjoint(sK25,X2) )
& ( subset(sK25,subset_complement(sK24,X2))
| disjoint(sK25,X2) )
& element(X2,powerset(sK24)) )
& element(sK25,powerset(sK24)) ) ),
introduced(choice_axiom,[]) ).
fof(f266,plain,
( ? [X2] :
( ( ~ subset(sK25,subset_complement(sK24,X2))
| ~ disjoint(sK25,X2) )
& ( subset(sK25,subset_complement(sK24,X2))
| disjoint(sK25,X2) )
& element(X2,powerset(sK24)) )
=> ( ( ~ subset(sK25,subset_complement(sK24,sK26))
| ~ disjoint(sK25,sK26) )
& ( subset(sK25,subset_complement(sK24,sK26))
| disjoint(sK25,sK26) )
& element(sK26,powerset(sK24)) ) ),
introduced(choice_axiom,[]) ).
fof(f267,plain,
( ( ~ subset(sK25,subset_complement(sK24,sK26))
| ~ disjoint(sK25,sK26) )
& ( subset(sK25,subset_complement(sK24,sK26))
| disjoint(sK25,sK26) )
& element(sK26,powerset(sK24))
& element(sK25,powerset(sK24)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK24,sK25,sK26])],[f264,f266,f265]) ).
fof(f271,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_difference(X0,X1) != X0 )
& ( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f104]) ).
fof(f279,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f280,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f283,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f180]) ).
fof(f290,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f192]) ).
fof(f294,plain,
! [X0,X1] :
( in(X1,X0)
| ~ element(X1,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f193]) ).
fof(f339,plain,
! [X0,X1] :
( set_difference(X0,X1) = subset_complement(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(cnf_transformation,[],[f127]) ).
fof(f346,plain,
! [X0] : ~ empty(powerset(X0)),
inference(cnf_transformation,[],[f35]) ).
fof(f379,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f142]) ).
fof(f402,plain,
! [X2,X0,X1] :
( subset(set_difference(X0,X2),set_difference(X1,X2))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
fof(f405,plain,
! [X0,X1] : subset(set_difference(X0,X1),X0),
inference(cnf_transformation,[],[f79]) ).
fof(f406,plain,
! [X0,X1] :
( subset(X0,X1)
| empty_set != set_difference(X0,X1) ),
inference(cnf_transformation,[],[f255]) ).
fof(f407,plain,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f255]) ).
fof(f413,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)),
inference(cnf_transformation,[],[f83]) ).
fof(f417,plain,
! [X0] : set_difference(X0,empty_set) = X0,
inference(cnf_transformation,[],[f85]) ).
fof(f422,plain,
! [X0,X1] : set_difference(X0,X1) = set_difference(set_union2(X0,X1),X1),
inference(cnf_transformation,[],[f88]) ).
fof(f423,plain,
element(sK25,powerset(sK24)),
inference(cnf_transformation,[],[f267]) ).
fof(f424,plain,
element(sK26,powerset(sK24)),
inference(cnf_transformation,[],[f267]) ).
fof(f425,plain,
( subset(sK25,subset_complement(sK24,sK26))
| disjoint(sK25,sK26) ),
inference(cnf_transformation,[],[f267]) ).
fof(f426,plain,
( ~ subset(sK25,subset_complement(sK24,sK26))
| ~ disjoint(sK25,sK26) ),
inference(cnf_transformation,[],[f267]) ).
fof(f429,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
inference(cnf_transformation,[],[f93]) ).
fof(f434,plain,
! [X2,X0,X1] :
( disjoint(X0,X2)
| ~ disjoint(X1,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f167]) ).
fof(f441,plain,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f103]) ).
fof(f442,plain,
! [X0,X1] :
( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f271]) ).
fof(f443,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_difference(X0,X1) != X0 ),
inference(cnf_transformation,[],[f271]) ).
fof(f455,plain,
! [X0,X1] : set_difference(X0,set_difference(X0,X1)) = set_difference(X1,set_difference(X1,X0)),
inference(definition_unfolding,[],[f280,f429,f429]) ).
fof(f518,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f290]) ).
cnf(c_52,plain,
set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f279]) ).
cnf(c_53,plain,
set_difference(X0,set_difference(X0,X1)) = set_difference(X1,set_difference(X1,X0)),
inference(cnf_transformation,[],[f455]) ).
cnf(c_54,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f283]) ).
cnf(c_66,plain,
( ~ in(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f518]) ).
cnf(c_70,plain,
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f294]) ).
cnf(c_112,plain,
( ~ element(X0,powerset(X1))
| set_difference(X1,X0) = subset_complement(X1,X0) ),
inference(cnf_transformation,[],[f339]) ).
cnf(c_118,plain,
~ empty(powerset(X0)),
inference(cnf_transformation,[],[f346]) ).
cnf(c_151,plain,
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f379]) ).
cnf(c_174,plain,
( ~ subset(X0,X1)
| subset(set_difference(X0,X2),set_difference(X1,X2)) ),
inference(cnf_transformation,[],[f402]) ).
cnf(c_177,plain,
subset(set_difference(X0,X1),X0),
inference(cnf_transformation,[],[f405]) ).
cnf(c_178,plain,
( ~ subset(X0,X1)
| set_difference(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f407]) ).
cnf(c_179,plain,
( set_difference(X0,X1) != empty_set
| subset(X0,X1) ),
inference(cnf_transformation,[],[f406]) ).
cnf(c_185,plain,
set_union2(X0,set_difference(X1,X0)) = set_union2(X0,X1),
inference(cnf_transformation,[],[f413]) ).
cnf(c_189,plain,
set_difference(X0,empty_set) = X0,
inference(cnf_transformation,[],[f417]) ).
cnf(c_194,plain,
set_difference(set_union2(X0,X1),X1) = set_difference(X0,X1),
inference(cnf_transformation,[],[f422]) ).
cnf(c_195,negated_conjecture,
( ~ subset(sK25,subset_complement(sK24,sK26))
| ~ disjoint(sK25,sK26) ),
inference(cnf_transformation,[],[f426]) ).
cnf(c_196,negated_conjecture,
( subset(sK25,subset_complement(sK24,sK26))
| disjoint(sK25,sK26) ),
inference(cnf_transformation,[],[f425]) ).
cnf(c_197,negated_conjecture,
element(sK26,powerset(sK24)),
inference(cnf_transformation,[],[f424]) ).
cnf(c_198,negated_conjecture,
element(sK25,powerset(sK24)),
inference(cnf_transformation,[],[f423]) ).
cnf(c_205,plain,
( ~ subset(X0,X1)
| ~ disjoint(X1,X2)
| disjoint(X0,X2) ),
inference(cnf_transformation,[],[f434]) ).
cnf(c_211,plain,
subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f441]) ).
cnf(c_212,plain,
( set_difference(X0,X1) != X0
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f443]) ).
cnf(c_213,plain,
( ~ disjoint(X0,X1)
| set_difference(X0,X1) = X0 ),
inference(cnf_transformation,[],[f442]) ).
cnf(c_6416,plain,
subset(set_difference(X0,set_difference(X0,X1)),X1),
inference(superposition,[status(thm)],[c_53,c_177]) ).
cnf(c_6498,plain,
subset(set_difference(X0,set_difference(X1,set_difference(X1,X0))),set_difference(X0,X1)),
inference(superposition,[status(thm)],[c_53,c_6416]) ).
cnf(c_6704,plain,
( in(sK25,powerset(sK24))
| empty(powerset(sK24)) ),
inference(superposition,[status(thm)],[c_198,c_70]) ).
cnf(c_6716,plain,
in(sK25,powerset(sK24)),
inference(forward_subsumption_resolution,[status(thm)],[c_6704,c_118]) ).
cnf(c_6758,plain,
subset(sK25,sK24),
inference(superposition,[status(thm)],[c_6716,c_66]) ).
cnf(c_6810,plain,
subset(set_difference(X0,set_difference(set_difference(X0,X1),set_difference(set_difference(X0,X1),X0))),set_difference(X1,set_difference(X1,X0))),
inference(superposition,[status(thm)],[c_53,c_6498]) ).
cnf(c_7497,plain,
set_difference(set_difference(X0,X1),X0) = empty_set,
inference(superposition,[status(thm)],[c_177,c_178]) ).
cnf(c_7498,plain,
( set_difference(sK25,subset_complement(sK24,sK26)) = empty_set
| disjoint(sK25,sK26) ),
inference(superposition,[status(thm)],[c_196,c_178]) ).
cnf(c_7499,plain,
set_difference(X0,set_union2(X0,X1)) = empty_set,
inference(superposition,[status(thm)],[c_211,c_178]) ).
cnf(c_7663,plain,
subset(set_difference(X0,set_difference(set_difference(X0,X1),empty_set)),set_difference(X1,set_difference(X1,X0))),
inference(light_normalisation,[status(thm)],[c_6810,c_7497]) ).
cnf(c_7664,plain,
subset(set_difference(X0,set_difference(X0,X1)),set_difference(X1,set_difference(X1,X0))),
inference(demodulation,[status(thm)],[c_7663,c_189]) ).
cnf(c_7759,plain,
set_difference(set_union2(X0,X1),X0) = set_difference(X1,X0),
inference(superposition,[status(thm)],[c_52,c_194]) ).
cnf(c_7761,plain,
set_difference(set_union2(X0,X1),set_difference(X1,X0)) = set_difference(X0,set_difference(X1,X0)),
inference(superposition,[status(thm)],[c_185,c_194]) ).
cnf(c_7850,plain,
( set_difference(sK25,subset_complement(sK24,sK26)) = empty_set
| set_difference(sK25,sK26) = sK25 ),
inference(superposition,[status(thm)],[c_7498,c_213]) ).
cnf(c_7918,plain,
( set_difference(sK25,sK26) = sK25
| subset(sK25,subset_complement(sK24,sK26)) ),
inference(superposition,[status(thm)],[c_7850,c_179]) ).
cnf(c_9043,plain,
( ~ disjoint(subset_complement(sK24,sK26),X0)
| disjoint(sK25,X0)
| disjoint(sK25,sK26) ),
inference(superposition,[status(thm)],[c_196,c_205]) ).
cnf(c_12709,plain,
set_difference(sK24,sK26) = subset_complement(sK24,sK26),
inference(superposition,[status(thm)],[c_197,c_112]) ).
cnf(c_12755,plain,
( ~ disjoint(set_difference(sK24,sK26),X0)
| disjoint(sK25,X0)
| disjoint(sK25,sK26) ),
inference(demodulation,[status(thm)],[c_9043,c_12709]) ).
cnf(c_12773,plain,
( set_difference(sK25,sK26) = sK25
| subset(sK25,set_difference(sK24,sK26)) ),
inference(demodulation,[status(thm)],[c_7918,c_12709]) ).
cnf(c_12780,plain,
( ~ subset(sK25,set_difference(sK24,sK26))
| ~ disjoint(sK25,sK26) ),
inference(demodulation,[status(thm)],[c_195,c_12709]) ).
cnf(c_25363,plain,
subset(set_difference(X0,empty_set),set_difference(set_union2(X0,X1),set_difference(set_union2(X0,X1),X0))),
inference(superposition,[status(thm)],[c_7499,c_7664]) ).
cnf(c_25391,plain,
subset(X0,set_difference(X0,set_difference(X1,X0))),
inference(light_normalisation,[status(thm)],[c_25363,c_189,c_7759,c_7761]) ).
cnf(c_26826,plain,
( ~ subset(set_difference(X0,set_difference(X1,X0)),X0)
| set_difference(X0,set_difference(X1,X0)) = X0 ),
inference(superposition,[status(thm)],[c_25391,c_54]) ).
cnf(c_26852,plain,
set_difference(X0,set_difference(X1,X0)) = X0,
inference(forward_subsumption_resolution,[status(thm)],[c_26826,c_177]) ).
cnf(c_43569,plain,
disjoint(X0,set_difference(X1,X0)),
inference(superposition,[status(thm)],[c_26852,c_212]) ).
cnf(c_43788,plain,
disjoint(set_difference(X0,X1),X1),
inference(superposition,[status(thm)],[c_43569,c_151]) ).
cnf(c_43955,plain,
disjoint(sK25,sK26),
inference(superposition,[status(thm)],[c_43788,c_12755]) ).
cnf(c_43958,plain,
~ subset(sK25,set_difference(sK24,sK26)),
inference(backward_subsumption_resolution,[status(thm)],[c_12780,c_43955]) ).
cnf(c_43960,plain,
set_difference(sK25,sK26) = sK25,
inference(backward_subsumption_resolution,[status(thm)],[c_12773,c_43958]) ).
cnf(c_44159,plain,
( ~ subset(sK25,X0)
| subset(sK25,set_difference(X0,sK26)) ),
inference(superposition,[status(thm)],[c_43960,c_174]) ).
cnf(c_60537,plain,
~ subset(sK25,sK24),
inference(superposition,[status(thm)],[c_44159,c_43958]) ).
cnf(c_60538,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_60537,c_6758]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU170+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.14/0.33 % Computer : n016.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Wed Aug 23 13:14:37 EDT 2023
% 0.14/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 14.68/2.68 % SZS status Started for theBenchmark.p
% 14.68/2.68 % SZS status Theorem for theBenchmark.p
% 14.68/2.68
% 14.68/2.68 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 14.68/2.68
% 14.68/2.68 ------ iProver source info
% 14.68/2.68
% 14.68/2.68 git: date: 2023-05-31 18:12:56 +0000
% 14.68/2.68 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 14.68/2.68 git: non_committed_changes: false
% 14.68/2.68 git: last_make_outside_of_git: false
% 14.68/2.68
% 14.68/2.68 ------ Parsing...
% 14.68/2.68 ------ Clausification by vclausify_rel & Parsing by iProver...
% 14.68/2.68
% 14.68/2.68 ------ Preprocessing... sup_sim: 5 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 14.68/2.68
% 14.68/2.68 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 14.68/2.68
% 14.68/2.68 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 14.68/2.68 ------ Proving...
% 14.68/2.68 ------ Problem Properties
% 14.68/2.68
% 14.68/2.68
% 14.68/2.68 clauses 152
% 14.68/2.68 conjectures 4
% 14.68/2.68 EPR 25
% 14.68/2.68 Horn 120
% 14.68/2.68 unary 33
% 14.68/2.68 binary 67
% 14.68/2.68 lits 330
% 14.68/2.68 lits eq 83
% 14.68/2.68 fd_pure 0
% 14.68/2.68 fd_pseudo 0
% 14.68/2.68 fd_cond 3
% 14.68/2.68 fd_pseudo_cond 35
% 14.68/2.68 AC symbols 0
% 14.68/2.68
% 14.68/2.68 ------ Schedule dynamic 5 is on
% 14.68/2.68
% 14.68/2.68 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 14.68/2.68
% 14.68/2.68
% 14.68/2.68 ------
% 14.68/2.68 Current options:
% 14.68/2.68 ------
% 14.68/2.68
% 14.68/2.68
% 14.68/2.68
% 14.68/2.68
% 14.68/2.68 ------ Proving...
% 14.68/2.68
% 14.68/2.68
% 14.68/2.68 % SZS status Theorem for theBenchmark.p
% 14.68/2.68
% 14.68/2.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.68/2.68
% 14.68/2.69
%------------------------------------------------------------------------------