TSTP Solution File: SEU168+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU168+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:20 EDT 2023
% Result : Theorem 3.59s 1.14s
% Output : CNFRefutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of formulae : 95 ( 10 unt; 0 def)
% Number of atoms : 424 ( 12 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 540 ( 211 ~; 191 |; 115 &)
% ( 4 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 243 ( 2 sgn; 139 !; 47 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f5,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f6,conjecture,
! [X0] :
? [X1] :
( ! [X2] :
~ ( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
& ! [X2] :
( in(X2,X1)
=> in(powerset(X2),X1) )
& ! [X2,X3] :
( ( subset(X3,X2)
& in(X2,X1) )
=> in(X3,X1) )
& in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t136_zfmisc_1) ).
fof(f7,negated_conjecture,
~ ! [X0] :
? [X1] :
( ! [X2] :
~ ( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
& ! [X2] :
( in(X2,X1)
=> in(powerset(X2),X1) )
& ! [X2,X3] :
( ( subset(X3,X2)
& in(X2,X1) )
=> in(X3,X1) )
& in(X0,X1) ),
inference(negated_conjecture,[],[f6]) ).
fof(f8,axiom,
! [X0] :
? [X1] :
( ! [X2] :
~ ( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
& ! [X2] :
~ ( ! [X3] :
~ ( ! [X4] :
( subset(X4,X2)
=> in(X4,X3) )
& in(X3,X1) )
& in(X2,X1) )
& ! [X2,X3] :
( ( subset(X3,X2)
& in(X2,X1) )
=> in(X3,X1) )
& in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_tarski) ).
fof(f9,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f5]) ).
fof(f10,plain,
~ ! [X0] :
? [X1] :
( ! [X2] :
~ ( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
& ! [X3] :
( in(X3,X1)
=> in(powerset(X3),X1) )
& ! [X4,X5] :
( ( subset(X5,X4)
& in(X4,X1) )
=> in(X5,X1) )
& in(X0,X1) ),
inference(rectify,[],[f7]) ).
fof(f11,plain,
! [X0] :
? [X1] :
( ! [X2] :
~ ( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
& ! [X3] :
~ ( ! [X4] :
~ ( ! [X5] :
( subset(X5,X3)
=> in(X5,X4) )
& in(X4,X1) )
& in(X3,X1) )
& ! [X6,X7] :
( ( subset(X7,X6)
& in(X6,X1) )
=> in(X7,X1) )
& in(X0,X1) ),
inference(rectify,[],[f8]) ).
fof(f13,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f14,plain,
? [X0] :
! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
| ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
| ? [X4,X5] :
( ~ in(X5,X1)
& subset(X5,X4)
& in(X4,X1) )
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f15,plain,
? [X0] :
! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
| ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
| ? [X4,X5] :
( ~ in(X5,X1)
& subset(X5,X4)
& in(X4,X1) )
| ~ in(X0,X1) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0] :
? [X1] :
( ! [X2] :
( in(X2,X1)
| are_equipotent(X2,X1)
| ~ subset(X2,X1) )
& ! [X3] :
( ? [X4] :
( ! [X5] :
( in(X5,X4)
| ~ subset(X5,X3) )
& in(X4,X1) )
| ~ in(X3,X1) )
& ! [X6,X7] :
( in(X7,X1)
| ~ subset(X7,X6)
| ~ in(X6,X1) )
& in(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f17,plain,
! [X0] :
? [X1] :
( ! [X2] :
( in(X2,X1)
| are_equipotent(X2,X1)
| ~ subset(X2,X1) )
& ! [X3] :
( ? [X4] :
( ! [X5] :
( in(X5,X4)
| ~ subset(X5,X3) )
& in(X4,X1) )
| ~ in(X3,X1) )
& ! [X6,X7] :
( in(X7,X1)
| ~ subset(X7,X6)
| ~ in(X6,X1) )
& in(X0,X1) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X1] :
( ? [X4,X5] :
( ~ in(X5,X1)
& subset(X5,X4)
& in(X4,X1) )
| ~ sP0(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f19,plain,
? [X0] :
! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
| ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
| sP0(X1)
| ~ in(X0,X1) ),
inference(definition_folding,[],[f15,f18]) ).
fof(f20,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,[],[f2]) ).
fof(f21,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,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ subset(sK1(X0,X1),X0)
| ~ in(sK1(X0,X1),X1) )
& ( subset(sK1(X0,X1),X0)
| in(sK1(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ( ( ~ subset(sK1(X0,X1),X0)
| ~ in(sK1(X0,X1),X1) )
& ( subset(sK1(X0,X1),X0)
| in(sK1(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,[sK1])],[f21,f22]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f25,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f25,f26]) ).
fof(f28,plain,
! [X1] :
( ? [X4,X5] :
( ~ in(X5,X1)
& subset(X5,X4)
& in(X4,X1) )
| ~ sP0(X1) ),
inference(nnf_transformation,[],[f18]) ).
fof(f29,plain,
! [X0] :
( ? [X1,X2] :
( ~ in(X2,X0)
& subset(X2,X1)
& in(X1,X0) )
| ~ sP0(X0) ),
inference(rectify,[],[f28]) ).
fof(f30,plain,
! [X0] :
( ? [X1,X2] :
( ~ in(X2,X0)
& subset(X2,X1)
& in(X1,X0) )
=> ( ~ in(sK4(X0),X0)
& subset(sK4(X0),sK3(X0))
& in(sK3(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0] :
( ( ~ in(sK4(X0),X0)
& subset(sK4(X0),sK3(X0))
& in(sK3(X0),X0) )
| ~ sP0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f29,f30]) ).
fof(f32,plain,
( ? [X0] :
! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
| ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
| sP0(X1)
| ~ in(X0,X1) )
=> ! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
| ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
| sP0(X1)
| ~ in(sK5,X1) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X1] :
( ? [X2] :
( ~ in(X2,X1)
& ~ are_equipotent(X2,X1)
& subset(X2,X1) )
=> ( ~ in(sK6(X1),X1)
& ~ are_equipotent(sK6(X1),X1)
& subset(sK6(X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
! [X1] :
( ? [X3] :
( ~ in(powerset(X3),X1)
& in(X3,X1) )
=> ( ~ in(powerset(sK7(X1)),X1)
& in(sK7(X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
! [X1] :
( ( ~ in(sK6(X1),X1)
& ~ are_equipotent(sK6(X1),X1)
& subset(sK6(X1),X1) )
| ( ~ in(powerset(sK7(X1)),X1)
& in(sK7(X1),X1) )
| sP0(X1)
| ~ in(sK5,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f19,f34,f33,f32]) ).
fof(f36,plain,
! [X0] :
( ? [X1] :
( ! [X2] :
( in(X2,X1)
| are_equipotent(X2,X1)
| ~ subset(X2,X1) )
& ! [X3] :
( ? [X4] :
( ! [X5] :
( in(X5,X4)
| ~ subset(X5,X3) )
& in(X4,X1) )
| ~ in(X3,X1) )
& ! [X6,X7] :
( in(X7,X1)
| ~ subset(X7,X6)
| ~ in(X6,X1) )
& in(X0,X1) )
=> ( ! [X2] :
( in(X2,sK8(X0))
| are_equipotent(X2,sK8(X0))
| ~ subset(X2,sK8(X0)) )
& ! [X3] :
( ? [X4] :
( ! [X5] :
( in(X5,X4)
| ~ subset(X5,X3) )
& in(X4,sK8(X0)) )
| ~ in(X3,sK8(X0)) )
& ! [X7,X6] :
( in(X7,sK8(X0))
| ~ subset(X7,X6)
| ~ in(X6,sK8(X0)) )
& in(X0,sK8(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
! [X0,X3] :
( ? [X4] :
( ! [X5] :
( in(X5,X4)
| ~ subset(X5,X3) )
& in(X4,sK8(X0)) )
=> ( ! [X5] :
( in(X5,sK9(X0,X3))
| ~ subset(X5,X3) )
& in(sK9(X0,X3),sK8(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0] :
( ! [X2] :
( in(X2,sK8(X0))
| are_equipotent(X2,sK8(X0))
| ~ subset(X2,sK8(X0)) )
& ! [X3] :
( ( ! [X5] :
( in(X5,sK9(X0,X3))
| ~ subset(X5,X3) )
& in(sK9(X0,X3),sK8(X0)) )
| ~ in(X3,sK8(X0)) )
& ! [X6,X7] :
( in(X7,sK8(X0))
| ~ subset(X7,X6)
| ~ in(X6,sK8(X0)) )
& in(X0,sK8(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9])],[f17,f37,f36]) ).
fof(f40,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f45,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f46,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f47,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f9]) ).
fof(f48,plain,
! [X0] :
( in(sK3(X0),X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f49,plain,
! [X0] :
( subset(sK4(X0),sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f50,plain,
! [X0] :
( ~ in(sK4(X0),X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f51,plain,
! [X1] :
( subset(sK6(X1),X1)
| in(sK7(X1),X1)
| sP0(X1)
| ~ in(sK5,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f52,plain,
! [X1] :
( subset(sK6(X1),X1)
| ~ in(powerset(sK7(X1)),X1)
| sP0(X1)
| ~ in(sK5,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f53,plain,
! [X1] :
( ~ are_equipotent(sK6(X1),X1)
| in(sK7(X1),X1)
| sP0(X1)
| ~ in(sK5,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f54,plain,
! [X1] :
( ~ are_equipotent(sK6(X1),X1)
| ~ in(powerset(sK7(X1)),X1)
| sP0(X1)
| ~ in(sK5,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f55,plain,
! [X1] :
( ~ in(sK6(X1),X1)
| in(sK7(X1),X1)
| sP0(X1)
| ~ in(sK5,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f56,plain,
! [X1] :
( ~ in(sK6(X1),X1)
| ~ in(powerset(sK7(X1)),X1)
| sP0(X1)
| ~ in(sK5,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f57,plain,
! [X0] : in(X0,sK8(X0)),
inference(cnf_transformation,[],[f38]) ).
fof(f58,plain,
! [X0,X6,X7] :
( in(X7,sK8(X0))
| ~ subset(X7,X6)
| ~ in(X6,sK8(X0)) ),
inference(cnf_transformation,[],[f38]) ).
fof(f59,plain,
! [X3,X0] :
( in(sK9(X0,X3),sK8(X0))
| ~ in(X3,sK8(X0)) ),
inference(cnf_transformation,[],[f38]) ).
fof(f60,plain,
! [X3,X0,X5] :
( in(X5,sK9(X0,X3))
| ~ subset(X5,X3)
| ~ in(X3,sK8(X0)) ),
inference(cnf_transformation,[],[f38]) ).
fof(f61,plain,
! [X2,X0] :
( in(X2,sK8(X0))
| are_equipotent(X2,sK8(X0))
| ~ subset(X2,sK8(X0)) ),
inference(cnf_transformation,[],[f38]) ).
fof(f63,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f40]) ).
cnf(c_53,plain,
( ~ in(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_54,plain,
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_55,plain,
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f45]) ).
cnf(c_57,plain,
subset(X0,X0),
inference(cnf_transformation,[],[f47]) ).
cnf(c_58,plain,
( ~ in(sK4(X0),X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f50]) ).
cnf(c_59,plain,
( ~ sP0(X0)
| subset(sK4(X0),sK3(X0)) ),
inference(cnf_transformation,[],[f49]) ).
cnf(c_60,plain,
( ~ sP0(X0)
| in(sK3(X0),X0) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_61,negated_conjecture,
( ~ in(powerset(sK7(X0)),X0)
| ~ in(sK6(X0),X0)
| ~ in(sK5,X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_62,negated_conjecture,
( ~ in(sK6(X0),X0)
| ~ in(sK5,X0)
| in(sK7(X0),X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_63,negated_conjecture,
( ~ in(powerset(sK7(X0)),X0)
| ~ are_equipotent(sK6(X0),X0)
| ~ in(sK5,X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f54]) ).
cnf(c_64,negated_conjecture,
( ~ are_equipotent(sK6(X0),X0)
| ~ in(sK5,X0)
| in(sK7(X0),X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_65,negated_conjecture,
( ~ in(powerset(sK7(X0)),X0)
| ~ in(sK5,X0)
| subset(sK6(X0),X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_66,negated_conjecture,
( ~ in(sK5,X0)
| in(sK7(X0),X0)
| subset(sK6(X0),X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f51]) ).
cnf(c_67,plain,
( ~ subset(X0,sK8(X1))
| in(X0,sK8(X1))
| are_equipotent(X0,sK8(X1)) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_68,plain,
( ~ in(X0,sK8(X1))
| ~ subset(X2,X0)
| in(X2,sK9(X1,X0)) ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_69,plain,
( ~ in(X0,sK8(X1))
| in(sK9(X1,X0),sK8(X1)) ),
inference(cnf_transformation,[],[f59]) ).
cnf(c_70,plain,
( ~ in(X0,sK8(X1))
| ~ subset(X2,X0)
| in(X2,sK8(X1)) ),
inference(cnf_transformation,[],[f58]) ).
cnf(c_71,plain,
in(X0,sK8(X0)),
inference(cnf_transformation,[],[f57]) ).
cnf(c_73,plain,
in(sK5,sK8(sK5)),
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_402,plain,
( sK6(X0) != X1
| sK8(X2) != X0
| ~ subset(X1,sK8(X2))
| ~ in(sK5,X0)
| in(sK7(X0),X0)
| in(X1,sK8(X2))
| sP0(X0) ),
inference(resolution_lifted,[status(thm)],[c_64,c_67]) ).
cnf(c_403,plain,
( ~ subset(sK6(sK8(X0)),sK8(X0))
| ~ in(sK5,sK8(X0))
| in(sK6(sK8(X0)),sK8(X0))
| in(sK7(sK8(X0)),sK8(X0))
| sP0(sK8(X0)) ),
inference(unflattening,[status(thm)],[c_402]) ).
cnf(c_415,plain,
( ~ in(sK5,sK8(X0))
| in(sK7(sK8(X0)),sK8(X0))
| sP0(sK8(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_403,c_62,c_66]) ).
cnf(c_419,plain,
( ~ in(sK5,sK8(sK5))
| in(sK7(sK8(sK5)),sK8(sK5))
| sP0(sK8(sK5)) ),
inference(instantiation,[status(thm)],[c_415]) ).
cnf(c_420,plain,
( sK6(X0) != X1
| sK8(X2) != X0
| ~ in(powerset(sK7(X0)),X0)
| ~ subset(X1,sK8(X2))
| ~ in(sK5,X0)
| in(X1,sK8(X2))
| sP0(X0) ),
inference(resolution_lifted,[status(thm)],[c_63,c_67]) ).
cnf(c_421,plain,
( ~ in(powerset(sK7(sK8(X0))),sK8(X0))
| ~ subset(sK6(sK8(X0)),sK8(X0))
| ~ in(sK5,sK8(X0))
| in(sK6(sK8(X0)),sK8(X0))
| sP0(sK8(X0)) ),
inference(unflattening,[status(thm)],[c_420]) ).
cnf(c_433,plain,
( ~ in(powerset(sK7(sK8(X0))),sK8(X0))
| ~ in(sK5,sK8(X0))
| sP0(sK8(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_421,c_61,c_65]) ).
cnf(c_3174,plain,
( subset(sK2(powerset(X0),X1),X0)
| subset(powerset(X0),X1) ),
inference(superposition,[status(thm)],[c_55,c_53]) ).
cnf(c_3328,plain,
( ~ subset(X0,sK3(sK8(X1)))
| ~ sP0(sK8(X1))
| in(X0,sK8(X1)) ),
inference(superposition,[status(thm)],[c_60,c_70]) ).
cnf(c_3329,plain,
( ~ subset(X0,sK9(X1,X2))
| ~ in(X2,sK8(X1))
| in(X0,sK8(X1)) ),
inference(superposition,[status(thm)],[c_69,c_70]) ).
cnf(c_3360,plain,
( ~ subset(sK2(X0,sK9(X1,X2)),X2)
| ~ in(X2,sK8(X1))
| subset(X0,sK9(X1,X2)) ),
inference(superposition,[status(thm)],[c_68,c_54]) ).
cnf(c_4156,plain,
( ~ in(sK4(sK8(X0)),sK8(X0))
| ~ sP0(sK8(X0)) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_5999,plain,
( ~ sP0(sK8(X0))
| in(sK3(sK8(X0)),sK8(X0)) ),
inference(superposition,[status(thm)],[c_57,c_3328]) ).
cnf(c_6000,plain,
( ~ sP0(sK8(X0))
| in(sK4(sK8(X0)),sK8(X0)) ),
inference(superposition,[status(thm)],[c_59,c_3328]) ).
cnf(c_6070,plain,
~ sP0(sK8(X0)),
inference(global_subsumption_just,[status(thm)],[c_5999,c_4156,c_6000]) ).
cnf(c_6072,plain,
~ sP0(sK8(sK5)),
inference(instantiation,[status(thm)],[c_6070]) ).
cnf(c_6092,plain,
( ~ in(powerset(sK7(sK8(X0))),sK8(X0))
| ~ in(sK5,sK8(X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_433,c_6070]) ).
cnf(c_10084,plain,
( ~ in(X0,sK8(X1))
| subset(powerset(X0),sK9(X1,X0)) ),
inference(superposition,[status(thm)],[c_3174,c_3360]) ).
cnf(c_10307,plain,
( ~ in(X0,sK8(X1))
| in(powerset(X0),sK8(X1)) ),
inference(superposition,[status(thm)],[c_10084,c_3329]) ).
cnf(c_10897,plain,
( ~ in(sK7(sK8(X0)),sK8(X0))
| ~ in(sK5,sK8(X0)) ),
inference(superposition,[status(thm)],[c_10307,c_6092]) ).
cnf(c_10916,plain,
( ~ in(sK7(sK8(sK5)),sK8(sK5))
| ~ in(sK5,sK8(sK5)) ),
inference(instantiation,[status(thm)],[c_10897]) ).
cnf(c_10917,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10916,c_6072,c_419,c_73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU168+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Aug 23 21:04:26 EDT 2023
% 0.20/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.59/1.14 % SZS status Started for theBenchmark.p
% 3.59/1.14 % SZS status Theorem for theBenchmark.p
% 3.59/1.14
% 3.59/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.59/1.14
% 3.59/1.14 ------ iProver source info
% 3.59/1.14
% 3.59/1.14 git: date: 2023-05-31 18:12:56 +0000
% 3.59/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.59/1.14 git: non_committed_changes: false
% 3.59/1.14 git: last_make_outside_of_git: false
% 3.59/1.14
% 3.59/1.14 ------ Parsing...
% 3.59/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.59/1.14
% 3.59/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.59/1.14
% 3.59/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.59/1.14
% 3.59/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.59/1.14 ------ Proving...
% 3.59/1.14 ------ Problem Properties
% 3.59/1.14
% 3.59/1.14
% 3.59/1.14 clauses 22
% 3.59/1.14 conjectures 4
% 3.59/1.14 EPR 3
% 3.59/1.14 Horn 16
% 3.59/1.14 unary 2
% 3.59/1.14 binary 9
% 3.59/1.14 lits 57
% 3.59/1.14 lits eq 2
% 3.59/1.14 fd_pure 0
% 3.59/1.14 fd_pseudo 0
% 3.59/1.14 fd_cond 0
% 3.59/1.14 fd_pseudo_cond 2
% 3.59/1.14 AC symbols 0
% 3.59/1.14
% 3.59/1.14 ------ Schedule dynamic 5 is on
% 3.59/1.14
% 3.59/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.59/1.14
% 3.59/1.14
% 3.59/1.14 ------
% 3.59/1.14 Current options:
% 3.59/1.14 ------
% 3.59/1.14
% 3.59/1.14
% 3.59/1.14
% 3.59/1.14
% 3.59/1.14 ------ Proving...
% 3.59/1.14
% 3.59/1.14
% 3.59/1.14 % SZS status Theorem for theBenchmark.p
% 3.59/1.14
% 3.59/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.59/1.14
% 3.59/1.14
%------------------------------------------------------------------------------