TSTP Solution File: SEU171+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU171+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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 : Fri May 3 03:04:50 EDT 2024
% Result : Theorem 10.02s 2.19s
% Output : CNFRefutation 10.02s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f9,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',d2_subset_1) ).
fof(f35,axiom,
! [X0] : ~ empty(powerset(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(f36,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f39,axiom,
! [X0,X1] :
( ~ empty(X0)
=> ~ empty(set_union2(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc3_xboole_0) ).
fof(f60,axiom,
! [X0,X1] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f65,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f82,axiom,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f89,axiom,
! [X0,X1] :
( element(X1,powerset(X0))
=> ! [X2] :
( element(X2,powerset(X0))
=> ( disjoint(X1,X2)
<=> subset(X1,subset_complement(X0,X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_subset_1) ).
fof(f91,axiom,
! [X0,X1] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t46_zfmisc_1) ).
fof(f95,conjecture,
! [X0] :
( empty_set != X0
=> ! [X1] :
( element(X1,powerset(X0))
=> ! [X2] :
( element(X2,X0)
=> ( ~ in(X2,X1)
=> in(X2,subset_complement(X0,X1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t50_subset_1) ).
fof(f96,negated_conjecture,
~ ! [X0] :
( empty_set != X0
=> ! [X1] :
( element(X1,powerset(X0))
=> ! [X2] :
( element(X2,X0)
=> ( ~ in(X2,X1)
=> in(X2,subset_complement(X0,X1)) ) ) ) ),
inference(negated_conjecture,[],[f95]) ).
fof(f99,axiom,
! [X0,X1] :
( set_difference(X0,singleton(X1)) = X0
<=> ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t65_zfmisc_1) ).
fof(f100,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f103,axiom,
! [X0,X1] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(f104,axiom,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f105,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(f106,axiom,
! [X0,X1] :
~ ( empty(X1)
& X0 != X1
& empty(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_boole) ).
fof(f126,plain,
! [X0,X1] :
( ( ( element(X1,X0)
<=> empty(X1) )
| ~ empty(X0) )
& ( ( element(X1,X0)
<=> in(X1,X0) )
| empty(X0) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f133,plain,
! [X0,X1] :
( ~ empty(set_union2(X1,X0))
| empty(X0) ),
inference(ennf_transformation,[],[f39]) ).
fof(f143,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f60]) ).
fof(f148,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f65]) ).
fof(f162,plain,
! [X0,X1] :
( ! [X2] :
( ( disjoint(X1,X2)
<=> subset(X1,subset_complement(X0,X2)) )
| ~ element(X2,powerset(X0)) )
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f89]) ).
fof(f164,plain,
! [X0,X1] :
( set_union2(singleton(X0),X1) = X1
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f91]) ).
fof(f166,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ in(X2,subset_complement(X0,X1))
& ~ in(X2,X1)
& element(X2,X0) )
& element(X1,powerset(X0)) )
& empty_set != X0 ),
inference(ennf_transformation,[],[f96]) ).
fof(f167,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ in(X2,subset_complement(X0,X1))
& ~ in(X2,X1)
& element(X2,X0) )
& element(X1,powerset(X0)) )
& empty_set != X0 ),
inference(flattening,[],[f166]) ).
fof(f173,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f103]) ).
fof(f174,plain,
! [X0,X1] :
( ~ empty(X1)
| X0 = X1
| ~ empty(X0) ),
inference(ennf_transformation,[],[f106]) ).
fof(f192,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(f193,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,[],[f192]) ).
fof(f194,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(f195,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])],[f193,f194]) ).
fof(f196,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,[],[f126]) ).
fof(f260,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f82]) ).
fof(f261,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f260]) ).
fof(f266,plain,
! [X0,X1] :
( ! [X2] :
( ( ( disjoint(X1,X2)
| ~ subset(X1,subset_complement(X0,X2)) )
& ( subset(X1,subset_complement(X0,X2))
| ~ disjoint(X1,X2) ) )
| ~ element(X2,powerset(X0)) )
| ~ element(X1,powerset(X0)) ),
inference(nnf_transformation,[],[f162]) ).
fof(f269,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ~ in(X2,subset_complement(X0,X1))
& ~ in(X2,X1)
& element(X2,X0) )
& element(X1,powerset(X0)) )
& empty_set != X0 )
=> ( ? [X1] :
( ? [X2] :
( ~ in(X2,subset_complement(sK25,X1))
& ~ in(X2,X1)
& element(X2,sK25) )
& element(X1,powerset(sK25)) )
& empty_set != sK25 ) ),
introduced(choice_axiom,[]) ).
fof(f270,plain,
( ? [X1] :
( ? [X2] :
( ~ in(X2,subset_complement(sK25,X1))
& ~ in(X2,X1)
& element(X2,sK25) )
& element(X1,powerset(sK25)) )
=> ( ? [X2] :
( ~ in(X2,subset_complement(sK25,sK26))
& ~ in(X2,sK26)
& element(X2,sK25) )
& element(sK26,powerset(sK25)) ) ),
introduced(choice_axiom,[]) ).
fof(f271,plain,
( ? [X2] :
( ~ in(X2,subset_complement(sK25,sK26))
& ~ in(X2,sK26)
& element(X2,sK25) )
=> ( ~ in(sK27,subset_complement(sK25,sK26))
& ~ in(sK27,sK26)
& element(sK27,sK25) ) ),
introduced(choice_axiom,[]) ).
fof(f272,plain,
( ~ in(sK27,subset_complement(sK25,sK26))
& ~ in(sK27,sK26)
& element(sK27,sK25)
& element(sK26,powerset(sK25))
& empty_set != sK25 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK25,sK26,sK27])],[f167,f271,f270,f269]) ).
fof(f273,plain,
! [X0,X1] :
( ( set_difference(X0,singleton(X1)) = X0
| in(X1,X0) )
& ( ~ in(X1,X0)
| set_difference(X0,singleton(X1)) != X0 ) ),
inference(nnf_transformation,[],[f99]) ).
fof(f274,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_difference(X0,X1) != X0 )
& ( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f105]) ).
fof(f282,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f293,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f195]) ).
fof(f294,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f195]) ).
fof(f297,plain,
! [X0,X1] :
( in(X1,X0)
| ~ element(X1,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f196]) ).
fof(f298,plain,
! [X0,X1] :
( element(X1,X0)
| ~ in(X1,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f196]) ).
fof(f349,plain,
! [X0] : ~ empty(powerset(X0)),
inference(cnf_transformation,[],[f35]) ).
fof(f350,plain,
empty(empty_set),
inference(cnf_transformation,[],[f36]) ).
fof(f353,plain,
! [X0,X1] :
( ~ empty(set_union2(X1,X0))
| empty(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f382,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f143]) ).
fof(f390,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f148]) ).
fof(f413,plain,
! [X2,X0,X1] :
( in(X0,X2)
| ~ subset(unordered_pair(X0,X1),X2) ),
inference(cnf_transformation,[],[f261]) ).
fof(f426,plain,
! [X2,X0,X1] :
( subset(X1,subset_complement(X0,X2))
| ~ disjoint(X1,X2)
| ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0)) ),
inference(cnf_transformation,[],[f266]) ).
fof(f429,plain,
! [X0,X1] :
( set_union2(singleton(X0),X1) = X1
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f164]) ).
fof(f434,plain,
empty_set != sK25,
inference(cnf_transformation,[],[f272]) ).
fof(f435,plain,
element(sK26,powerset(sK25)),
inference(cnf_transformation,[],[f272]) ).
fof(f436,plain,
element(sK27,sK25),
inference(cnf_transformation,[],[f272]) ).
fof(f437,plain,
~ in(sK27,sK26),
inference(cnf_transformation,[],[f272]) ).
fof(f438,plain,
~ in(sK27,subset_complement(sK25,sK26)),
inference(cnf_transformation,[],[f272]) ).
fof(f442,plain,
! [X0,X1] :
( set_difference(X0,singleton(X1)) = X0
| in(X1,X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f443,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f100]) ).
fof(f446,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f173]) ).
fof(f447,plain,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f104]) ).
fof(f449,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_difference(X0,X1) != X0 ),
inference(cnf_transformation,[],[f274]) ).
fof(f450,plain,
! [X0,X1] :
( ~ empty(X1)
| X0 = X1
| ~ empty(X0) ),
inference(cnf_transformation,[],[f174]) ).
fof(f509,plain,
! [X0,X1] :
( set_union2(unordered_pair(X0,X0),X1) = X1
| ~ in(X0,X1) ),
inference(definition_unfolding,[],[f429,f443]) ).
fof(f512,plain,
! [X0,X1] :
( set_difference(X0,unordered_pair(X1,X1)) = X0
| in(X1,X0) ),
inference(definition_unfolding,[],[f442,f443]) ).
fof(f523,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f294]) ).
fof(f524,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f293]) ).
cnf(c_52,plain,
set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f282]) ).
cnf(c_65,plain,
( ~ subset(X0,X1)
| in(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f523]) ).
cnf(c_66,plain,
( ~ in(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f524]) ).
cnf(c_69,plain,
( ~ in(X0,X1)
| element(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f298]) ).
cnf(c_70,plain,
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f297]) ).
cnf(c_118,plain,
~ empty(powerset(X0)),
inference(cnf_transformation,[],[f349]) ).
cnf(c_119,plain,
empty(empty_set),
inference(cnf_transformation,[],[f350]) ).
cnf(c_122,plain,
( ~ empty(set_union2(X0,X1))
| empty(X1) ),
inference(cnf_transformation,[],[f353]) ).
cnf(c_151,plain,
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f382]) ).
cnf(c_159,plain,
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f390]) ).
cnf(c_184,plain,
( ~ subset(unordered_pair(X0,X1),X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f413]) ).
cnf(c_196,plain,
( ~ element(X0,powerset(X1))
| ~ element(X2,powerset(X1))
| ~ disjoint(X0,X2)
| subset(X0,subset_complement(X1,X2)) ),
inference(cnf_transformation,[],[f426]) ).
cnf(c_198,plain,
( ~ in(X0,X1)
| set_union2(unordered_pair(X0,X0),X1) = X1 ),
inference(cnf_transformation,[],[f509]) ).
cnf(c_202,negated_conjecture,
~ in(sK27,subset_complement(sK25,sK26)),
inference(cnf_transformation,[],[f438]) ).
cnf(c_203,negated_conjecture,
~ in(sK27,sK26),
inference(cnf_transformation,[],[f437]) ).
cnf(c_204,negated_conjecture,
element(sK27,sK25),
inference(cnf_transformation,[],[f436]) ).
cnf(c_205,negated_conjecture,
element(sK26,powerset(sK25)),
inference(cnf_transformation,[],[f435]) ).
cnf(c_206,negated_conjecture,
empty_set != sK25,
inference(cnf_transformation,[],[f434]) ).
cnf(c_209,plain,
( set_difference(X0,unordered_pair(X1,X1)) = X0
| in(X1,X0) ),
inference(cnf_transformation,[],[f512]) ).
cnf(c_213,plain,
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f446]) ).
cnf(c_214,plain,
subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f447]) ).
cnf(c_215,plain,
( set_difference(X0,X1) != X0
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f449]) ).
cnf(c_217,plain,
( ~ empty(X0)
| ~ empty(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f450]) ).
cnf(c_309,plain,
( element(X0,X1)
| ~ in(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_69,c_213,c_69]) ).
cnf(c_310,plain,
( ~ in(X0,X1)
| element(X0,X1) ),
inference(renaming,[status(thm)],[c_309]) ).
cnf(c_2118,plain,
( ~ in(X0,X1)
| element(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_310]) ).
cnf(c_3842,plain,
powerset(sK25) = sP0_iProver_def,
definition ).
cnf(c_3843,plain,
subset_complement(sK25,sK26) = sP1_iProver_def,
definition ).
cnf(c_3845,negated_conjecture,
element(sK26,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_205,c_3842]) ).
cnf(c_3846,negated_conjecture,
element(sK27,sK25),
inference(demodulation,[status(thm)],[c_204]) ).
cnf(c_3847,negated_conjecture,
~ in(sK27,sK26),
inference(demodulation,[status(thm)],[c_203]) ).
cnf(c_3848,negated_conjecture,
~ in(sK27,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_202,c_3843]) ).
cnf(c_6356,plain,
~ empty(sP0_iProver_def),
inference(superposition,[status(thm)],[c_3842,c_118]) ).
cnf(c_6491,plain,
subset(X0,set_union2(X1,X0)),
inference(superposition,[status(thm)],[c_52,c_214]) ).
cnf(c_6527,plain,
( ~ subset(X0,sK25)
| in(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_3842,c_65]) ).
cnf(c_6597,plain,
( ~ in(X0,sP0_iProver_def)
| subset(X0,sK25) ),
inference(superposition,[status(thm)],[c_3842,c_66]) ).
cnf(c_6928,plain,
( in(sK27,sK25)
| empty(sK25) ),
inference(superposition,[status(thm)],[c_3846,c_70]) ).
cnf(c_6929,plain,
( in(sK26,sP0_iProver_def)
| empty(sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_3845,c_70]) ).
cnf(c_6940,plain,
in(sK26,sP0_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_6929,c_6356]) ).
cnf(c_6985,plain,
subset(sK26,sK25),
inference(superposition,[status(thm)],[c_6940,c_6597]) ).
cnf(c_7334,plain,
( ~ empty(empty_set)
| ~ empty(sK25)
| empty_set = sK25 ),
inference(instantiation,[status(thm)],[c_217]) ).
cnf(c_7980,plain,
set_union2(sK26,sK25) = sK25,
inference(superposition,[status(thm)],[c_6985,c_159]) ).
cnf(c_8076,plain,
set_union2(sK25,sK26) = sK25,
inference(demodulation,[status(thm)],[c_7980,c_52]) ).
cnf(c_8083,plain,
( ~ empty(sK25)
| empty(sK26) ),
inference(superposition,[status(thm)],[c_8076,c_122]) ).
cnf(c_8094,plain,
~ empty(sK25),
inference(global_subsumption_just,[status(thm)],[c_8083,c_119,c_206,c_7334]) ).
cnf(c_8099,plain,
in(sK27,sK25),
inference(backward_subsumption_resolution,[status(thm)],[c_6928,c_8094]) ).
cnf(c_9564,plain,
set_difference(sK26,unordered_pair(sK27,sK27)) = sK26,
inference(superposition,[status(thm)],[c_209,c_3847]) ).
cnf(c_9855,plain,
disjoint(sK26,unordered_pair(sK27,sK27)),
inference(superposition,[status(thm)],[c_9564,c_215]) ).
cnf(c_9917,plain,
disjoint(unordered_pair(sK27,sK27),sK26),
inference(superposition,[status(thm)],[c_9855,c_151]) ).
cnf(c_12669,plain,
set_union2(unordered_pair(sK27,sK27),sK25) = sK25,
inference(superposition,[status(thm)],[c_8099,c_198]) ).
cnf(c_13339,plain,
set_union2(sK25,unordered_pair(sK27,sK27)) = sK25,
inference(demodulation,[status(thm)],[c_12669,c_52]) ).
cnf(c_13341,plain,
subset(unordered_pair(sK27,sK27),sK25),
inference(superposition,[status(thm)],[c_13339,c_6491]) ).
cnf(c_13929,plain,
in(unordered_pair(sK27,sK27),sP0_iProver_def),
inference(superposition,[status(thm)],[c_13341,c_6527]) ).
cnf(c_13966,plain,
element(unordered_pair(sK27,sK27),sP0_iProver_def),
inference(superposition,[status(thm)],[c_13929,c_2118]) ).
cnf(c_21972,plain,
( ~ element(X0,powerset(sK25))
| ~ element(sK26,powerset(sK25))
| ~ disjoint(X0,sK26)
| subset(X0,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_3843,c_196]) ).
cnf(c_22002,plain,
( ~ element(X0,sP0_iProver_def)
| ~ disjoint(X0,sK26)
| ~ element(sK26,sP0_iProver_def)
| subset(X0,sP1_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_21972,c_3842]) ).
cnf(c_22003,plain,
( ~ element(X0,sP0_iProver_def)
| ~ disjoint(X0,sK26)
| subset(X0,sP1_iProver_def) ),
inference(forward_subsumption_resolution,[status(thm)],[c_22002,c_3845]) ).
cnf(c_22414,plain,
( ~ disjoint(unordered_pair(sK27,sK27),sK26)
| subset(unordered_pair(sK27,sK27),sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_13966,c_22003]) ).
cnf(c_22426,plain,
subset(unordered_pair(sK27,sK27),sP1_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_22414,c_9917]) ).
cnf(c_23368,plain,
in(sK27,sP1_iProver_def),
inference(superposition,[status(thm)],[c_22426,c_184]) ).
cnf(c_23375,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_23368,c_3848]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU171+2 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 17:46:46 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.02/2.19 % SZS status Started for theBenchmark.p
% 10.02/2.19 % SZS status Theorem for theBenchmark.p
% 10.02/2.19
% 10.02/2.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.02/2.19
% 10.02/2.19 ------ iProver source info
% 10.02/2.19
% 10.02/2.19 git: date: 2024-05-02 19:28:25 +0000
% 10.02/2.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.02/2.19 git: non_committed_changes: false
% 10.02/2.19
% 10.02/2.19 ------ Parsing...
% 10.02/2.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.02/2.19
% 10.02/2.19 ------ 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
% 10.02/2.19
% 10.02/2.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.02/2.19
% 10.02/2.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.02/2.19 ------ Proving...
% 10.02/2.19 ------ Problem Properties
% 10.02/2.19
% 10.02/2.19
% 10.02/2.19 clauses 157
% 10.02/2.19 conjectures 5
% 10.02/2.19 EPR 30
% 10.02/2.19 Horn 126
% 10.02/2.19 unary 38
% 10.02/2.19 binary 65
% 10.02/2.19 lits 339
% 10.02/2.19 lits eq 86
% 10.02/2.19 fd_pure 0
% 10.02/2.19 fd_pseudo 0
% 10.02/2.19 fd_cond 3
% 10.02/2.19 fd_pseudo_cond 35
% 10.02/2.19 AC symbols 0
% 10.02/2.19
% 10.02/2.19 ------ Schedule dynamic 5 is on
% 10.02/2.19
% 10.02/2.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.02/2.19
% 10.02/2.19
% 10.02/2.19 ------
% 10.02/2.19 Current options:
% 10.02/2.19 ------
% 10.02/2.19
% 10.02/2.19
% 10.02/2.19
% 10.02/2.19
% 10.02/2.19 ------ Proving...
% 10.02/2.19
% 10.02/2.19
% 10.02/2.19 % SZS status Theorem for theBenchmark.p
% 10.02/2.19
% 10.02/2.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.02/2.19
% 10.02/2.21
%------------------------------------------------------------------------------