TSTP Solution File: SEU160+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU160+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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:14 EDT 2023
% Result : Theorem 3.29s 1.07s
% Output : CNFRefutation 3.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 20
% Syntax : Number of formulae : 108 ( 20 unt; 0 def)
% Number of atoms : 352 ( 143 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 399 ( 155 ~; 166 |; 60 &)
% ( 9 <=>; 8 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 188 ( 5 sgn; 139 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f8,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f11,axiom,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f19,axiom,
! [X0,X1] :
( proper_subset(X0,X1)
<=> ( X0 != X1
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f37,axiom,
! [X0] : singleton(X0) != empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_zfmisc_1) ).
fof(f49,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f52,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f59,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f62,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f67,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_zfmisc_1) ).
fof(f70,conjecture,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t39_zfmisc_1) ).
fof(f71,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(negated_conjecture,[],[f70]) ).
fof(f77,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(f79,axiom,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f80,axiom,
! [X0,X1] :
~ ( proper_subset(X1,X0)
& subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t60_xboole_1) ).
fof(f82,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f95,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f49]) ).
fof(f97,plain,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f79]) ).
fof(f98,plain,
! [X0,X1] :
( ( X0 != X1
& subset(X0,X1) )
=> proper_subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f19]) ).
fof(f102,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| X0 = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f98]) ).
fof(f103,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| X0 = X1
| ~ subset(X0,X1) ),
inference(flattening,[],[f102]) ).
fof(f114,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f52]) ).
fof(f120,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f59]) ).
fof(f124,plain,
? [X0,X1] :
( subset(X0,singleton(X1))
<~> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(ennf_transformation,[],[f71]) ).
fof(f128,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ( ? [X3] : in(X3,set_intersection2(X0,X1))
| disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f129,plain,
! [X0,X1] :
( ~ proper_subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f80]) ).
fof(f142,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f143,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f142]) ).
fof(f144,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f143,f144]) ).
fof(f146,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f147,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f146]) ).
fof(f148,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK1(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
! [X0] :
( ( empty_set = X0
| in(sK1(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f147,f148]) ).
fof(f159,plain,
! [X0,X1,X2] :
( ( set_union2(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_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f160,plain,
! [X0,X1,X2] :
( ( set_union2(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_union2(X0,X1) != X2 ) ),
inference(flattening,[],[f159]) ).
fof(f161,plain,
! [X0,X1,X2] :
( ( set_union2(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_union2(X0,X1) != X2 ) ),
inference(rectify,[],[f160]) ).
fof(f162,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) )
=> ( ( ( ~ in(sK4(X0,X1,X2),X1)
& ~ in(sK4(X0,X1,X2),X0) )
| ~ in(sK4(X0,X1,X2),X2) )
& ( in(sK4(X0,X1,X2),X1)
| in(sK4(X0,X1,X2),X0)
| in(sK4(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f163,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ( ( ( ~ in(sK4(X0,X1,X2),X1)
& ~ in(sK4(X0,X1,X2),X0) )
| ~ in(sK4(X0,X1,X2),X2) )
& ( in(sK4(X0,X1,X2),X1)
| in(sK4(X0,X1,X2),X0)
| in(sK4(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) )
& ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f161,f162]) ).
fof(f205,plain,
! [X0,X1] :
( ( subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f67]) ).
fof(f208,plain,
? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f124]) ).
fof(f209,plain,
? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f208]) ).
fof(f210,plain,
( ? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) )
=> ( ( ( sK19 != singleton(sK20)
& empty_set != sK19 )
| ~ subset(sK19,singleton(sK20)) )
& ( sK19 = singleton(sK20)
| empty_set = sK19
| subset(sK19,singleton(sK20)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f211,plain,
( ( ( sK19 != singleton(sK20)
& empty_set != sK19 )
| ~ subset(sK19,singleton(sK20)) )
& ( sK19 = singleton(sK20)
| empty_set = sK19
| subset(sK19,singleton(sK20)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19,sK20])],[f209,f210]) ).
fof(f214,plain,
! [X0,X1] :
( ? [X3] : in(X3,set_intersection2(X0,X1))
=> in(sK22(X0,X1),set_intersection2(X0,X1)) ),
introduced(choice_axiom,[]) ).
fof(f215,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ( in(sK22(X0,X1),set_intersection2(X0,X1))
| disjoint(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK22])],[f128,f214]) ).
fof(f225,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f145]) ).
fof(f230,plain,
! [X0] :
( empty_set = X0
| in(sK1(X0),X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f242,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f163]) ).
fof(f279,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f287,plain,
! [X0] : singleton(X0) != empty_set,
inference(cnf_transformation,[],[f37]) ).
fof(f305,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f95]) ).
fof(f308,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f315,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f120]) ).
fof(f319,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f62]) ).
fof(f327,plain,
! [X0,X1] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f205]) ).
fof(f332,plain,
( sK19 = singleton(sK20)
| empty_set = sK19
| subset(sK19,singleton(sK20)) ),
inference(cnf_transformation,[],[f211]) ).
fof(f333,plain,
( empty_set != sK19
| ~ subset(sK19,singleton(sK20)) ),
inference(cnf_transformation,[],[f211]) ).
fof(f334,plain,
( sK19 != singleton(sK20)
| ~ subset(sK19,singleton(sK20)) ),
inference(cnf_transformation,[],[f211]) ).
fof(f342,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
inference(cnf_transformation,[],[f77]) ).
fof(f345,plain,
! [X2,X0,X1] :
( ~ disjoint(X0,X1)
| ~ in(X2,set_intersection2(X0,X1)) ),
inference(cnf_transformation,[],[f215]) ).
fof(f346,plain,
! [X0,X1] :
( ~ proper_subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f129]) ).
fof(f348,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f82]) ).
fof(f364,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| unordered_pair(X0,X0) != X1 ),
inference(definition_unfolding,[],[f225,f348]) ).
fof(f379,plain,
! [X0] : empty_set != unordered_pair(X0,X0),
inference(definition_unfolding,[],[f287,f348]) ).
fof(f396,plain,
! [X0,X1] :
( set_difference(X0,set_difference(X0,X1)) = X0
| ~ subset(X0,X1) ),
inference(definition_unfolding,[],[f315,f342]) ).
fof(f400,plain,
! [X0,X1] :
( subset(unordered_pair(X0,X0),X1)
| ~ in(X0,X1) ),
inference(definition_unfolding,[],[f327,f348]) ).
fof(f402,plain,
( sK19 != unordered_pair(sK20,sK20)
| ~ subset(sK19,unordered_pair(sK20,sK20)) ),
inference(definition_unfolding,[],[f334,f348,f348]) ).
fof(f403,plain,
( empty_set != sK19
| ~ subset(sK19,unordered_pair(sK20,sK20)) ),
inference(definition_unfolding,[],[f333,f348]) ).
fof(f404,plain,
( sK19 = unordered_pair(sK20,sK20)
| empty_set = sK19
| subset(sK19,unordered_pair(sK20,sK20)) ),
inference(definition_unfolding,[],[f332,f348,f348]) ).
fof(f405,plain,
! [X2,X0,X1] :
( ~ disjoint(X0,X1)
| ~ in(X2,set_difference(X0,set_difference(X0,X1))) ),
inference(definition_unfolding,[],[f345,f342]) ).
fof(f414,plain,
! [X3,X0] :
( X0 = X3
| ~ in(X3,unordered_pair(X0,X0)) ),
inference(equality_resolution,[],[f364]) ).
fof(f424,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f242]) ).
cnf(c_60,plain,
( ~ in(X0,unordered_pair(X1,X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f414]) ).
cnf(c_61,plain,
( X0 = empty_set
| in(sK1(X0),X0) ),
inference(cnf_transformation,[],[f230]) ).
cnf(c_77,plain,
( ~ in(X0,X1)
| in(X0,set_union2(X1,X2)) ),
inference(cnf_transformation,[],[f424]) ).
cnf(c_110,plain,
( ~ subset(X0,X1)
| X0 = X1
| proper_subset(X0,X1) ),
inference(cnf_transformation,[],[f279]) ).
cnf(c_118,plain,
unordered_pair(X0,X0) != empty_set,
inference(cnf_transformation,[],[f379]) ).
cnf(c_136,plain,
subset(X0,X0),
inference(cnf_transformation,[],[f305]) ).
cnf(c_139,plain,
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f308]) ).
cnf(c_146,plain,
( ~ subset(X0,X1)
| set_difference(X0,set_difference(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f396]) ).
cnf(c_150,plain,
subset(empty_set,X0),
inference(cnf_transformation,[],[f319]) ).
cnf(c_157,plain,
( ~ in(X0,X1)
| subset(unordered_pair(X0,X0),X1) ),
inference(cnf_transformation,[],[f400]) ).
cnf(c_163,negated_conjecture,
( unordered_pair(sK20,sK20) != sK19
| ~ subset(sK19,unordered_pair(sK20,sK20)) ),
inference(cnf_transformation,[],[f402]) ).
cnf(c_164,negated_conjecture,
( empty_set != sK19
| ~ subset(sK19,unordered_pair(sK20,sK20)) ),
inference(cnf_transformation,[],[f403]) ).
cnf(c_165,negated_conjecture,
( unordered_pair(sK20,sK20) = sK19
| empty_set = sK19
| subset(sK19,unordered_pair(sK20,sK20)) ),
inference(cnf_transformation,[],[f404]) ).
cnf(c_174,plain,
( ~ in(X0,set_difference(X1,set_difference(X1,X2)))
| ~ disjoint(X1,X2) ),
inference(cnf_transformation,[],[f405]) ).
cnf(c_176,plain,
( ~ proper_subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f346]) ).
cnf(c_5713,plain,
( sK1(unordered_pair(X0,X0)) = X0
| unordered_pair(X0,X0) = empty_set ),
inference(superposition,[status(thm)],[c_61,c_60]) ).
cnf(c_5728,plain,
sK1(unordered_pair(X0,X0)) = X0,
inference(forward_subsumption_resolution,[status(thm)],[c_5713,c_118]) ).
cnf(c_5890,plain,
( set_union2(sK19,unordered_pair(sK20,sK20)) = unordered_pair(sK20,sK20)
| unordered_pair(sK20,sK20) = sK19
| empty_set = sK19 ),
inference(superposition,[status(thm)],[c_165,c_139]) ).
cnf(c_5965,plain,
( ~ in(X0,sK19)
| unordered_pair(sK20,sK20) = sK19
| empty_set = sK19
| in(X0,unordered_pair(sK20,sK20)) ),
inference(superposition,[status(thm)],[c_5890,c_77]) ).
cnf(c_6022,plain,
( ~ in(X0,sK19)
| unordered_pair(sK20,sK20) = sK19
| X0 = sK20
| empty_set = sK19 ),
inference(superposition,[status(thm)],[c_5965,c_60]) ).
cnf(c_6101,plain,
( unordered_pair(sK20,sK20) = sK19
| sK1(sK19) = sK20
| empty_set = sK19 ),
inference(superposition,[status(thm)],[c_61,c_6022]) ).
cnf(c_6511,plain,
( sK1(sK19) = sK20
| empty_set = sK19 ),
inference(superposition,[status(thm)],[c_6101,c_5728]) ).
cnf(c_7031,plain,
( unordered_pair(sK20,sK20) = sK19
| empty_set = sK19
| proper_subset(sK19,unordered_pair(sK20,sK20)) ),
inference(superposition,[status(thm)],[c_165,c_110]) ).
cnf(c_7301,plain,
( ~ subset(unordered_pair(sK20,sK20),sK19)
| unordered_pair(sK20,sK20) = sK19
| empty_set = sK19 ),
inference(superposition,[status(thm)],[c_7031,c_176]) ).
cnf(c_7391,plain,
( ~ in(sK20,sK19)
| unordered_pair(sK20,sK20) = sK19
| empty_set = sK19 ),
inference(superposition,[status(thm)],[c_157,c_7301]) ).
cnf(c_9428,plain,
( set_difference(sK19,set_difference(sK19,unordered_pair(sK20,sK20))) = sK19
| unordered_pair(sK20,sK20) = sK19
| empty_set = sK19 ),
inference(superposition,[status(thm)],[c_165,c_146]) ).
cnf(c_9853,plain,
( empty_set = sK19
| in(sK20,sK19) ),
inference(superposition,[status(thm)],[c_6511,c_61]) ).
cnf(c_10035,plain,
( ~ disjoint(sK19,unordered_pair(sK20,sK20))
| ~ in(X0,sK19)
| unordered_pair(sK20,sK20) = sK19
| empty_set = sK19 ),
inference(superposition,[status(thm)],[c_9428,c_174]) ).
cnf(c_10294,plain,
( unordered_pair(sK20,sK20) = sK19
| empty_set = sK19 ),
inference(global_subsumption_just,[status(thm)],[c_10035,c_7391,c_9853]) ).
cnf(c_10322,plain,
( ~ subset(sK19,unordered_pair(sK20,sK20))
| empty_set = sK19 ),
inference(superposition,[status(thm)],[c_10294,c_163]) ).
cnf(c_10373,plain,
~ subset(sK19,unordered_pair(sK20,sK20)),
inference(global_subsumption_just,[status(thm)],[c_10322,c_164,c_10322]) ).
cnf(c_10376,plain,
( ~ subset(sK19,sK19)
| empty_set = sK19 ),
inference(superposition,[status(thm)],[c_10294,c_10373]) ).
cnf(c_10377,plain,
empty_set = sK19,
inference(forward_subsumption_resolution,[status(thm)],[c_10376,c_136]) ).
cnf(c_10378,plain,
~ subset(empty_set,unordered_pair(sK20,sK20)),
inference(demodulation,[status(thm)],[c_10373,c_10377]) ).
cnf(c_10379,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10378,c_150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU160+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n032.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 : Wed Aug 23 13:58:26 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.44 Running first-order theorem proving
% 0.20/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.29/1.07 % SZS status Started for theBenchmark.p
% 3.29/1.07 % SZS status Theorem for theBenchmark.p
% 3.29/1.07
% 3.29/1.07 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.29/1.07
% 3.29/1.07 ------ iProver source info
% 3.29/1.07
% 3.29/1.07 git: date: 2023-05-31 18:12:56 +0000
% 3.29/1.07 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.29/1.07 git: non_committed_changes: false
% 3.29/1.07 git: last_make_outside_of_git: false
% 3.29/1.07
% 3.29/1.07 ------ Parsing...
% 3.29/1.07 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.29/1.07
% 3.29/1.07 ------ 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
% 3.29/1.07
% 3.29/1.07 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.29/1.07
% 3.29/1.07 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.29/1.07 ------ Proving...
% 3.29/1.07 ------ Problem Properties
% 3.29/1.07
% 3.29/1.07
% 3.29/1.07 clauses 124
% 3.29/1.07 conjectures 3
% 3.29/1.07 EPR 21
% 3.29/1.07 Horn 95
% 3.29/1.07 unary 24
% 3.29/1.07 binary 55
% 3.29/1.07 lits 276
% 3.29/1.07 lits eq 82
% 3.29/1.07 fd_pure 0
% 3.29/1.07 fd_pseudo 0
% 3.29/1.07 fd_cond 3
% 3.29/1.07 fd_pseudo_cond 35
% 3.29/1.07 AC symbols 0
% 3.29/1.07
% 3.29/1.07 ------ Schedule dynamic 5 is on
% 3.29/1.07
% 3.29/1.07 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.29/1.07
% 3.29/1.07
% 3.29/1.07 ------
% 3.29/1.07 Current options:
% 3.29/1.07 ------
% 3.29/1.07
% 3.29/1.07
% 3.29/1.07
% 3.29/1.07
% 3.29/1.07 ------ Proving...
% 3.29/1.07
% 3.29/1.07
% 3.29/1.07 % SZS status Theorem for theBenchmark.p
% 3.29/1.07
% 3.29/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.29/1.07
% 3.29/1.07
%------------------------------------------------------------------------------