TSTP Solution File: ITP004_2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ITP004_2 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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 02:28:59 EDT 2024
% Result : Theorem 36.32s 5.75s
% Output : CNFRefutation 36.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 62 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 616 ( 13 equ)
% Maximal formula atoms : 10 ( 9 avg)
% Number of connectives : 270 ( 112 ~; 104 |; 24 &)
% ( 7 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 396 ( 396 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 16 ( 14 usr; 5 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 132 ( 0 sgn 96 !; 7 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,axiom,
! [X0: del,X1: del,X2] :
( mem(X2,arr(X0,X1))
=> ! [X3] :
( mem(X3,X0)
=> mem(ap(X2,X3),X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_tp) ).
tff(f20,axiom,
! [X10: del] : mem(c_2Epred__set_2ECHOICE(X10),arr(arr(X10,bool),X10)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mem_c_2Epred__set_2ECHOICE) ).
tff(f22,axiom,
! [X10: del] : mem(c_2Epred__set_2EREST(X10),arr(arr(X10,bool),arr(X10,bool))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mem_c_2Epred__set_2EREST) ).
tff(f27,axiom,
! [X10: del,X11] :
( mem(X11,arr(X10,bool))
=> ! [X12] :
( mem(X12,arr(X10,bool))
=> ( p(ap(ap(c_2Epred__set_2ESUBSET(X10),X11),X12))
<=> ! [X13] :
( mem(X13,X10)
=> ( p(ap(ap(c_2Ebool_2EIN(X10),X13),X11))
=> p(ap(ap(c_2Ebool_2EIN(X10),X13),X12)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_thm_2Epred__set_2ESUBSET__DEF) ).
tff(f28,axiom,
! [X10: del,X11] :
( mem(X11,arr(X10,bool))
=> ! [X14] :
( mem(X14,X10)
=> ! [X15] :
( mem(X15,X10)
=> ( p(ap(ap(c_2Ebool_2EIN(X10),X14),ap(ap(c_2Epred__set_2EDELETE(X10),X11),X15)))
<=> ( ( X14 != X15 )
& p(ap(ap(c_2Ebool_2EIN(X10),X14),X11)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EIN__DELETE) ).
tff(f29,axiom,
! [X10: del,X11] :
( mem(X11,arr(X10,bool))
=> ( ap(c_2Epred__set_2EREST(X10),X11) = ap(ap(c_2Epred__set_2EDELETE(X10),X11),ap(c_2Epred__set_2ECHOICE(X10),X11)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_thm_2Epred__set_2EREST__DEF) ).
tff(f30,conjecture,
! [X10: del,X11] :
( mem(X11,arr(X10,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X10),ap(c_2Epred__set_2EREST(X10),X11)),X11)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EREST__SUBSET) ).
tff(f31,negated_conjecture,
~ ! [X10: del,X11] :
( mem(X11,arr(X10,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X10),ap(c_2Epred__set_2EREST(X10),X11)),X11)) ),
inference(negated_conjecture,[],[f30]) ).
tff(f47,plain,
! [X0: del] : mem(c_2Epred__set_2ECHOICE(X0),arr(arr(X0,bool),X0)),
inference(rectify,[],[f20]) ).
tff(f49,plain,
! [X0: del] : mem(c_2Epred__set_2EREST(X0),arr(arr(X0,bool),arr(X0,bool))),
inference(rectify,[],[f22]) ).
tff(f54,plain,
! [X0: del,X1] :
( mem(X1,arr(X0,bool))
=> ! [X2] :
( mem(X2,arr(X0,bool))
=> ( p(ap(ap(c_2Epred__set_2ESUBSET(X0),X1),X2))
<=> ! [X3] :
( mem(X3,X0)
=> ( p(ap(ap(c_2Ebool_2EIN(X0),X3),X1))
=> p(ap(ap(c_2Ebool_2EIN(X0),X3),X2)) ) ) ) ) ),
inference(rectify,[],[f27]) ).
tff(f55,plain,
! [X0: del,X1] :
( mem(X1,arr(X0,bool))
=> ! [X2] :
( mem(X2,X0)
=> ! [X3] :
( mem(X3,X0)
=> ( p(ap(ap(c_2Ebool_2EIN(X0),X2),ap(ap(c_2Epred__set_2EDELETE(X0),X1),X3)))
<=> ( ( X2 != X3 )
& p(ap(ap(c_2Ebool_2EIN(X0),X2),X1)) ) ) ) ) ),
inference(rectify,[],[f28]) ).
tff(f56,plain,
! [X0: del,X1] :
( mem(X1,arr(X0,bool))
=> ( ap(c_2Epred__set_2EREST(X0),X1) = ap(ap(c_2Epred__set_2EDELETE(X0),X1),ap(c_2Epred__set_2ECHOICE(X0),X1)) ) ),
inference(rectify,[],[f29]) ).
tff(f57,plain,
~ ! [X0: del,X1] :
( mem(X1,arr(X0,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X0),ap(c_2Epred__set_2EREST(X0),X1)),X1)) ),
inference(rectify,[],[f31]) ).
tff(f58,plain,
! [X0: del,X1: del,X2] :
( ! [X3] :
( mem(ap(X2,X3),X1)
| ~ mem(X3,X0) )
| ~ mem(X2,arr(X0,X1)) ),
inference(ennf_transformation,[],[f1]) ).
tff(f71,plain,
! [X0: del,X1] :
( ! [X2] :
( ( p(ap(ap(c_2Epred__set_2ESUBSET(X0),X1),X2))
<=> ! [X3] :
( p(ap(ap(c_2Ebool_2EIN(X0),X3),X2))
| ~ p(ap(ap(c_2Ebool_2EIN(X0),X3),X1))
| ~ mem(X3,X0) ) )
| ~ mem(X2,arr(X0,bool)) )
| ~ mem(X1,arr(X0,bool)) ),
inference(ennf_transformation,[],[f54]) ).
tff(f72,plain,
! [X0: del,X1] :
( ! [X2] :
( ( p(ap(ap(c_2Epred__set_2ESUBSET(X0),X1),X2))
<=> ! [X3] :
( p(ap(ap(c_2Ebool_2EIN(X0),X3),X2))
| ~ p(ap(ap(c_2Ebool_2EIN(X0),X3),X1))
| ~ mem(X3,X0) ) )
| ~ mem(X2,arr(X0,bool)) )
| ~ mem(X1,arr(X0,bool)) ),
inference(flattening,[],[f71]) ).
tff(f73,plain,
! [X0: del,X1] :
( ! [X2] :
( ! [X3] :
( ( p(ap(ap(c_2Ebool_2EIN(X0),X2),ap(ap(c_2Epred__set_2EDELETE(X0),X1),X3)))
<=> ( ( X2 != X3 )
& p(ap(ap(c_2Ebool_2EIN(X0),X2),X1)) ) )
| ~ mem(X3,X0) )
| ~ mem(X2,X0) )
| ~ mem(X1,arr(X0,bool)) ),
inference(ennf_transformation,[],[f55]) ).
tff(f74,plain,
! [X0: del,X1] :
( ( ap(c_2Epred__set_2EREST(X0),X1) = ap(ap(c_2Epred__set_2EDELETE(X0),X1),ap(c_2Epred__set_2ECHOICE(X0),X1)) )
| ~ mem(X1,arr(X0,bool)) ),
inference(ennf_transformation,[],[f56]) ).
tff(f75,plain,
? [X0: del,X1] :
( ~ p(ap(ap(c_2Epred__set_2ESUBSET(X0),ap(c_2Epred__set_2EREST(X0),X1)),X1))
& mem(X1,arr(X0,bool)) ),
inference(ennf_transformation,[],[f57]) ).
tff(f89,plain,
! [X0: del,X1] :
( ! [X2] :
( ( ( p(ap(ap(c_2Epred__set_2ESUBSET(X0),X1),X2))
| ? [X3] :
( ~ p(ap(ap(c_2Ebool_2EIN(X0),X3),X2))
& p(ap(ap(c_2Ebool_2EIN(X0),X3),X1))
& mem(X3,X0) ) )
& ( ! [X3] :
( p(ap(ap(c_2Ebool_2EIN(X0),X3),X2))
| ~ p(ap(ap(c_2Ebool_2EIN(X0),X3),X1))
| ~ mem(X3,X0) )
| ~ p(ap(ap(c_2Epred__set_2ESUBSET(X0),X1),X2)) ) )
| ~ mem(X2,arr(X0,bool)) )
| ~ mem(X1,arr(X0,bool)) ),
inference(nnf_transformation,[],[f72]) ).
tff(f90,plain,
! [X0: del,X1] :
( ! [X2] :
( ( ( p(ap(ap(c_2Epred__set_2ESUBSET(X0),X1),X2))
| ? [X3] :
( ~ p(ap(ap(c_2Ebool_2EIN(X0),X3),X2))
& p(ap(ap(c_2Ebool_2EIN(X0),X3),X1))
& mem(X3,X0) ) )
& ( ! [X4] :
( p(ap(ap(c_2Ebool_2EIN(X0),X4),X2))
| ~ p(ap(ap(c_2Ebool_2EIN(X0),X4),X1))
| ~ mem(X4,X0) )
| ~ p(ap(ap(c_2Epred__set_2ESUBSET(X0),X1),X2)) ) )
| ~ mem(X2,arr(X0,bool)) )
| ~ mem(X1,arr(X0,bool)) ),
inference(rectify,[],[f89]) ).
tff(f91,plain,
! [X0: del,X1,X2] :
( ? [X3] :
( ~ p(ap(ap(c_2Ebool_2EIN(X0),X3),X2))
& p(ap(ap(c_2Ebool_2EIN(X0),X3),X1))
& mem(X3,X0) )
=> ( ~ p(ap(ap(c_2Ebool_2EIN(X0),sK2(X0,X1,X2)),X2))
& p(ap(ap(c_2Ebool_2EIN(X0),sK2(X0,X1,X2)),X1))
& mem(sK2(X0,X1,X2),X0) ) ),
introduced(choice_axiom,[]) ).
tff(f92,plain,
! [X0: del,X1] :
( ! [X2] :
( ( ( p(ap(ap(c_2Epred__set_2ESUBSET(X0),X1),X2))
| ( ~ p(ap(ap(c_2Ebool_2EIN(X0),sK2(X0,X1,X2)),X2))
& p(ap(ap(c_2Ebool_2EIN(X0),sK2(X0,X1,X2)),X1))
& mem(sK2(X0,X1,X2),X0) ) )
& ( ! [X4] :
( p(ap(ap(c_2Ebool_2EIN(X0),X4),X2))
| ~ p(ap(ap(c_2Ebool_2EIN(X0),X4),X1))
| ~ mem(X4,X0) )
| ~ p(ap(ap(c_2Epred__set_2ESUBSET(X0),X1),X2)) ) )
| ~ mem(X2,arr(X0,bool)) )
| ~ mem(X1,arr(X0,bool)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f90,f91]) ).
tff(f93,plain,
! [X0: del,X1] :
( ! [X2] :
( ! [X3] :
( ( ( p(ap(ap(c_2Ebool_2EIN(X0),X2),ap(ap(c_2Epred__set_2EDELETE(X0),X1),X3)))
| ( X2 = X3 )
| ~ p(ap(ap(c_2Ebool_2EIN(X0),X2),X1)) )
& ( ( ( X2 != X3 )
& p(ap(ap(c_2Ebool_2EIN(X0),X2),X1)) )
| ~ p(ap(ap(c_2Ebool_2EIN(X0),X2),ap(ap(c_2Epred__set_2EDELETE(X0),X1),X3))) ) )
| ~ mem(X3,X0) )
| ~ mem(X2,X0) )
| ~ mem(X1,arr(X0,bool)) ),
inference(nnf_transformation,[],[f73]) ).
tff(f94,plain,
! [X0: del,X1] :
( ! [X2] :
( ! [X3] :
( ( ( p(ap(ap(c_2Ebool_2EIN(X0),X2),ap(ap(c_2Epred__set_2EDELETE(X0),X1),X3)))
| ( X2 = X3 )
| ~ p(ap(ap(c_2Ebool_2EIN(X0),X2),X1)) )
& ( ( ( X2 != X3 )
& p(ap(ap(c_2Ebool_2EIN(X0),X2),X1)) )
| ~ p(ap(ap(c_2Ebool_2EIN(X0),X2),ap(ap(c_2Epred__set_2EDELETE(X0),X1),X3))) ) )
| ~ mem(X3,X0) )
| ~ mem(X2,X0) )
| ~ mem(X1,arr(X0,bool)) ),
inference(flattening,[],[f93]) ).
tff(f95,plain,
( ? [X0: del,X1] :
( ~ p(ap(ap(c_2Epred__set_2ESUBSET(X0),ap(c_2Epred__set_2EREST(X0),X1)),X1))
& mem(X1,arr(X0,bool)) )
=> ( ~ p(ap(ap(c_2Epred__set_2ESUBSET(sK3),ap(c_2Epred__set_2EREST(sK3),sK4)),sK4))
& mem(sK4,arr(sK3,bool)) ) ),
introduced(choice_axiom,[]) ).
tff(f96,plain,
( ~ p(ap(ap(c_2Epred__set_2ESUBSET(sK3),ap(c_2Epred__set_2EREST(sK3),sK4)),sK4))
& mem(sK4,arr(sK3,bool)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f75,f95]) ).
tff(f97,plain,
! [X2: $i,X3: $i,X0: del,X1: del] :
( mem(ap(X2,X3),X1)
| ~ mem(X3,X0)
| ~ mem(X2,arr(X0,X1)) ),
inference(cnf_transformation,[],[f58]) ).
tff(f123,plain,
! [X0: del] : mem(c_2Epred__set_2ECHOICE(X0),arr(arr(X0,bool),X0)),
inference(cnf_transformation,[],[f47]) ).
tff(f125,plain,
! [X0: del] : mem(c_2Epred__set_2EREST(X0),arr(arr(X0,bool),arr(X0,bool))),
inference(cnf_transformation,[],[f49]) ).
tff(f134,plain,
! [X2: $i,X0: del,X1: $i] :
( p(ap(ap(c_2Epred__set_2ESUBSET(X0),X1),X2))
| mem(sK2(X0,X1,X2),X0)
| ~ mem(X2,arr(X0,bool))
| ~ mem(X1,arr(X0,bool)) ),
inference(cnf_transformation,[],[f92]) ).
tff(f135,plain,
! [X2: $i,X0: del,X1: $i] :
( p(ap(ap(c_2Epred__set_2ESUBSET(X0),X1),X2))
| p(ap(ap(c_2Ebool_2EIN(X0),sK2(X0,X1,X2)),X1))
| ~ mem(X2,arr(X0,bool))
| ~ mem(X1,arr(X0,bool)) ),
inference(cnf_transformation,[],[f92]) ).
tff(f136,plain,
! [X2: $i,X0: del,X1: $i] :
( p(ap(ap(c_2Epred__set_2ESUBSET(X0),X1),X2))
| ~ p(ap(ap(c_2Ebool_2EIN(X0),sK2(X0,X1,X2)),X2))
| ~ mem(X2,arr(X0,bool))
| ~ mem(X1,arr(X0,bool)) ),
inference(cnf_transformation,[],[f92]) ).
tff(f137,plain,
! [X2: $i,X3: $i,X0: del,X1: $i] :
( p(ap(ap(c_2Ebool_2EIN(X0),X2),X1))
| ~ p(ap(ap(c_2Ebool_2EIN(X0),X2),ap(ap(c_2Epred__set_2EDELETE(X0),X1),X3)))
| ~ mem(X3,X0)
| ~ mem(X2,X0)
| ~ mem(X1,arr(X0,bool)) ),
inference(cnf_transformation,[],[f94]) ).
tff(f140,plain,
! [X0: del,X1: $i] :
( ( ap(c_2Epred__set_2EREST(X0),X1) = ap(ap(c_2Epred__set_2EDELETE(X0),X1),ap(c_2Epred__set_2ECHOICE(X0),X1)) )
| ~ mem(X1,arr(X0,bool)) ),
inference(cnf_transformation,[],[f74]) ).
tff(f141,plain,
mem(sK4,arr(sK3,bool)),
inference(cnf_transformation,[],[f96]) ).
tff(f142,plain,
~ p(ap(ap(c_2Epred__set_2ESUBSET(sK3),ap(c_2Epred__set_2EREST(sK3),sK4)),sK4)),
inference(cnf_transformation,[],[f96]) ).
cnf(c_49,plain,
( ~ mem(X0,arr(X0_13,X1_13))
| ~ mem(X1,X0_13)
| mem(ap(X0,X1),X1_13) ),
inference(cnf_transformation,[],[f97]) ).
cnf(c_75,plain,
mem(c_2Epred__set_2ECHOICE(X0_13),arr(arr(X0_13,bool),X0_13)),
inference(cnf_transformation,[],[f123]) ).
cnf(c_77,plain,
mem(c_2Epred__set_2EREST(X0_13),arr(arr(X0_13,bool),arr(X0_13,bool))),
inference(cnf_transformation,[],[f125]) ).
cnf(c_85,plain,
( ~ p(ap(ap(c_2Ebool_2EIN(X0_13),sK2(X0_13,X0,X1)),X1))
| ~ mem(X0,arr(X0_13,bool))
| ~ mem(X1,arr(X0_13,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X0_13),X0),X1)) ),
inference(cnf_transformation,[],[f136]) ).
cnf(c_86,plain,
( ~ mem(X0,arr(X0_13,bool))
| ~ mem(X1,arr(X0_13,bool))
| p(ap(ap(c_2Ebool_2EIN(X0_13),sK2(X0_13,X1,X0)),X1))
| p(ap(ap(c_2Epred__set_2ESUBSET(X0_13),X1),X0)) ),
inference(cnf_transformation,[],[f135]) ).
cnf(c_87,plain,
( ~ mem(X0,arr(X0_13,bool))
| ~ mem(X1,arr(X0_13,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X0_13),X1),X0))
| mem(sK2(X0_13,X1,X0),X0_13) ),
inference(cnf_transformation,[],[f134]) ).
cnf(c_91,plain,
( ~ p(ap(ap(c_2Ebool_2EIN(X0_13),X0),ap(ap(c_2Epred__set_2EDELETE(X0_13),X1),X2)))
| ~ mem(X1,arr(X0_13,bool))
| ~ mem(X0,X0_13)
| ~ mem(X2,X0_13)
| p(ap(ap(c_2Ebool_2EIN(X0_13),X0),X1)) ),
inference(cnf_transformation,[],[f137]) ).
cnf(c_92,plain,
( ~ mem(X0,arr(X0_13,bool))
| ap(ap(c_2Epred__set_2EDELETE(X0_13),X0),ap(c_2Epred__set_2ECHOICE(X0_13),X0)) = ap(c_2Epred__set_2EREST(X0_13),X0) ),
inference(cnf_transformation,[],[f140]) ).
cnf(c_93,negated_conjecture,
~ p(ap(ap(c_2Epred__set_2ESUBSET(sK3),ap(c_2Epred__set_2EREST(sK3),sK4)),sK4)),
inference(cnf_transformation,[],[f142]) ).
cnf(c_94,negated_conjecture,
mem(sK4,arr(sK3,bool)),
inference(cnf_transformation,[],[f141]) ).
cnf(c_1390,plain,
( ~ mem(c_2Epred__set_2ECHOICE(X0_13),arr(arr(X0_13,bool),X0_13))
| ~ mem(X0,arr(X0_13,bool))
| mem(ap(c_2Epred__set_2ECHOICE(X0_13),X0),X0_13) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_1394,plain,
( ~ mem(c_2Epred__set_2EREST(X0_13),arr(arr(X0_13,bool),arr(X0_13,bool)))
| ~ mem(X0,arr(X0_13,bool))
| mem(ap(c_2Epred__set_2EREST(X0_13),X0),arr(X0_13,bool)) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_2954,plain,
( ~ mem(c_2Epred__set_2ECHOICE(sK3),arr(arr(sK3,bool),sK3))
| ~ mem(sK4,arr(sK3,bool))
| mem(ap(c_2Epred__set_2ECHOICE(sK3),sK4),sK3) ),
inference(instantiation,[status(thm)],[c_1390]) ).
cnf(c_4713,plain,
ap(ap(c_2Epred__set_2EDELETE(sK3),sK4),ap(c_2Epred__set_2ECHOICE(sK3),sK4)) = ap(c_2Epred__set_2EREST(sK3),sK4),
inference(superposition,[status(thm)],[c_94,c_92]) ).
cnf(c_4842,plain,
( ~ p(ap(ap(c_2Ebool_2EIN(sK3),X0),ap(c_2Epred__set_2EREST(sK3),sK4)))
| ~ mem(ap(c_2Epred__set_2ECHOICE(sK3),sK4),sK3)
| ~ mem(sK4,arr(sK3,bool))
| ~ mem(X0,sK3)
| p(ap(ap(c_2Ebool_2EIN(sK3),X0),sK4)) ),
inference(superposition,[status(thm)],[c_4713,c_91]) ).
cnf(c_4843,plain,
( ~ p(ap(ap(c_2Ebool_2EIN(sK3),X0),ap(c_2Epred__set_2EREST(sK3),sK4)))
| ~ mem(ap(c_2Epred__set_2ECHOICE(sK3),sK4),sK3)
| ~ mem(X0,sK3)
| p(ap(ap(c_2Ebool_2EIN(sK3),X0),sK4)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4842,c_94]) ).
cnf(c_4879,plain,
( ~ mem(sK2(sK3,ap(c_2Epred__set_2EREST(sK3),sK4),X0),sK3)
| ~ mem(ap(c_2Epred__set_2EREST(sK3),sK4),arr(sK3,bool))
| ~ mem(ap(c_2Epred__set_2ECHOICE(sK3),sK4),sK3)
| ~ mem(X0,arr(sK3,bool))
| p(ap(ap(c_2Ebool_2EIN(sK3),sK2(sK3,ap(c_2Epred__set_2EREST(sK3),sK4),X0)),sK4))
| p(ap(ap(c_2Epred__set_2ESUBSET(sK3),ap(c_2Epred__set_2EREST(sK3),sK4)),X0)) ),
inference(superposition,[status(thm)],[c_86,c_4843]) ).
cnf(c_4922,plain,
( ~ mem(ap(c_2Epred__set_2EREST(sK3),sK4),arr(sK3,bool))
| ~ mem(ap(c_2Epred__set_2ECHOICE(sK3),sK4),sK3)
| ~ mem(X0,arr(sK3,bool))
| p(ap(ap(c_2Ebool_2EIN(sK3),sK2(sK3,ap(c_2Epred__set_2EREST(sK3),sK4),X0)),sK4))
| p(ap(ap(c_2Epred__set_2ESUBSET(sK3),ap(c_2Epred__set_2EREST(sK3),sK4)),X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4879,c_87]) ).
cnf(c_4923,plain,
( ~ mem(ap(c_2Epred__set_2EREST(sK3),sK4),arr(sK3,bool))
| ~ mem(ap(c_2Epred__set_2ECHOICE(sK3),sK4),sK3)
| ~ mem(sK4,arr(sK3,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(sK3),ap(c_2Epred__set_2EREST(sK3),sK4)),sK4)) ),
inference(superposition,[status(thm)],[c_4922,c_85]) ).
cnf(c_4924,plain,
( ~ mem(ap(c_2Epred__set_2EREST(sK3),sK4),arr(sK3,bool))
| ~ mem(ap(c_2Epred__set_2ECHOICE(sK3),sK4),sK3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4923,c_93,c_94]) ).
cnf(c_4986,plain,
( ~ mem(c_2Epred__set_2EREST(sK3),arr(arr(sK3,bool),arr(sK3,bool)))
| ~ mem(sK4,arr(sK3,bool))
| mem(ap(c_2Epred__set_2EREST(sK3),sK4),arr(sK3,bool)) ),
inference(instantiation,[status(thm)],[c_1394]) ).
cnf(c_5323,plain,
mem(c_2Epred__set_2ECHOICE(sK3),arr(arr(sK3,bool),sK3)),
inference(instantiation,[status(thm)],[c_75]) ).
cnf(c_5512,plain,
mem(c_2Epred__set_2EREST(sK3),arr(arr(sK3,bool),arr(sK3,bool))),
inference(instantiation,[status(thm)],[c_77]) ).
cnf(c_5513,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_5512,c_5323,c_4986,c_4924,c_2954,c_94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP004_2 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 21:49:36 EDT 2024
% 0.20/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 36.32/5.75 % SZS status Started for theBenchmark.p
% 36.32/5.75 % SZS status Theorem for theBenchmark.p
% 36.32/5.75
% 36.32/5.75 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 36.32/5.75
% 36.32/5.75 ------ iProver source info
% 36.32/5.75
% 36.32/5.75 git: date: 2024-05-02 19:28:25 +0000
% 36.32/5.75 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 36.32/5.75 git: non_committed_changes: false
% 36.32/5.75
% 36.32/5.75 ------ Parsing...
% 36.32/5.75 ------ Clausification by vclausify_rel & Parsing by iProver...
% 36.32/5.75
% 36.32/5.75 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 36.32/5.75
% 36.32/5.75 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 36.32/5.75
% 36.32/5.75 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 36.32/5.75 ------ Proving...
% 36.32/5.75 ------ Problem Properties
% 36.32/5.75
% 36.32/5.75
% 36.32/5.75 clauses 46
% 36.32/5.75 conjectures 2
% 36.32/5.75 EPR 2
% 36.32/5.75 Horn 38
% 36.32/5.75 unary 17
% 36.32/5.75 binary 5
% 36.32/5.75 lits 126
% 36.32/5.75 lits eq 15
% 36.32/5.75 fd_pure 0
% 36.32/5.75 fd_pseudo 0
% 36.32/5.75 fd_cond 0
% 36.32/5.75 fd_pseudo_cond 6
% 36.32/5.75 AC symbols 0
% 36.32/5.75
% 36.32/5.75 ------ Input Options Time Limit: Unbounded
% 36.32/5.75
% 36.32/5.75
% 36.32/5.75 ------
% 36.32/5.75 Current options:
% 36.32/5.75 ------
% 36.32/5.75
% 36.32/5.75
% 36.32/5.75
% 36.32/5.75
% 36.32/5.75 ------ Proving...
% 36.32/5.75
% 36.32/5.75
% 36.32/5.75 % SZS status Theorem for theBenchmark.p
% 36.32/5.75
% 36.32/5.75 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 36.32/5.75
% 36.32/5.75
%------------------------------------------------------------------------------