%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : ITP006+5 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:37:57 AM UTC 2026
% Result : Theorem 152.26s 24.09s
% Output : CNFRefutation 152.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 12 unt; 0 def)
% Number of atoms : 121 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 152 ( 68 ~; 58 |; 0 &)
% ( 1 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 45 ( 0 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def,axiom,
! [X0] :
( ne(X0)
=> ! [X1] :
( ne(X1)
=> ! [X2] :
( mem(X2,arr(X0,X1))
=> ! [X3] :
( mem(X3,arr(X1,bool))
=> ( p(ap(ap('c$u2EquantHeuristics$u2EGUESS$u$uFORALL$u$uPOINT'(X0,X1),X2),X3))
<=> ! [X4] :
( mem(X4,X0)
=> ~ p(ap(X3,ap(X2,X4))) ) ) ) ) ) ) ).
fof(ap_tp,axiom,
! [X0,X1,X2] :
( mem(X2,arr(X0,X1))
=> ! [X3] :
( mem(X3,X0)
=> mem(ap(X2,X3),X1) ) ) ).
fof(conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT,conjecture,
! [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$u2EquantHeuristics$u2EGUESS$u$uFORALL$u$uPOINT'(X1,X0),X2),X3))
=> p(ap(ap('c$u2EquantHeuristics$u2EGUESS$u$uFORALL$u$uPOINT'(X1,X0),X2),X4)) ) ) ) ) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [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$u2EquantHeuristics$u2EGUESS$u$uFORALL$u$uPOINT'(X1,X0),X2),X3))
=> p(ap(ap('c$u2EquantHeuristics$u2EGUESS$u$uFORALL$u$uPOINT'(X1,X0),X2),X4)) ) ) ) ) ) ) ),
inference(negate_conjecture,[status(cth)],[conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT]) ).
cnf(c42,plain,
( ~ mem(X2,arr(X4,bool))
| ~ mem(X3,arr(X1,X4))
| ~ p(ap(ap('c$u2EquantHeuristics$u2EGUESS$u$uFORALL$u$uPOINT'(X1,X4),X3),X2))
| ~ ne(X4)
| ~ ne(X1)
| ~ p(ap(X2,ap(X3,X0)))
| ~ mem(X0,X1) ),
inference(clausification,[status(esa)],[ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def]) ).
cnf(c43,plain,
( ~ mem(X2,arr(X3,bool))
| ~ mem(X1,arr(X0,X3))
| ~ ne(X3)
| p(ap(ap('c$u2EquantHeuristics$u2EGUESS$u$uFORALL$u$uPOINT'(X0,X3),X1),X2))
| mem(sK64(X0,X1,X2),X0)
| ~ ne(X0) ),
inference(clausification,[status(esa)],[ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def]) ).
cnf(c44,plain,
( ~ mem(X0,arr(X3,bool))
| ~ mem(X1,arr(X2,X3))
| ~ ne(X3)
| p(ap(ap('c$u2EquantHeuristics$u2EGUESS$u$uFORALL$u$uPOINT'(X2,X3),X1),X0))
| ~ ne(X2)
| p(ap(X0,ap(X1,sK64(X2,X1,X0)))) ),
inference(clausification,[status(esa)],[ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def]) ).
cnf(c149,plain,
( mem(ap(X0,X3),X2)
| ~ mem(X3,X1)
| ~ mem(X0,arr(X1,X2)) ),
inference(clausification,[status(esa)],[ap_tp]) ).
cnf(c6709,plain,
ne(sK10379),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c6710,plain,
ne(sK10380),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c6711,plain,
mem(sK10381,arr(sK10380,sK10379)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c6712,plain,
mem(sK10382,arr(sK10379,bool)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c6713,plain,
mem(sK10383,arr(sK10379,bool)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c6714,plain,
p(ap(ap('c$u2EquantHeuristics$u2EGUESS$u$uFORALL$u$uPOINT'(sK10380,sK10379),sK10381),sK10382)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c6715,plain,
~ p(ap(ap('c$u2EquantHeuristics$u2EGUESS$u$uFORALL$u$uPOINT'(sK10380,sK10379),sK10381),sK10383)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c6716,plain,
( ~ p(ap(sK10383,X0))
| p(ap(sK10382,X0))
| ~ mem(X0,sK10379) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ p(ap(sK10382,ap(sK10381,X0)))
| ~ mem(sK10382,arr(sK10379,bool))
| ~ mem(sK10381,arr(sK10380,sK10379))
| ~ mem(X0,sK10380)
| ~ ne(sK10379)
| ~ ne(sK10380) ),
inference(resolution,[status(thm)],[c42,c6714]) ).
cnf(d1,plain,
( ~ p(ap(sK10382,ap(sK10381,X0)))
| ~ mem(sK10382,arr(sK10379,bool))
| ~ mem(sK10381,arr(sK10380,sK10379))
| ~ mem(X0,sK10380)
| ~ ne(sK10380) ),
inference(resolution,[status(thm)],[c6709,d0]) ).
cnf(d2,plain,
( ~ p(ap(sK10382,ap(sK10381,X0)))
| ~ mem(sK10382,arr(sK10379,bool))
| ~ mem(sK10381,arr(sK10380,sK10379))
| ~ mem(X0,sK10380) ),
inference(resolution,[status(thm)],[c6710,d1]) ).
cnf(d3,plain,
( ~ p(ap(sK10382,ap(sK10381,X0)))
| ~ mem(sK10382,arr(sK10379,bool))
| ~ mem(X0,sK10380) ),
inference(resolution,[status(thm)],[c6711,d2]) ).
cnf(d4,plain,
( ~ p(ap(sK10382,ap(sK10381,X0)))
| ~ mem(X0,sK10380) ),
inference(resolution,[status(thm)],[c6712,d3]) ).
cnf(d5,plain,
( p(ap(sK10383,ap(sK10381,sK64(sK10380,sK10381,sK10383))))
| ~ mem(sK10381,arr(sK10380,sK10379))
| ~ mem(sK10383,arr(sK10379,bool))
| ~ ne(sK10380)
| ~ ne(sK10379) ),
inference(resolution,[status(thm)],[c44,c6715]) ).
cnf(d6,plain,
( p(ap(sK10383,ap(sK10381,sK64(sK10380,sK10381,sK10383))))
| ~ mem(sK10383,arr(sK10379,bool))
| ~ mem(sK10381,arr(sK10380,sK10379))
| ~ ne(sK10380) ),
inference(resolution,[status(thm)],[c6709,d5]) ).
cnf(d7,plain,
( p(ap(sK10383,ap(sK10381,sK64(sK10380,sK10381,sK10383))))
| ~ mem(sK10383,arr(sK10379,bool))
| ~ mem(sK10381,arr(sK10380,sK10379)) ),
inference(resolution,[status(thm)],[c6710,d6]) ).
cnf(d8,plain,
( p(ap(sK10383,ap(sK10381,sK64(sK10380,sK10381,sK10383))))
| ~ mem(sK10383,arr(sK10379,bool)) ),
inference(resolution,[status(thm)],[c6711,d7]) ).
cnf(d9,plain,
p(ap(sK10383,ap(sK10381,sK64(sK10380,sK10381,sK10383)))),
inference(resolution,[status(thm)],[c6713,d8]) ).
cnf(d10,plain,
( p(ap(sK10382,ap(sK10381,sK64(sK10380,sK10381,sK10383))))
| ~ mem(ap(sK10381,sK64(sK10380,sK10381,sK10383)),sK10379) ),
inference(resolution,[status(thm)],[d9,c6716]) ).
cnf(d11,plain,
( ~ mem(sK64(sK10380,sK10381,sK10383),sK10380)
| ~ mem(ap(sK10381,sK64(sK10380,sK10381,sK10383)),sK10379) ),
inference(resolution,[status(thm)],[d10,d4]) ).
cnf(d12,plain,
( mem(sK64(sK10380,sK10381,sK10383),sK10380)
| ~ mem(sK10381,arr(sK10380,sK10379))
| ~ mem(sK10383,arr(sK10379,bool))
| ~ ne(sK10380)
| ~ ne(sK10379) ),
inference(resolution,[status(thm)],[c43,c6715]) ).
cnf(d13,plain,
( ~ mem(sK10383,arr(sK10379,bool))
| ~ mem(sK10381,arr(sK10380,sK10379))
| mem(sK64(sK10380,sK10381,sK10383),sK10380)
| ~ ne(sK10380) ),
inference(resolution,[status(thm)],[c6709,d12]) ).
cnf(d14,plain,
( ~ mem(sK10383,arr(sK10379,bool))
| ~ mem(sK10381,arr(sK10380,sK10379))
| mem(sK64(sK10380,sK10381,sK10383),sK10380) ),
inference(resolution,[status(thm)],[c6710,d13]) ).
cnf(d15,plain,
( ~ mem(sK10383,arr(sK10379,bool))
| mem(sK64(sK10380,sK10381,sK10383),sK10380) ),
inference(resolution,[status(thm)],[c6711,d14]) ).
cnf(d16,plain,
mem(sK64(sK10380,sK10381,sK10383),sK10380),
inference(resolution,[status(thm)],[c6713,d15]) ).
cnf(d17,plain,
~ mem(ap(sK10381,sK64(sK10380,sK10381,sK10383)),sK10379),
inference(resolution,[status(thm)],[d16,d11]) ).
cnf(d18,plain,
( mem(ap(sK10381,X0),sK10379)
| ~ mem(X0,sK10380) ),
inference(resolution,[status(thm)],[c149,c6711]) ).
cnf(d19,plain,
~ mem(sK64(sK10380,sK10381,sK10383),sK10380),
inference(resolution,[status(thm)],[d18,d17]) ).
cnf(d20,plain,
$false,
inference(resolution,[status(thm)],[d16,d19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP006+5 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 17:07:39 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 152.26/24.09 % SZS status Theorem for theBenchmark.p
% 152.26/24.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------