TSTP Solution File: SEU164+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU164+3 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:48 EDT 2024
% Result : Theorem 3.29s 1.20s
% Output : CNFRefutation 3.29s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f3,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f5,axiom,
! [X0,X1] :
( union(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,X0)
& in(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(f6,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f10,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(f11,conjecture,
! [X0] : union(powerset(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t99_zfmisc_1) ).
fof(f12,negated_conjecture,
~ ! [X0] : union(powerset(X0)) = X0,
inference(negated_conjecture,[],[f11]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f16,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f17,plain,
? [X0] : union(powerset(X0)) != X0,
inference(ennf_transformation,[],[f12]) ).
fof(f18,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,[],[f2]) ).
fof(f19,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,[],[f18]) ).
fof(f20,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(f21,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])],[f19,f20]) ).
fof(f22,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,[],[f3]) ).
fof(f23,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,[],[f22]) ).
fof(f24,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(f25,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])],[f23,f24]) ).
fof(f26,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,[],[f15]) ).
fof(f27,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,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f29,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])],[f27,f28]) ).
fof(f30,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) ) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| ~ in(X2,X1) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f31,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(rectify,[],[f30]) ).
fof(f32,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) )
=> ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK3(X0,X1),X3) )
| ~ in(sK3(X0,X1),X1) )
& ( ? [X4] :
( in(X4,X0)
& in(sK3(X0,X1),X4) )
| in(sK3(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X1] :
( ? [X4] :
( in(X4,X0)
& in(sK3(X0,X1),X4) )
=> ( in(sK4(X0,X1),X0)
& in(sK3(X0,X1),sK4(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
! [X0,X5] :
( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
=> ( in(sK5(X0,X5),X0)
& in(X5,sK5(X0,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
! [X0,X1] :
( ( union(X0) = X1
| ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK3(X0,X1),X3) )
| ~ in(sK3(X0,X1),X1) )
& ( ( in(sK4(X0,X1),X0)
& in(sK3(X0,X1),sK4(X0,X1)) )
| in(sK3(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ( in(sK5(X0,X5),X0)
& in(X5,sK5(X0,X5)) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f31,f34,f33,f32]) ).
fof(f36,plain,
! [X0,X1] :
( ( subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f41,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f42,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) )
=> ( ( ~ in(sK8(X0,X1),X1)
| ~ in(sK8(X0,X1),X0) )
& ( in(sK8(X0,X1),X1)
| in(sK8(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK8(X0,X1),X1)
| ~ in(sK8(X0,X1),X0) )
& ( in(sK8(X0,X1),X1)
| in(sK8(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f41,f42]) ).
fof(f44,plain,
( ? [X0] : union(powerset(X0)) != X0
=> sK9 != union(powerset(sK9)) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
sK9 != union(powerset(sK9)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f17,f44]) ).
fof(f48,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f21]) ).
fof(f51,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f25]) ).
fof(f52,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f25]) ).
fof(f55,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f56,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f57,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f58,plain,
! [X0,X1,X5] :
( in(X5,sK5(X0,X5))
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f35]) ).
fof(f59,plain,
! [X0,X1,X5] :
( in(sK5(X0,X5),X0)
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f35]) ).
fof(f60,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(X6,X0)
| ~ in(X5,X6)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f35]) ).
fof(f65,plain,
! [X0,X1] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f69,plain,
! [X0,X1] :
( X0 = X1
| in(sK8(X0,X1),X1)
| in(sK8(X0,X1),X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f70,plain,
! [X0,X1] :
( X0 = X1
| ~ in(sK8(X0,X1),X1)
| ~ in(sK8(X0,X1),X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f71,plain,
sK9 != union(powerset(sK9)),
inference(cnf_transformation,[],[f45]) ).
fof(f72,plain,
! [X3,X1] :
( in(X3,X1)
| singleton(X3) != X1 ),
inference(equality_resolution,[],[f48]) ).
fof(f73,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f72]) ).
fof(f75,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f52]) ).
fof(f76,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f51]) ).
fof(f77,plain,
! [X0,X6,X5] :
( in(X5,union(X0))
| ~ in(X6,X0)
| ~ in(X5,X6) ),
inference(equality_resolution,[],[f60]) ).
fof(f78,plain,
! [X0,X5] :
( in(sK5(X0,X5),X0)
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f59]) ).
fof(f79,plain,
! [X0,X5] :
( in(X5,sK5(X0,X5))
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f58]) ).
cnf(c_52,plain,
in(X0,singleton(X0)),
inference(cnf_transformation,[],[f73]) ).
cnf(c_56,plain,
( ~ subset(X0,X1)
| in(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f75]) ).
cnf(c_57,plain,
( ~ in(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f76]) ).
cnf(c_58,plain,
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_59,plain,
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_60,plain,
( ~ in(X0,X1)
| ~ subset(X1,X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_64,plain,
( ~ in(X0,X1)
| ~ in(X1,X2)
| in(X0,union(X2)) ),
inference(cnf_transformation,[],[f77]) ).
cnf(c_65,plain,
( ~ in(X0,union(X1))
| in(sK5(X1,X0),X1) ),
inference(cnf_transformation,[],[f78]) ).
cnf(c_66,plain,
( ~ in(X0,union(X1))
| in(X0,sK5(X1,X0)) ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_67,plain,
( ~ in(X0,X1)
| subset(singleton(X0),X1) ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_72,plain,
( ~ in(sK8(X0,X1),X0)
| ~ in(sK8(X0,X1),X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f70]) ).
cnf(c_73,plain,
( X0 = X1
| in(sK8(X0,X1),X0)
| in(sK8(X0,X1),X1) ),
inference(cnf_transformation,[],[f69]) ).
cnf(c_74,negated_conjecture,
union(powerset(sK9)) != sK9,
inference(cnf_transformation,[],[f71]) ).
cnf(c_1310,plain,
powerset(sK9) = sP0_iProver_def,
definition ).
cnf(c_1311,plain,
union(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_1312,negated_conjecture,
sP1_iProver_def != sK9,
inference(demodulation,[status(thm)],[c_74,c_1310,c_1311]) ).
cnf(c_1841,plain,
( ~ subset(X0,sK9)
| in(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_1310,c_56]) ).
cnf(c_1891,plain,
( ~ in(X0,sK9)
| in(singleton(X0),sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_67,c_1841]) ).
cnf(c_2155,plain,
( ~ in(sK8(sP1_iProver_def,sK9),sK9)
| ~ in(sK8(sP1_iProver_def,sK9),sP1_iProver_def)
| sP1_iProver_def = sK9 ),
inference(instantiation,[status(thm)],[c_72]) ).
cnf(c_2157,plain,
( sP1_iProver_def = sK9
| in(sK8(sP1_iProver_def,sK9),sK9)
| in(sK8(sP1_iProver_def,sK9),sP1_iProver_def) ),
inference(instantiation,[status(thm)],[c_73]) ).
cnf(c_2166,plain,
( ~ in(singleton(X0),X1)
| in(X0,union(X1)) ),
inference(superposition,[status(thm)],[c_52,c_64]) ).
cnf(c_2287,plain,
( ~ in(sK8(sP1_iProver_def,sK9),sK9)
| ~ subset(sK9,X0)
| in(sK8(sP1_iProver_def,sK9),X0) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_2413,plain,
( ~ in(X0,sK9)
| in(X0,union(sP0_iProver_def)) ),
inference(superposition,[status(thm)],[c_1891,c_2166]) ).
cnf(c_2414,plain,
( ~ in(X0,sK9)
| in(X0,sP1_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_2413,c_1311]) ).
cnf(c_2475,plain,
( in(sK2(sK9,X0),sP1_iProver_def)
| subset(sK9,X0) ),
inference(superposition,[status(thm)],[c_59,c_2414]) ).
cnf(c_2554,plain,
subset(sK9,sP1_iProver_def),
inference(superposition,[status(thm)],[c_2475,c_58]) ).
cnf(c_3185,plain,
( ~ in(sK8(sP1_iProver_def,sK9),sP1_iProver_def)
| ~ subset(sP1_iProver_def,X0)
| in(sK8(sP1_iProver_def,sK9),X0) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_3190,plain,
( ~ in(sK8(sP1_iProver_def,sK9),sP1_iProver_def)
| ~ subset(sP1_iProver_def,sK9)
| in(sK8(sP1_iProver_def,sK9),sK9) ),
inference(instantiation,[status(thm)],[c_3185]) ).
cnf(c_3346,plain,
( ~ in(sK8(sP1_iProver_def,sK9),sK9)
| ~ subset(sK9,sP1_iProver_def)
| in(sK8(sP1_iProver_def,sK9),sP1_iProver_def) ),
inference(instantiation,[status(thm)],[c_2287]) ).
cnf(c_7380,plain,
( ~ in(sK2(sP1_iProver_def,X0),X0)
| subset(sP1_iProver_def,X0) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_7383,plain,
( ~ in(sK2(sP1_iProver_def,sK9),sK9)
| subset(sP1_iProver_def,sK9) ),
inference(instantiation,[status(thm)],[c_7380]) ).
cnf(c_10641,plain,
( ~ in(X0,sP0_iProver_def)
| subset(X0,sK9) ),
inference(superposition,[status(thm)],[c_1310,c_57]) ).
cnf(c_10728,plain,
( ~ in(X0,union(sP0_iProver_def))
| subset(sK5(sP0_iProver_def,X0),sK9) ),
inference(superposition,[status(thm)],[c_65,c_10641]) ).
cnf(c_10729,plain,
( ~ in(X0,sP1_iProver_def)
| subset(sK5(sP0_iProver_def,X0),sK9) ),
inference(light_normalisation,[status(thm)],[c_10728,c_1311]) ).
cnf(c_10856,plain,
( ~ subset(sK5(X0,X1),X2)
| ~ in(X1,union(X0))
| in(X1,X2) ),
inference(superposition,[status(thm)],[c_66,c_60]) ).
cnf(c_11655,plain,
( ~ in(X0,union(sP0_iProver_def))
| ~ in(X0,sP1_iProver_def)
| in(X0,sK9) ),
inference(superposition,[status(thm)],[c_10729,c_10856]) ).
cnf(c_11659,plain,
( ~ in(X0,sP1_iProver_def)
| in(X0,sK9) ),
inference(light_normalisation,[status(thm)],[c_11655,c_1311]) ).
cnf(c_11869,plain,
( in(sK2(sP1_iProver_def,X0),sK9)
| subset(sP1_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_59,c_11659]) ).
cnf(c_11917,plain,
( in(sK2(sP1_iProver_def,sK9),sK9)
| subset(sP1_iProver_def,sK9) ),
inference(instantiation,[status(thm)],[c_11869]) ).
cnf(c_11918,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11917,c_7383,c_3346,c_3190,c_2554,c_2157,c_2155,c_1312]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU164+3 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n011.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 : Thu May 2 17:37:48 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 3.29/1.20 % SZS status Started for theBenchmark.p
% 3.29/1.20 % SZS status Theorem for theBenchmark.p
% 3.29/1.20
% 3.29/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.29/1.20
% 3.29/1.20 ------ iProver source info
% 3.29/1.20
% 3.29/1.20 git: date: 2024-05-02 19:28:25 +0000
% 3.29/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.29/1.20 git: non_committed_changes: false
% 3.29/1.20
% 3.29/1.20 ------ Parsing...
% 3.29/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.29/1.20
% 3.29/1.20 ------ 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.29/1.20
% 3.29/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.29/1.20
% 3.29/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.29/1.20 ------ Proving...
% 3.29/1.20 ------ Problem Properties
% 3.29/1.20
% 3.29/1.20
% 3.29/1.20 clauses 27
% 3.29/1.20 conjectures 1
% 3.29/1.20 EPR 5
% 3.29/1.20 Horn 21
% 3.29/1.20 unary 6
% 3.29/1.20 binary 10
% 3.29/1.20 lits 60
% 3.29/1.20 lits eq 16
% 3.29/1.20 fd_pure 0
% 3.29/1.20 fd_pseudo 0
% 3.29/1.20 fd_cond 0
% 3.29/1.20 fd_pseudo_cond 9
% 3.29/1.20 AC symbols 0
% 3.29/1.20
% 3.29/1.20 ------ Schedule dynamic 5 is on
% 3.29/1.20
% 3.29/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.29/1.20
% 3.29/1.20
% 3.29/1.20 ------
% 3.29/1.20 Current options:
% 3.29/1.20 ------
% 3.29/1.20
% 3.29/1.20
% 3.29/1.20
% 3.29/1.20
% 3.29/1.20 ------ Proving...
% 3.29/1.20
% 3.29/1.20
% 3.29/1.20 % SZS status Theorem for theBenchmark.p
% 3.29/1.20
% 3.29/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.29/1.20
% 3.29/1.20
%------------------------------------------------------------------------------