TSTP Solution File: ITP006+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ITP006+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:29:02 EDT 2024
% Result : Theorem 7.85s 1.67s
% Output : CNFRefutation 7.85s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1,X2] :
( mem(X2,arr(X0,X1))
=> ! [X3] :
( mem(X3,X0)
=> mem(ap(X2,X3),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_tp) ).
fof(f40,axiom,
! [X8] :
( ne(X8)
=> ! [X9] :
( ne(X9)
=> ! [X19] :
( mem(X19,arr(X8,X9))
=> ! [X20] :
( mem(X20,arr(X9,bool))
=> ( ! [X35] :
( mem(X35,arr(X8,X9))
=> ! [X36] :
( mem(X36,arr(X9,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X8,X9),X35),X36))
<=> ! [X37] :
( mem(X37,X9)
=> ( ~ p(ap(X36,X37))
=> ? [X38] :
( ap(X35,X38) = X37
& mem(X38,X8) ) ) ) ) ) )
& ! [X31] :
( mem(X31,arr(X8,X9))
=> ! [X32] :
( mem(X32,arr(X9,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X8,X9),X31),X32))
<=> ! [X33] :
( mem(X33,X9)
=> ( p(ap(X32,X33))
=> ? [X34] :
( ap(X31,X34) = X33
& mem(X34,X8) ) ) ) ) ) )
& ! [X28] :
( mem(X28,arr(X8,X9))
=> ! [X29] :
( mem(X29,arr(X9,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X8,X9),X28),X29))
<=> ! [X30] :
( mem(X30,X8)
=> ~ p(ap(X29,ap(X28,X30))) ) ) ) )
& ! [X25] :
( mem(X25,arr(X8,X9))
=> ! [X26] :
( mem(X26,arr(X9,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X8,X9),X25),X26))
<=> ! [X27] :
( mem(X27,X8)
=> p(ap(X26,ap(X25,X27))) ) ) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X8,X9),X19),X20))
<=> ! [X23] :
( mem(X23,X9)
=> ( ~ p(ap(X20,X23))
=> ? [X24] :
( ~ p(ap(X20,ap(X19,X24)))
& mem(X24,X8) ) ) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X8,X9),X19),X20))
<=> ! [X21] :
( mem(X21,X9)
=> ( p(ap(X20,X21))
=> ? [X22] :
( p(ap(X20,ap(X19,X22)))
& mem(X22,X8) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__REWRITES) ).
fof(f52,conjecture,
! [X8] :
( ne(X8)
=> ! [X9] :
( ne(X9)
=> ! [X19] :
( mem(X19,arr(X9,X8))
=> ! [X20] :
( mem(X20,arr(X8,bool))
=> ! [X44] :
( mem(X44,arr(X8,bool))
=> ( ! [X45] :
( mem(X45,X8)
=> ( p(ap(X44,X45))
=> p(ap(X20,X45)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X8),X19),X20))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X8),X19),X44)) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT) ).
fof(f53,negated_conjecture,
~ ! [X8] :
( ne(X8)
=> ! [X9] :
( ne(X9)
=> ! [X19] :
( mem(X19,arr(X9,X8))
=> ! [X20] :
( mem(X20,arr(X8,bool))
=> ! [X44] :
( mem(X44,arr(X8,bool))
=> ( ! [X45] :
( mem(X45,X8)
=> ( p(ap(X44,X45))
=> p(ap(X20,X45)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X8),X19),X20))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X8),X19),X44)) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f52]) ).
fof(f85,plain,
! [X0] :
( ne(X0)
=> ! [X1] :
( ne(X1)
=> ! [X2] :
( mem(X2,arr(X0,X1))
=> ! [X3] :
( mem(X3,arr(X1,bool))
=> ( ! [X4] :
( mem(X4,arr(X0,X1))
=> ! [X5] :
( mem(X5,arr(X1,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X0,X1),X4),X5))
<=> ! [X6] :
( mem(X6,X1)
=> ( ~ p(ap(X5,X6))
=> ? [X7] :
( ap(X4,X7) = X6
& mem(X7,X0) ) ) ) ) ) )
& ! [X8] :
( mem(X8,arr(X0,X1))
=> ! [X9] :
( mem(X9,arr(X1,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X0,X1),X8),X9))
<=> ! [X10] :
( mem(X10,X1)
=> ( p(ap(X9,X10))
=> ? [X11] :
( ap(X8,X11) = X10
& mem(X11,X0) ) ) ) ) ) )
& ! [X12] :
( mem(X12,arr(X0,X1))
=> ! [X13] :
( mem(X13,arr(X1,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X12),X13))
<=> ! [X14] :
( mem(X14,X0)
=> ~ p(ap(X13,ap(X12,X14))) ) ) ) )
& ! [X15] :
( mem(X15,arr(X0,X1))
=> ! [X16] :
( mem(X16,arr(X1,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X15),X16))
<=> ! [X17] :
( mem(X17,X0)
=> p(ap(X16,ap(X15,X17))) ) ) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X0,X1),X2),X3))
<=> ! [X18] :
( mem(X18,X1)
=> ( ~ p(ap(X3,X18))
=> ? [X19] :
( ~ p(ap(X3,ap(X2,X19)))
& mem(X19,X0) ) ) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X0,X1),X2),X3))
<=> ! [X20] :
( mem(X20,X1)
=> ( p(ap(X3,X20))
=> ? [X21] :
( p(ap(X3,ap(X2,X21)))
& mem(X21,X0) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f40]) ).
fof(f105,plain,
~ ! [X0] :
( ne(X0)
=> ! [X1] :
( ne(X1)
=> ! [X2] :
( mem(X2,arr(X1,X0))
=> ! [X3] :
( mem(X3,arr(X0,bool))
=> ! [X4] :
( mem(X4,arr(X0,bool))
=> ( ! [X5] :
( mem(X5,X0)
=> ( p(ap(X4,X5))
=> p(ap(X3,X5)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) ) ) ) ) ) ) ),
inference(rectify,[],[f53]) ).
fof(f107,plain,
! [X0,X1,X2] :
( ! [X3] :
( mem(ap(X2,X3),X1)
| ~ mem(X3,X0) )
| ~ mem(X2,arr(X0,X1)) ),
inference(ennf_transformation,[],[f4]) ).
fof(f138,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( ! [X4] :
( ! [X5] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X0,X1),X4),X5))
<=> ! [X6] :
( ? [X7] :
( ap(X4,X7) = X6
& mem(X7,X0) )
| p(ap(X5,X6))
| ~ mem(X6,X1) ) )
| ~ mem(X5,arr(X1,bool)) )
| ~ mem(X4,arr(X0,X1)) )
& ! [X8] :
( ! [X9] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X0,X1),X8),X9))
<=> ! [X10] :
( ? [X11] :
( ap(X8,X11) = X10
& mem(X11,X0) )
| ~ p(ap(X9,X10))
| ~ mem(X10,X1) ) )
| ~ mem(X9,arr(X1,bool)) )
| ~ mem(X8,arr(X0,X1)) )
& ! [X12] :
( ! [X13] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X12),X13))
<=> ! [X14] :
( ~ p(ap(X13,ap(X12,X14)))
| ~ mem(X14,X0) ) )
| ~ mem(X13,arr(X1,bool)) )
| ~ mem(X12,arr(X0,X1)) )
& ! [X15] :
( ! [X16] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X15),X16))
<=> ! [X17] :
( p(ap(X16,ap(X15,X17)))
| ~ mem(X17,X0) ) )
| ~ mem(X16,arr(X1,bool)) )
| ~ mem(X15,arr(X0,X1)) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X0,X1),X2),X3))
<=> ! [X18] :
( ? [X19] :
( ~ p(ap(X3,ap(X2,X19)))
& mem(X19,X0) )
| p(ap(X3,X18))
| ~ mem(X18,X1) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X0,X1),X2),X3))
<=> ! [X20] :
( ? [X21] :
( p(ap(X3,ap(X2,X21)))
& mem(X21,X0) )
| ~ p(ap(X3,X20))
| ~ mem(X20,X1) ) ) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ ne(X1) )
| ~ ne(X0) ),
inference(ennf_transformation,[],[f85]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( ! [X4] :
( ! [X5] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X0,X1),X4),X5))
<=> ! [X6] :
( ? [X7] :
( ap(X4,X7) = X6
& mem(X7,X0) )
| p(ap(X5,X6))
| ~ mem(X6,X1) ) )
| ~ mem(X5,arr(X1,bool)) )
| ~ mem(X4,arr(X0,X1)) )
& ! [X8] :
( ! [X9] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X0,X1),X8),X9))
<=> ! [X10] :
( ? [X11] :
( ap(X8,X11) = X10
& mem(X11,X0) )
| ~ p(ap(X9,X10))
| ~ mem(X10,X1) ) )
| ~ mem(X9,arr(X1,bool)) )
| ~ mem(X8,arr(X0,X1)) )
& ! [X12] :
( ! [X13] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X12),X13))
<=> ! [X14] :
( ~ p(ap(X13,ap(X12,X14)))
| ~ mem(X14,X0) ) )
| ~ mem(X13,arr(X1,bool)) )
| ~ mem(X12,arr(X0,X1)) )
& ! [X15] :
( ! [X16] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X15),X16))
<=> ! [X17] :
( p(ap(X16,ap(X15,X17)))
| ~ mem(X17,X0) ) )
| ~ mem(X16,arr(X1,bool)) )
| ~ mem(X15,arr(X0,X1)) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X0,X1),X2),X3))
<=> ! [X18] :
( ? [X19] :
( ~ p(ap(X3,ap(X2,X19)))
& mem(X19,X0) )
| p(ap(X3,X18))
| ~ mem(X18,X1) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X0,X1),X2),X3))
<=> ! [X20] :
( ? [X21] :
( p(ap(X3,ap(X2,X21)))
& mem(X21,X0) )
| ~ p(ap(X3,X20))
| ~ mem(X20,X1) ) ) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ ne(X1) )
| ~ ne(X0) ),
inference(flattening,[],[f138]) ).
fof(f155,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))
& ! [X5] :
( p(ap(X3,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,X0) )
& mem(X4,arr(X0,bool)) )
& mem(X3,arr(X0,bool)) )
& mem(X2,arr(X1,X0)) )
& ne(X1) )
& ne(X0) ),
inference(ennf_transformation,[],[f105]) ).
fof(f156,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))
& ! [X5] :
( p(ap(X3,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,X0) )
& mem(X4,arr(X0,bool)) )
& mem(X3,arr(X0,bool)) )
& mem(X2,arr(X1,X0)) )
& ne(X1) )
& ne(X0) ),
inference(flattening,[],[f155]) ).
fof(f159,plain,
! [X2,X3,X0,X1] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X0,X1),X2),X3))
<=> ! [X20] :
( ? [X21] :
( p(ap(X3,ap(X2,X21)))
& mem(X21,X0) )
| ~ p(ap(X3,X20))
| ~ mem(X20,X1) ) )
| ~ sP1(X2,X3,X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f160,plain,
! [X2,X3,X0,X1] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X0,X1),X2),X3))
<=> ! [X18] :
( ? [X19] :
( ~ p(ap(X3,ap(X2,X19)))
& mem(X19,X0) )
| p(ap(X3,X18))
| ~ mem(X18,X1) ) )
| ~ sP2(X2,X3,X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f161,plain,
! [X0,X1] :
( ! [X8] :
( ! [X9] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X0,X1),X8),X9))
<=> ! [X10] :
( ? [X11] :
( ap(X8,X11) = X10
& mem(X11,X0) )
| ~ p(ap(X9,X10))
| ~ mem(X10,X1) ) )
| ~ mem(X9,arr(X1,bool)) )
| ~ mem(X8,arr(X0,X1)) )
| ~ sP3(X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f162,plain,
! [X0,X1] :
( ! [X4] :
( ! [X5] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X0,X1),X4),X5))
<=> ! [X6] :
( ? [X7] :
( ap(X4,X7) = X6
& mem(X7,X0) )
| p(ap(X5,X6))
| ~ mem(X6,X1) ) )
| ~ mem(X5,arr(X1,bool)) )
| ~ mem(X4,arr(X0,X1)) )
| ~ sP4(X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f163,plain,
! [X0,X1] :
( ! [X15] :
( ! [X16] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X15),X16))
<=> ! [X17] :
( p(ap(X16,ap(X15,X17)))
| ~ mem(X17,X0) ) )
| ~ mem(X16,arr(X1,bool)) )
| ~ mem(X15,arr(X0,X1)) )
| ~ sP5(X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP5])]) ).
fof(f164,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( sP4(X0,X1)
& sP3(X0,X1)
& ! [X12] :
( ! [X13] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X12),X13))
<=> ! [X14] :
( ~ p(ap(X13,ap(X12,X14)))
| ~ mem(X14,X0) ) )
| ~ mem(X13,arr(X1,bool)) )
| ~ mem(X12,arr(X0,X1)) )
& sP5(X0,X1)
& sP2(X2,X3,X0,X1)
& sP1(X2,X3,X0,X1) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ ne(X1) )
| ~ ne(X0) ),
inference(definition_folding,[],[f139,f163,f162,f161,f160,f159]) ).
fof(f238,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( sP4(X0,X1)
& sP3(X0,X1)
& ! [X12] :
( ! [X13] :
( ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X12),X13))
| ? [X14] :
( p(ap(X13,ap(X12,X14)))
& mem(X14,X0) ) )
& ( ! [X14] :
( ~ p(ap(X13,ap(X12,X14)))
| ~ mem(X14,X0) )
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X12),X13)) ) )
| ~ mem(X13,arr(X1,bool)) )
| ~ mem(X12,arr(X0,X1)) )
& sP5(X0,X1)
& sP2(X2,X3,X0,X1)
& sP1(X2,X3,X0,X1) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ ne(X1) )
| ~ ne(X0) ),
inference(nnf_transformation,[],[f164]) ).
fof(f239,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( sP4(X0,X1)
& sP3(X0,X1)
& ! [X4] :
( ! [X5] :
( ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5))
| ? [X6] :
( p(ap(X5,ap(X4,X6)))
& mem(X6,X0) ) )
& ( ! [X7] :
( ~ p(ap(X5,ap(X4,X7)))
| ~ mem(X7,X0) )
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5)) ) )
| ~ mem(X5,arr(X1,bool)) )
| ~ mem(X4,arr(X0,X1)) )
& sP5(X0,X1)
& sP2(X2,X3,X0,X1)
& sP1(X2,X3,X0,X1) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ ne(X1) )
| ~ ne(X0) ),
inference(rectify,[],[f238]) ).
fof(f240,plain,
! [X0,X4,X5] :
( ? [X6] :
( p(ap(X5,ap(X4,X6)))
& mem(X6,X0) )
=> ( p(ap(X5,ap(X4,sK31(X0,X4,X5))))
& mem(sK31(X0,X4,X5),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f241,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( sP4(X0,X1)
& sP3(X0,X1)
& ! [X4] :
( ! [X5] :
( ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5))
| ( p(ap(X5,ap(X4,sK31(X0,X4,X5))))
& mem(sK31(X0,X4,X5),X0) ) )
& ( ! [X7] :
( ~ p(ap(X5,ap(X4,X7)))
| ~ mem(X7,X0) )
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5)) ) )
| ~ mem(X5,arr(X1,bool)) )
| ~ mem(X4,arr(X0,X1)) )
& sP5(X0,X1)
& sP2(X2,X3,X0,X1)
& sP1(X2,X3,X0,X1) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ ne(X1) )
| ~ ne(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31])],[f239,f240]) ).
fof(f282,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))
& ! [X5] :
( p(ap(X3,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,X0) )
& mem(X4,arr(X0,bool)) )
& mem(X3,arr(X0,bool)) )
& mem(X2,arr(X1,X0)) )
& ne(X1) )
& ne(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,sK32),X2),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,sK32),X2),X3))
& ! [X5] :
( p(ap(X3,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,sK32) )
& mem(X4,arr(sK32,bool)) )
& mem(X3,arr(sK32,bool)) )
& mem(X2,arr(X1,sK32)) )
& ne(X1) )
& ne(sK32) ) ),
introduced(choice_axiom,[]) ).
fof(f283,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,sK32),X2),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,sK32),X2),X3))
& ! [X5] :
( p(ap(X3,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,sK32) )
& mem(X4,arr(sK32,bool)) )
& mem(X3,arr(sK32,bool)) )
& mem(X2,arr(X1,sK32)) )
& ne(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),X2),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),X2),X3))
& ! [X5] :
( p(ap(X3,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,sK32) )
& mem(X4,arr(sK32,bool)) )
& mem(X3,arr(sK32,bool)) )
& mem(X2,arr(sK33,sK32)) )
& ne(sK33) ) ),
introduced(choice_axiom,[]) ).
fof(f284,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),X2),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),X2),X3))
& ! [X5] :
( p(ap(X3,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,sK32) )
& mem(X4,arr(sK32,bool)) )
& mem(X3,arr(sK32,bool)) )
& mem(X2,arr(sK33,sK32)) )
=> ( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),X3))
& ! [X5] :
( p(ap(X3,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,sK32) )
& mem(X4,arr(sK32,bool)) )
& mem(X3,arr(sK32,bool)) )
& mem(sK34,arr(sK33,sK32)) ) ),
introduced(choice_axiom,[]) ).
fof(f285,plain,
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),X3))
& ! [X5] :
( p(ap(X3,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,sK32) )
& mem(X4,arr(sK32,bool)) )
& mem(X3,arr(sK32,bool)) )
=> ( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),sK35))
& ! [X5] :
( p(ap(sK35,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,sK32) )
& mem(X4,arr(sK32,bool)) )
& mem(sK35,arr(sK32,bool)) ) ),
introduced(choice_axiom,[]) ).
fof(f286,plain,
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),sK35))
& ! [X5] :
( p(ap(sK35,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,sK32) )
& mem(X4,arr(sK32,bool)) )
=> ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),sK36))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),sK35))
& ! [X5] :
( p(ap(sK35,X5))
| ~ p(ap(sK36,X5))
| ~ mem(X5,sK32) )
& mem(sK36,arr(sK32,bool)) ) ),
introduced(choice_axiom,[]) ).
fof(f287,plain,
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),sK36))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),sK35))
& ! [X5] :
( p(ap(sK35,X5))
| ~ p(ap(sK36,X5))
| ~ mem(X5,sK32) )
& mem(sK36,arr(sK32,bool))
& mem(sK35,arr(sK32,bool))
& mem(sK34,arr(sK33,sK32))
& ne(sK33)
& ne(sK32) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK32,sK33,sK34,sK35,sK36])],[f156,f286,f285,f284,f283,f282]) ).
fof(f291,plain,
! [X2,X3,X0,X1] :
( mem(ap(X2,X3),X1)
| ~ mem(X3,X0)
| ~ mem(X2,arr(X0,X1)) ),
inference(cnf_transformation,[],[f107]) ).
fof(f393,plain,
! [X2,X3,X0,X1,X7,X4,X5] :
( ~ p(ap(X5,ap(X4,X7)))
| ~ mem(X7,X0)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5))
| ~ mem(X5,arr(X1,bool))
| ~ mem(X4,arr(X0,X1))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X0,X1))
| ~ ne(X1)
| ~ ne(X0) ),
inference(cnf_transformation,[],[f241]) ).
fof(f394,plain,
! [X2,X3,X0,X1,X4,X5] :
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5))
| mem(sK31(X0,X4,X5),X0)
| ~ mem(X5,arr(X1,bool))
| ~ mem(X4,arr(X0,X1))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X0,X1))
| ~ ne(X1)
| ~ ne(X0) ),
inference(cnf_transformation,[],[f241]) ).
fof(f395,plain,
! [X2,X3,X0,X1,X4,X5] :
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5))
| p(ap(X5,ap(X4,sK31(X0,X4,X5))))
| ~ mem(X5,arr(X1,bool))
| ~ mem(X4,arr(X0,X1))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X0,X1))
| ~ ne(X1)
| ~ ne(X0) ),
inference(cnf_transformation,[],[f241]) ).
fof(f487,plain,
ne(sK32),
inference(cnf_transformation,[],[f287]) ).
fof(f488,plain,
ne(sK33),
inference(cnf_transformation,[],[f287]) ).
fof(f489,plain,
mem(sK34,arr(sK33,sK32)),
inference(cnf_transformation,[],[f287]) ).
fof(f490,plain,
mem(sK35,arr(sK32,bool)),
inference(cnf_transformation,[],[f287]) ).
fof(f491,plain,
mem(sK36,arr(sK32,bool)),
inference(cnf_transformation,[],[f287]) ).
fof(f492,plain,
! [X5] :
( p(ap(sK35,X5))
| ~ p(ap(sK36,X5))
| ~ mem(X5,sK32) ),
inference(cnf_transformation,[],[f287]) ).
fof(f493,plain,
p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),sK35)),
inference(cnf_transformation,[],[f287]) ).
fof(f494,plain,
~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),sK36)),
inference(cnf_transformation,[],[f287]) ).
cnf(c_52,plain,
( ~ mem(X0,arr(X1,X2))
| ~ mem(X3,X1)
| mem(ap(X0,X3),X2) ),
inference(cnf_transformation,[],[f291]) ).
cnf(c_131,plain,
( ~ mem(X0,arr(X1,X2))
| ~ mem(X3,arr(X1,X2))
| ~ mem(X4,arr(X2,bool))
| ~ mem(X5,arr(X2,bool))
| ~ ne(X1)
| ~ ne(X2)
| p(ap(X5,ap(X3,sK31(X1,X3,X5))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X3),X5)) ),
inference(cnf_transformation,[],[f395]) ).
cnf(c_132,plain,
( ~ mem(X0,arr(X1,X2))
| ~ mem(X3,arr(X1,X2))
| ~ mem(X4,arr(X2,bool))
| ~ mem(X5,arr(X2,bool))
| ~ ne(X1)
| ~ ne(X2)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X3),X5))
| mem(sK31(X1,X3,X5),X1) ),
inference(cnf_transformation,[],[f394]) ).
cnf(c_133,plain,
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3))
| ~ p(ap(X3,ap(X2,X4)))
| ~ mem(X2,arr(X0,X1))
| ~ mem(X5,arr(X0,X1))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X6,arr(X1,bool))
| ~ mem(X4,X0)
| ~ ne(X0)
| ~ ne(X1) ),
inference(cnf_transformation,[],[f393]) ).
cnf(c_210,negated_conjecture,
~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),sK36)),
inference(cnf_transformation,[],[f494]) ).
cnf(c_211,negated_conjecture,
p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),sK34),sK35)),
inference(cnf_transformation,[],[f493]) ).
cnf(c_212,negated_conjecture,
( ~ p(ap(sK36,X0))
| ~ mem(X0,sK32)
| p(ap(sK35,X0)) ),
inference(cnf_transformation,[],[f492]) ).
cnf(c_213,negated_conjecture,
mem(sK36,arr(sK32,bool)),
inference(cnf_transformation,[],[f491]) ).
cnf(c_214,negated_conjecture,
mem(sK35,arr(sK32,bool)),
inference(cnf_transformation,[],[f490]) ).
cnf(c_215,negated_conjecture,
mem(sK34,arr(sK33,sK32)),
inference(cnf_transformation,[],[f489]) ).
cnf(c_216,negated_conjecture,
ne(sK33),
inference(cnf_transformation,[],[f488]) ).
cnf(c_217,negated_conjecture,
ne(sK32),
inference(cnf_transformation,[],[f487]) ).
cnf(c_6120,plain,
arr(sK33,sK32) = sP0_iProver_def,
definition ).
cnf(c_6121,plain,
arr(sK32,bool) = sP1_iProver_def,
definition ).
cnf(c_6122,plain,
c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32) = sP2_iProver_def,
definition ).
cnf(c_6123,plain,
ap(sP2_iProver_def,sK34) = sP3_iProver_def,
definition ).
cnf(c_6124,plain,
ap(sP3_iProver_def,sK35) = sP4_iProver_def,
definition ).
cnf(c_6125,plain,
ap(sP3_iProver_def,sK36) = sP5_iProver_def,
definition ).
cnf(c_6126,negated_conjecture,
ne(sK32),
inference(demodulation,[status(thm)],[c_217]) ).
cnf(c_6127,negated_conjecture,
ne(sK33),
inference(demodulation,[status(thm)],[c_216]) ).
cnf(c_6128,negated_conjecture,
mem(sK34,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_215,c_6120]) ).
cnf(c_6129,negated_conjecture,
mem(sK35,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_214,c_6121]) ).
cnf(c_6130,negated_conjecture,
mem(sK36,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_213]) ).
cnf(c_6131,negated_conjecture,
( ~ p(ap(sK36,X0))
| ~ mem(X0,sK32)
| p(ap(sK35,X0)) ),
inference(demodulation,[status(thm)],[c_212]) ).
cnf(c_6132,negated_conjecture,
p(sP4_iProver_def),
inference(demodulation,[status(thm)],[c_211,c_6122,c_6123,c_6124]) ).
cnf(c_6133,negated_conjecture,
~ p(sP5_iProver_def),
inference(demodulation,[status(thm)],[c_210,c_6125]) ).
cnf(c_7669,plain,
( ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sK33)
| mem(ap(X0,X1),sK32) ),
inference(superposition,[status(thm)],[c_6120,c_52]) ).
cnf(c_19040,plain,
( ~ mem(X0,arr(sK33,sK32))
| ~ mem(X1,arr(sK32,bool))
| ~ mem(X2,arr(sK32,bool))
| ~ mem(X3,sP0_iProver_def)
| ~ ne(sK33)
| ~ ne(sK32)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),X0),X2))
| mem(sK31(sK33,X0,X2),sK33) ),
inference(superposition,[status(thm)],[c_6120,c_132]) ).
cnf(c_19069,plain,
( ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP1_iProver_def)
| ~ mem(X2,sP1_iProver_def)
| ~ mem(X3,sP0_iProver_def)
| ~ ne(sK33)
| ~ ne(sK32)
| mem(sK31(sK33,X0,X2),sK33)
| p(ap(ap(sP2_iProver_def,X0),X2)) ),
inference(light_normalisation,[status(thm)],[c_19040,c_6120,c_6121,c_6122]) ).
cnf(c_19070,plain,
( ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP1_iProver_def)
| ~ mem(X2,sP1_iProver_def)
| ~ mem(X3,sP0_iProver_def)
| mem(sK31(sK33,X0,X2),sK33)
| p(ap(ap(sP2_iProver_def,X0),X2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_19069,c_6126,c_6127]) ).
cnf(c_19362,plain,
( ~ mem(X0,arr(sK33,sK32))
| ~ mem(X1,arr(sK32,bool))
| ~ mem(X2,arr(sK32,bool))
| ~ mem(X3,sP0_iProver_def)
| ~ ne(sK33)
| ~ ne(sK32)
| p(ap(X2,ap(X0,sK31(sK33,X0,X2))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK33,sK32),X0),X2)) ),
inference(superposition,[status(thm)],[c_6120,c_131]) ).
cnf(c_19391,plain,
( ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP1_iProver_def)
| ~ mem(X2,sP1_iProver_def)
| ~ mem(X3,sP0_iProver_def)
| ~ ne(sK33)
| ~ ne(sK32)
| p(ap(X2,ap(X0,sK31(sK33,X0,X2))))
| p(ap(ap(sP2_iProver_def,X0),X2)) ),
inference(light_normalisation,[status(thm)],[c_19362,c_6120,c_6121,c_6122]) ).
cnf(c_19392,plain,
( ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP1_iProver_def)
| ~ mem(X2,sP1_iProver_def)
| ~ mem(X3,sP0_iProver_def)
| p(ap(X2,ap(X0,sK31(sK33,X0,X2))))
| p(ap(ap(sP2_iProver_def,X0),X2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_19391,c_6126,c_6127]) ).
cnf(c_19597,plain,
( ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP1_iProver_def)
| ~ mem(X2,sP0_iProver_def)
| mem(sK31(sK33,X0,X1),sK33)
| p(ap(ap(sP2_iProver_def,X0),X1)) ),
inference(superposition,[status(thm)],[c_6129,c_19070]) ).
cnf(c_19628,plain,
( ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP1_iProver_def)
| mem(sK31(sK33,X0,X1),sK33)
| p(ap(ap(sP2_iProver_def,X0),X1)) ),
inference(superposition,[status(thm)],[c_6128,c_19597]) ).
cnf(c_19697,plain,
( ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP1_iProver_def)
| ~ mem(X2,sP0_iProver_def)
| p(ap(X1,ap(X0,sK31(sK33,X0,X1))))
| p(ap(ap(sP2_iProver_def,X0),X1)) ),
inference(superposition,[status(thm)],[c_6129,c_19392]) ).
cnf(c_19728,plain,
( ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP1_iProver_def)
| p(ap(X1,ap(X0,sK31(sK33,X0,X1))))
| p(ap(ap(sP2_iProver_def,X0),X1)) ),
inference(superposition,[status(thm)],[c_6128,c_19697]) ).
cnf(c_19760,plain,
( ~ mem(ap(X0,sK31(sK33,X0,sK36)),sK32)
| ~ mem(X0,sP0_iProver_def)
| ~ mem(sK36,sP1_iProver_def)
| p(ap(sK35,ap(X0,sK31(sK33,X0,sK36))))
| p(ap(ap(sP2_iProver_def,X0),sK36)) ),
inference(superposition,[status(thm)],[c_19728,c_6131]) ).
cnf(c_19774,plain,
( ~ mem(ap(X0,sK31(sK33,X0,sK36)),sK32)
| ~ mem(X0,sP0_iProver_def)
| p(ap(sK35,ap(X0,sK31(sK33,X0,sK36))))
| p(ap(ap(sP2_iProver_def,X0),sK36)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_19760,c_6130]) ).
cnf(c_20119,plain,
( ~ p(ap(X0,ap(X1,X2)))
| ~ p(ap(ap(sP2_iProver_def,X1),X0))
| ~ mem(X0,arr(sK32,bool))
| ~ mem(X1,arr(sK33,sK32))
| ~ mem(X3,arr(sK33,sK32))
| ~ mem(X4,arr(sK32,bool))
| ~ mem(X2,sK33)
| ~ ne(sK33)
| ~ ne(sK32) ),
inference(superposition,[status(thm)],[c_6122,c_133]) ).
cnf(c_20120,plain,
( ~ p(ap(X0,ap(X1,X2)))
| ~ p(ap(ap(sP2_iProver_def,X1),X0))
| ~ mem(X0,sP1_iProver_def)
| ~ mem(X1,sP0_iProver_def)
| ~ mem(X2,sK33)
| ~ mem(X3,sP0_iProver_def)
| ~ mem(X4,sP1_iProver_def)
| ~ ne(sK33)
| ~ ne(sK32) ),
inference(light_normalisation,[status(thm)],[c_20119,c_6120,c_6121]) ).
cnf(c_20121,plain,
( ~ p(ap(X0,ap(X1,X2)))
| ~ p(ap(ap(sP2_iProver_def,X1),X0))
| ~ mem(X0,sP1_iProver_def)
| ~ mem(X1,sP0_iProver_def)
| ~ mem(X2,sK33)
| ~ mem(X3,sP0_iProver_def)
| ~ mem(X4,sP1_iProver_def) ),
inference(forward_subsumption_resolution,[status(thm)],[c_20120,c_6126,c_6127]) ).
cnf(c_20392,plain,
( ~ mem(ap(X0,sK31(sK33,X0,sK36)),sK32)
| ~ mem(sK31(sK33,X0,sK36),sK33)
| ~ p(ap(ap(sP2_iProver_def,X0),sK35))
| ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP0_iProver_def)
| ~ mem(X2,sP1_iProver_def)
| ~ mem(sK35,sP1_iProver_def)
| p(ap(ap(sP2_iProver_def,X0),sK36)) ),
inference(superposition,[status(thm)],[c_19774,c_20121]) ).
cnf(c_20795,plain,
( ~ mem(ap(X0,sK31(sK33,X0,sK36)),sK32)
| ~ mem(sK31(sK33,X0,sK36),sK33)
| ~ p(ap(ap(sP2_iProver_def,X0),sK35))
| ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP0_iProver_def)
| ~ mem(X2,sP1_iProver_def)
| p(ap(ap(sP2_iProver_def,X0),sK36)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_20392,c_6129]) ).
cnf(c_21248,plain,
( ~ mem(sK31(sK33,X0,sK36),sK33)
| ~ p(ap(ap(sP2_iProver_def,X0),sK35))
| ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP0_iProver_def)
| ~ mem(X2,sP1_iProver_def)
| p(ap(ap(sP2_iProver_def,X0),sK36)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_20795,c_7669]) ).
cnf(c_21255,plain,
( ~ p(ap(ap(sP2_iProver_def,X0),sK35))
| ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP0_iProver_def)
| ~ mem(X2,sP1_iProver_def)
| ~ mem(sK36,sP1_iProver_def)
| p(ap(ap(sP2_iProver_def,X0),sK36)) ),
inference(superposition,[status(thm)],[c_19628,c_21248]) ).
cnf(c_21256,plain,
( ~ p(ap(ap(sP2_iProver_def,X0),sK35))
| ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP0_iProver_def)
| ~ mem(X2,sP1_iProver_def)
| p(ap(ap(sP2_iProver_def,X0),sK36)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_21255,c_6130]) ).
cnf(c_21278,plain,
( ~ p(ap(sP3_iProver_def,sK35))
| ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP1_iProver_def)
| ~ mem(sK34,sP0_iProver_def)
| p(ap(ap(sP2_iProver_def,sK34),sK36)) ),
inference(superposition,[status(thm)],[c_6123,c_21256]) ).
cnf(c_21279,plain,
( ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP1_iProver_def)
| ~ mem(sK34,sP0_iProver_def)
| ~ p(sP4_iProver_def)
| p(sP5_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_21278,c_6123,c_6124,c_6125]) ).
cnf(c_21280,plain,
( ~ mem(X0,sP0_iProver_def)
| ~ mem(X1,sP1_iProver_def) ),
inference(forward_subsumption_resolution,[status(thm)],[c_21279,c_6133,c_6132,c_6128]) ).
cnf(c_21295,plain,
~ mem(X0,sP1_iProver_def),
inference(superposition,[status(thm)],[c_6128,c_21280]) ).
cnf(c_21296,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_6129,c_21295]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP006+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n025.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 : Thu May 2 22:06:13 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
% 7.85/1.67 % SZS status Started for theBenchmark.p
% 7.85/1.67 % SZS status Theorem for theBenchmark.p
% 7.85/1.67
% 7.85/1.67 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.85/1.67
% 7.85/1.67 ------ iProver source info
% 7.85/1.67
% 7.85/1.67 git: date: 2024-05-02 19:28:25 +0000
% 7.85/1.67 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.85/1.67 git: non_committed_changes: false
% 7.85/1.67
% 7.85/1.67 ------ Parsing...
% 7.85/1.67 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.85/1.67
% 7.85/1.67 ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.85/1.67
% 7.85/1.67 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.85/1.67
% 7.85/1.67 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.85/1.67 ------ Proving...
% 7.85/1.67 ------ Problem Properties
% 7.85/1.67
% 7.85/1.67
% 7.85/1.67 clauses 91
% 7.85/1.67 conjectures 8
% 7.85/1.67 EPR 15
% 7.85/1.67 Horn 72
% 7.85/1.67 unary 23
% 7.85/1.67 binary 5
% 7.85/1.67 lits 323
% 7.85/1.67 lits eq 18
% 7.85/1.67 fd_pure 0
% 7.85/1.67 fd_pseudo 0
% 7.85/1.67 fd_cond 0
% 7.85/1.67 fd_pseudo_cond 5
% 7.85/1.67 AC symbols 0
% 7.85/1.67
% 7.85/1.67 ------ Schedule dynamic 5 is on
% 7.85/1.67
% 7.85/1.67 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.85/1.67
% 7.85/1.67
% 7.85/1.67 ------
% 7.85/1.67 Current options:
% 7.85/1.67 ------
% 7.85/1.67
% 7.85/1.67
% 7.85/1.67
% 7.85/1.67
% 7.85/1.67 ------ Proving...
% 7.85/1.67
% 7.85/1.67
% 7.85/1.67 % SZS status Theorem for theBenchmark.p
% 7.85/1.67
% 7.85/1.67 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.85/1.67
% 7.85/1.67
%------------------------------------------------------------------------------