TSTP Solution File: SEU268+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU268+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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:05:21 EDT 2023
% Result : Theorem 32.09s 5.24s
% Output : CNFRefutation 32.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 21
% Syntax : Number of formulae : 106 ( 48 unt; 0 def)
% Number of atoms : 305 ( 65 equ)
% Maximal formula atoms : 17 ( 2 avg)
% Number of connectives : 341 ( 142 ~; 129 |; 51 &)
% ( 9 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 1 con; 0-2 aty)
% Number of variables : 220 ( 9 sgn; 136 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f34,axiom,
! [X0,X1] :
( relation(X1)
=> ( inclusion_relation(X0) = X1
<=> ( ! [X2,X3] :
( ( in(X3,X0)
& in(X2,X0) )
=> ( in(ordered_pair(X2,X3),X1)
<=> subset(X2,X3) ) )
& relation_field(X1) = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_wellord2) ).
fof(f60,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(f61,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f86,axiom,
! [X0] : relation(inclusion_relation(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_wellord2) ).
fof(f153,axiom,
! [X0,X1] :
( element(X1,powerset(X0))
=> subset_complement(X0,subset_complement(X0,X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',involutiveness_k3_subset_1) ).
fof(f157,axiom,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> ! [X1] :
( in(X1,relation_field(X0))
=> in(ordered_pair(X1,X1),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_wellord1) ).
fof(f197,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f259,conjecture,
! [X0] : reflexive(inclusion_relation(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_wellord2) ).
fof(f260,negated_conjecture,
~ ! [X0] : reflexive(inclusion_relation(X0)),
inference(negated_conjecture,[],[f259]) ).
fof(f272,axiom,
! [X0,X1] : subset(set_difference(X0,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_xboole_1) ).
fof(f278,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(f282,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f285,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(f298,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(f302,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/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f321,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f331,axiom,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f352,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f197]) ).
fof(f356,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,[],[f302]) ).
fof(f392,plain,
! [X0,X1] :
( ( inclusion_relation(X0) = X1
<=> ( ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X1)
<=> subset(X2,X3) )
| ~ in(X3,X0)
| ~ in(X2,X0) )
& relation_field(X1) = X0 ) )
| ~ relation(X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f393,plain,
! [X0,X1] :
( ( inclusion_relation(X0) = X1
<=> ( ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X1)
<=> subset(X2,X3) )
| ~ in(X3,X0)
| ~ in(X2,X0) )
& relation_field(X1) = X0 ) )
| ~ relation(X1) ),
inference(flattening,[],[f392]) ).
fof(f412,plain,
! [X0,X1] :
( set_difference(X0,X1) = subset_complement(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f60]) ).
fof(f481,plain,
! [X0,X1] :
( subset_complement(X0,subset_complement(X0,X1)) = X1
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f153]) ).
fof(f484,plain,
! [X0] :
( ( reflexive(X0)
<=> ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f157]) ).
fof(f592,plain,
? [X0] : ~ reflexive(inclusion_relation(X0)),
inference(ennf_transformation,[],[f260]) ).
fof(f636,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,[],[f356]) ).
fof(f772,plain,
! [X0,X1] :
( ( ( inclusion_relation(X0) = X1
| ? [X2,X3] :
( ( ~ subset(X2,X3)
| ~ in(ordered_pair(X2,X3),X1) )
& ( subset(X2,X3)
| in(ordered_pair(X2,X3),X1) )
& in(X3,X0)
& in(X2,X0) )
| relation_field(X1) != X0 )
& ( ( ! [X2,X3] :
( ( ( in(ordered_pair(X2,X3),X1)
| ~ subset(X2,X3) )
& ( subset(X2,X3)
| ~ in(ordered_pair(X2,X3),X1) ) )
| ~ in(X3,X0)
| ~ in(X2,X0) )
& relation_field(X1) = X0 )
| inclusion_relation(X0) != X1 ) )
| ~ relation(X1) ),
inference(nnf_transformation,[],[f393]) ).
fof(f773,plain,
! [X0,X1] :
( ( ( inclusion_relation(X0) = X1
| ? [X2,X3] :
( ( ~ subset(X2,X3)
| ~ in(ordered_pair(X2,X3),X1) )
& ( subset(X2,X3)
| in(ordered_pair(X2,X3),X1) )
& in(X3,X0)
& in(X2,X0) )
| relation_field(X1) != X0 )
& ( ( ! [X2,X3] :
( ( ( in(ordered_pair(X2,X3),X1)
| ~ subset(X2,X3) )
& ( subset(X2,X3)
| ~ in(ordered_pair(X2,X3),X1) ) )
| ~ in(X3,X0)
| ~ in(X2,X0) )
& relation_field(X1) = X0 )
| inclusion_relation(X0) != X1 ) )
| ~ relation(X1) ),
inference(flattening,[],[f772]) ).
fof(f774,plain,
! [X0,X1] :
( ( ( inclusion_relation(X0) = X1
| ? [X2,X3] :
( ( ~ subset(X2,X3)
| ~ in(ordered_pair(X2,X3),X1) )
& ( subset(X2,X3)
| in(ordered_pair(X2,X3),X1) )
& in(X3,X0)
& in(X2,X0) )
| relation_field(X1) != X0 )
& ( ( ! [X4,X5] :
( ( ( in(ordered_pair(X4,X5),X1)
| ~ subset(X4,X5) )
& ( subset(X4,X5)
| ~ in(ordered_pair(X4,X5),X1) ) )
| ~ in(X5,X0)
| ~ in(X4,X0) )
& relation_field(X1) = X0 )
| inclusion_relation(X0) != X1 ) )
| ~ relation(X1) ),
inference(rectify,[],[f773]) ).
fof(f775,plain,
! [X0,X1] :
( ? [X2,X3] :
( ( ~ subset(X2,X3)
| ~ in(ordered_pair(X2,X3),X1) )
& ( subset(X2,X3)
| in(ordered_pair(X2,X3),X1) )
& in(X3,X0)
& in(X2,X0) )
=> ( ( ~ subset(sK31(X0,X1),sK32(X0,X1))
| ~ in(ordered_pair(sK31(X0,X1),sK32(X0,X1)),X1) )
& ( subset(sK31(X0,X1),sK32(X0,X1))
| in(ordered_pair(sK31(X0,X1),sK32(X0,X1)),X1) )
& in(sK32(X0,X1),X0)
& in(sK31(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f776,plain,
! [X0,X1] :
( ( ( inclusion_relation(X0) = X1
| ( ( ~ subset(sK31(X0,X1),sK32(X0,X1))
| ~ in(ordered_pair(sK31(X0,X1),sK32(X0,X1)),X1) )
& ( subset(sK31(X0,X1),sK32(X0,X1))
| in(ordered_pair(sK31(X0,X1),sK32(X0,X1)),X1) )
& in(sK32(X0,X1),X0)
& in(sK31(X0,X1),X0) )
| relation_field(X1) != X0 )
& ( ( ! [X4,X5] :
( ( ( in(ordered_pair(X4,X5),X1)
| ~ subset(X4,X5) )
& ( subset(X4,X5)
| ~ in(ordered_pair(X4,X5),X1) ) )
| ~ in(X5,X0)
| ~ in(X4,X0) )
& relation_field(X1) = X0 )
| inclusion_relation(X0) != X1 ) )
| ~ relation(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31,sK32])],[f774,f775]) ).
fof(f924,plain,
! [X0] :
( ( ( reflexive(X0)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) ) )
& ( ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) )
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f484]) ).
fof(f925,plain,
! [X0] :
( ( ( reflexive(X0)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) ) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) )
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(rectify,[],[f924]) ).
fof(f926,plain,
! [X0] :
( ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) )
=> ( ~ in(ordered_pair(sK91(X0),sK91(X0)),X0)
& in(sK91(X0),relation_field(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f927,plain,
! [X0] :
( ( ( reflexive(X0)
| ( ~ in(ordered_pair(sK91(X0),sK91(X0)),X0)
& in(sK91(X0),relation_field(X0)) ) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) )
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK91])],[f925,f926]) ).
fof(f1012,plain,
( ? [X0] : ~ reflexive(inclusion_relation(X0))
=> ~ reflexive(inclusion_relation(sK122)) ),
introduced(choice_axiom,[]) ).
fof(f1013,plain,
~ reflexive(inclusion_relation(sK122)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK122])],[f592,f1012]) ).
fof(f1030,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f282]) ).
fof(f1040,plain,
! [X0,X1] :
( ? [X3] : in(X3,set_intersection2(X0,X1))
=> in(sK129(X0,X1),set_intersection2(X0,X1)) ),
introduced(choice_axiom,[]) ).
fof(f1041,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ( in(sK129(X0,X1),set_intersection2(X0,X1))
| disjoint(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK129])],[f636,f1040]) ).
fof(f1089,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f1183,plain,
! [X0,X1] :
( relation_field(X1) = X0
| inclusion_relation(X0) != X1
| ~ relation(X1) ),
inference(cnf_transformation,[],[f776]) ).
fof(f1185,plain,
! [X0,X1,X4,X5] :
( in(ordered_pair(X4,X5),X1)
| ~ subset(X4,X5)
| ~ in(X5,X0)
| ~ in(X4,X0)
| inclusion_relation(X0) != X1
| ~ relation(X1) ),
inference(cnf_transformation,[],[f776]) ).
fof(f1304,plain,
! [X0,X1] :
( set_difference(X0,X1) = subset_complement(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(cnf_transformation,[],[f412]) ).
fof(f1305,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f61]) ).
fof(f1369,plain,
! [X0] : relation(inclusion_relation(X0)),
inference(cnf_transformation,[],[f86]) ).
fof(f1448,plain,
! [X0,X1] :
( subset_complement(X0,subset_complement(X0,X1)) = X1
| ~ element(X1,powerset(X0)) ),
inference(cnf_transformation,[],[f481]) ).
fof(f1453,plain,
! [X0] :
( reflexive(X0)
| in(sK91(X0),relation_field(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f927]) ).
fof(f1454,plain,
! [X0] :
( reflexive(X0)
| ~ in(ordered_pair(sK91(X0),sK91(X0)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f927]) ).
fof(f1539,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f352]) ).
fof(f1628,plain,
~ reflexive(inclusion_relation(sK122)),
inference(cnf_transformation,[],[f1013]) ).
fof(f1649,plain,
! [X0,X1] : subset(set_difference(X0,X1),X0),
inference(cnf_transformation,[],[f272]) ).
fof(f1660,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)),
inference(cnf_transformation,[],[f278]) ).
fof(f1667,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f1030]) ).
fof(f1672,plain,
! [X0,X1] : set_difference(X0,X1) = set_difference(set_union2(X0,X1),X1),
inference(cnf_transformation,[],[f285]) ).
fof(f1691,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
inference(cnf_transformation,[],[f298]) ).
fof(f1696,plain,
! [X2,X0,X1] :
( ~ disjoint(X0,X1)
| ~ in(X2,set_intersection2(X0,X1)) ),
inference(cnf_transformation,[],[f1041]) ).
fof(f1740,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f321]) ).
fof(f1755,plain,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f331]) ).
fof(f1781,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f1305,f1740]) ).
fof(f1826,plain,
! [X0,X1,X4,X5] :
( in(unordered_pair(unordered_pair(X4,X5),unordered_pair(X4,X4)),X1)
| ~ subset(X4,X5)
| ~ in(X5,X0)
| ~ in(X4,X0)
| inclusion_relation(X0) != X1
| ~ relation(X1) ),
inference(definition_unfolding,[],[f1185,f1781]) ).
fof(f1898,plain,
! [X0] :
( reflexive(X0)
| ~ in(unordered_pair(unordered_pair(sK91(X0),sK91(X0)),unordered_pair(sK91(X0),sK91(X0))),X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f1454,f1781]) ).
fof(f1961,plain,
! [X2,X0,X1] :
( ~ disjoint(X0,X1)
| ~ in(X2,set_difference(X0,set_difference(X0,X1))) ),
inference(definition_unfolding,[],[f1696,f1691]) ).
fof(f2036,plain,
! [X0,X4,X5] :
( in(unordered_pair(unordered_pair(X4,X5),unordered_pair(X4,X4)),inclusion_relation(X0))
| ~ subset(X4,X5)
| ~ in(X5,X0)
| ~ in(X4,X0)
| ~ relation(inclusion_relation(X0)) ),
inference(equality_resolution,[],[f1826]) ).
fof(f2038,plain,
! [X0] :
( relation_field(inclusion_relation(X0)) = X0
| ~ relation(inclusion_relation(X0)) ),
inference(equality_resolution,[],[f1183]) ).
cnf(c_62,plain,
set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f1089]) ).
cnf(c_159,plain,
( ~ in(X0,X1)
| ~ in(X2,X1)
| ~ subset(X2,X0)
| ~ relation(inclusion_relation(X1))
| in(unordered_pair(unordered_pair(X2,X0),unordered_pair(X2,X2)),inclusion_relation(X1)) ),
inference(cnf_transformation,[],[f2036]) ).
cnf(c_161,plain,
( ~ relation(inclusion_relation(X0))
| relation_field(inclusion_relation(X0)) = X0 ),
inference(cnf_transformation,[],[f2038]) ).
cnf(c_276,plain,
( ~ element(X0,powerset(X1))
| set_difference(X1,X0) = subset_complement(X1,X0) ),
inference(cnf_transformation,[],[f1304]) ).
cnf(c_340,plain,
relation(inclusion_relation(X0)),
inference(cnf_transformation,[],[f1369]) ).
cnf(c_419,plain,
( ~ element(X0,powerset(X1))
| subset_complement(X1,subset_complement(X1,X0)) = X0 ),
inference(cnf_transformation,[],[f1448]) ).
cnf(c_423,plain,
( ~ in(unordered_pair(unordered_pair(sK91(X0),sK91(X0)),unordered_pair(sK91(X0),sK91(X0))),X0)
| ~ relation(X0)
| reflexive(X0) ),
inference(cnf_transformation,[],[f1898]) ).
cnf(c_424,plain,
( ~ relation(X0)
| in(sK91(X0),relation_field(X0))
| reflexive(X0) ),
inference(cnf_transformation,[],[f1453]) ).
cnf(c_510,plain,
subset(X0,X0),
inference(cnf_transformation,[],[f1539]) ).
cnf(c_599,negated_conjecture,
~ reflexive(inclusion_relation(sK122)),
inference(cnf_transformation,[],[f1628]) ).
cnf(c_620,plain,
subset(set_difference(X0,X1),X0),
inference(cnf_transformation,[],[f1649]) ).
cnf(c_631,plain,
set_union2(X0,set_difference(X1,X0)) = set_union2(X0,X1),
inference(cnf_transformation,[],[f1660]) ).
cnf(c_637,plain,
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f1667]) ).
cnf(c_643,plain,
set_difference(set_union2(X0,X1),X1) = set_difference(X0,X1),
inference(cnf_transformation,[],[f1672]) ).
cnf(c_665,plain,
( ~ in(X0,set_difference(X1,set_difference(X1,X2)))
| ~ disjoint(X1,X2) ),
inference(cnf_transformation,[],[f1961]) ).
cnf(c_724,plain,
subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f1755]) ).
cnf(c_1186,plain,
relation_field(inclusion_relation(X0)) = X0,
inference(global_subsumption_just,[status(thm)],[c_161,c_340,c_161]) ).
cnf(c_1463,plain,
( ~ subset(X0,X1)
| set_difference(X1,X0) = subset_complement(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_637,c_276]) ).
cnf(c_1467,plain,
( ~ subset(X0,X1)
| subset_complement(X1,subset_complement(X1,X0)) = X0 ),
inference(prop_impl_just,[status(thm)],[c_637,c_419]) ).
cnf(c_2869,plain,
( ~ in(X0,X1)
| ~ in(X2,X1)
| ~ subset(X2,X0)
| in(unordered_pair(unordered_pair(X2,X0),unordered_pair(X2,X2)),inclusion_relation(X1)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_159,c_340]) ).
cnf(c_15111,plain,
( ~ subset(X0,X1)
| set_difference(X1,X0) = subset_complement(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_1463]) ).
cnf(c_15115,plain,
( ~ subset(X0,X1)
| subset_complement(X1,subset_complement(X1,X0)) = X0 ),
inference(prop_impl_just,[status(thm)],[c_1467]) ).
cnf(c_39367,plain,
subset(X0,set_union2(X1,X0)),
inference(superposition,[status(thm)],[c_62,c_724]) ).
cnf(c_40109,plain,
set_difference(set_union2(X0,X1),set_difference(X1,X0)) = set_difference(X0,set_difference(X1,X0)),
inference(superposition,[status(thm)],[c_631,c_643]) ).
cnf(c_40114,plain,
subset(set_difference(X0,X1),set_union2(X0,X1)),
inference(superposition,[status(thm)],[c_643,c_620]) ).
cnf(c_44859,plain,
( ~ relation(inclusion_relation(X0))
| in(sK91(inclusion_relation(X0)),X0)
| reflexive(inclusion_relation(X0)) ),
inference(superposition,[status(thm)],[c_1186,c_424]) ).
cnf(c_44882,plain,
( in(sK91(inclusion_relation(X0)),X0)
| reflexive(inclusion_relation(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_44859,c_340]) ).
cnf(c_51872,plain,
set_difference(set_union2(X0,X1),set_difference(X0,X1)) = set_difference(X1,set_difference(X0,X1)),
inference(superposition,[status(thm)],[c_62,c_40109]) ).
cnf(c_57681,plain,
set_difference(set_union2(X0,X1),X1) = subset_complement(set_union2(X0,X1),X1),
inference(superposition,[status(thm)],[c_39367,c_15111]) ).
cnf(c_57688,plain,
set_difference(set_union2(X0,X1),set_difference(X0,X1)) = subset_complement(set_union2(X0,X1),set_difference(X0,X1)),
inference(superposition,[status(thm)],[c_40114,c_15111]) ).
cnf(c_57708,plain,
subset_complement(set_union2(X0,X1),X1) = set_difference(X0,X1),
inference(light_normalisation,[status(thm)],[c_57681,c_643]) ).
cnf(c_57732,plain,
subset_complement(set_union2(X0,X1),set_difference(X0,X1)) = set_difference(X1,set_difference(X0,X1)),
inference(light_normalisation,[status(thm)],[c_57688,c_51872]) ).
cnf(c_57912,plain,
subset_complement(set_union2(X0,X1),subset_complement(set_union2(X0,X1),X1)) = X1,
inference(superposition,[status(thm)],[c_39367,c_15115]) ).
cnf(c_57943,plain,
set_difference(X0,set_difference(X1,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_57912,c_57708,c_57732]) ).
cnf(c_101784,plain,
( ~ in(X0,X1)
| ~ disjoint(X1,X1) ),
inference(superposition,[status(thm)],[c_57943,c_665]) ).
cnf(c_125603,plain,
( ~ subset(sK91(inclusion_relation(X0)),sK91(inclusion_relation(X0)))
| ~ in(sK91(inclusion_relation(X0)),X0)
| ~ relation(inclusion_relation(X0))
| reflexive(inclusion_relation(X0)) ),
inference(superposition,[status(thm)],[c_2869,c_423]) ).
cnf(c_125623,plain,
( ~ in(sK91(inclusion_relation(X0)),X0)
| reflexive(inclusion_relation(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_125603,c_340,c_510]) ).
cnf(c_142527,plain,
( ~ disjoint(X0,X0)
| reflexive(inclusion_relation(X0)) ),
inference(superposition,[status(thm)],[c_44882,c_101784]) ).
cnf(c_144853,plain,
reflexive(inclusion_relation(X0)),
inference(global_subsumption_just,[status(thm)],[c_142527,c_44882,c_125623]) ).
cnf(c_144856,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_599,c_144853]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU268+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n001.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Aug 23 16:31:24 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 32.09/5.24 % SZS status Started for theBenchmark.p
% 32.09/5.24 % SZS status Theorem for theBenchmark.p
% 32.09/5.24
% 32.09/5.24 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 32.09/5.24
% 32.09/5.24 ------ iProver source info
% 32.09/5.24
% 32.09/5.24 git: date: 2023-05-31 18:12:56 +0000
% 32.09/5.24 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 32.09/5.24 git: non_committed_changes: false
% 32.09/5.24 git: last_make_outside_of_git: false
% 32.09/5.24
% 32.09/5.24 ------ Parsing...
% 32.09/5.24 ------ Clausification by vclausify_rel & Parsing by iProver...
% 32.09/5.24
% 32.09/5.24 ------ Preprocessing... sup_sim: 69 sf_s rm: 6 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
% 32.09/5.24
% 32.09/5.24 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 32.09/5.24
% 32.09/5.24 ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 32.09/5.24 ------ Proving...
% 32.09/5.24 ------ Problem Properties
% 32.09/5.24
% 32.09/5.24
% 32.09/5.24 clauses 626
% 32.09/5.24 conjectures 1
% 32.09/5.24 EPR 99
% 32.09/5.24 Horn 488
% 32.09/5.24 unary 87
% 32.09/5.24 binary 165
% 32.09/5.24 lits 1859
% 32.09/5.24 lits eq 298
% 32.09/5.24 fd_pure 0
% 32.09/5.24 fd_pseudo 0
% 32.09/5.24 fd_cond 21
% 32.09/5.24 fd_pseudo_cond 103
% 32.09/5.24 AC symbols 0
% 32.09/5.24
% 32.09/5.24 ------ Schedule dynamic 5 is on
% 32.09/5.24
% 32.09/5.24 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 32.09/5.24
% 32.09/5.24
% 32.09/5.24 ------
% 32.09/5.24 Current options:
% 32.09/5.24 ------
% 32.09/5.24
% 32.09/5.24
% 32.09/5.24
% 32.09/5.24
% 32.09/5.24 ------ Proving...
% 32.09/5.24
% 32.09/5.24
% 32.09/5.24 % SZS status Theorem for theBenchmark.p
% 32.09/5.24
% 32.09/5.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 32.09/5.24
% 32.09/5.25
%------------------------------------------------------------------------------