TSTP Solution File: ITP004_2 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ITP004_2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% 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 : 600s
% DateTime : Sun Jul 17 00:39:38 EDT 2022
% Result : Theorem 0.89s 1.57s
% Output : Refutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 13
% Syntax : Number of clauses : 14 ( 5 unt; 2 nHn; 13 RR)
% Number of literals : 41 ( 0 equ; 26 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 26 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(17,axiom,
del(bool),
file('ITP004_2.p',unknown),
[] ).
cnf(19,axiom,
del(skc4),
file('ITP004_2.p',unknown),
[] ).
cnf(22,axiom,
mem(skc5,arr(skc4,bool)),
file('ITP004_2.p',unknown),
[] ).
cnf(32,axiom,
( ~ del(U)
| ~ del(V)
| del(arr(U,V)) ),
file('ITP004_2.p',unknown),
[] ).
cnf(35,axiom,
( ~ del(U)
| mem(c_2Epred__set_2ECHOICE(U),arr(arr(U,bool),U)) ),
file('ITP004_2.p',unknown),
[] ).
cnf(37,axiom,
~ p(ap(ap(c_2Epred__set_2ESUBSET(skc4),ap(c_2Epred__set_2EREST(skc4),skc5)),skc5)),
file('ITP004_2.p',unknown),
[] ).
cnf(39,axiom,
( ~ del(U)
| mem(c_2Epred__set_2EREST(U),arr(arr(U,bool),arr(U,bool))) ),
file('ITP004_2.p',unknown),
[] ).
cnf(56,axiom,
( ~ del(U)
| ~ del(V)
| ~ mem(W,U)
| ~ mem(X,arr(U,V))
| mem(ap(X,W),V) ),
file('ITP004_2.p',unknown),
[] ).
cnf(61,axiom,
( ~ del(U)
| ~ mem(V,arr(U,bool))
| equal(ap(ap(c_2Epred__set_2EDELETE(U),V),ap(c_2Epred__set_2ECHOICE(U),V)),ap(c_2Epred__set_2EREST(U),V)) ),
file('ITP004_2.p',unknown),
[] ).
cnf(63,axiom,
( ~ del(U)
| ~ mem(V,arr(U,bool))
| ~ mem(W,arr(U,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(U),V),W))
| mem(skf5(U,X,Y),U) ),
file('ITP004_2.p',unknown),
[] ).
cnf(64,axiom,
( ~ del(U)
| ~ mem(V,arr(U,bool))
| ~ mem(W,arr(U,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(U),V),W))
| p(ap(ap(c_2Ebool_2EIN(U),skf5(U,W,V)),V)) ),
file('ITP004_2.p',unknown),
[] ).
cnf(65,axiom,
( ~ del(U)
| ~ p(ap(ap(c_2Ebool_2EIN(U),skf5(U,V,W)),V))
| ~ mem(X,arr(U,bool))
| ~ mem(V,arr(U,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(U),X),V)) ),
file('ITP004_2.p',unknown),
[] ).
cnf(68,axiom,
( ~ del(U)
| ~ p(ap(ap(c_2Ebool_2EIN(U),V),ap(ap(c_2Epred__set_2EDELETE(U),W),X)))
| ~ mem(V,U)
| ~ mem(X,U)
| ~ mem(W,arr(U,bool))
| p(ap(ap(c_2Ebool_2EIN(U),V),W)) ),
file('ITP004_2.p',unknown),
[] ).
cnf(4490,plain,
$false,
inference(thr,[status(thm)],[68,65,64,63,61,56,39,37,35,32,22,19,17]),
[iquote('0:ThR:68,65,64,63,61,56,39,37,35,32,22,19,17')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ITP004_2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.12/0.13 % Command : spasst-tptp-script %s %d
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 2 23:49:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.48 % Using EUF theory
% 0.89/1.57
% 0.89/1.57
% 0.89/1.57 % SZS status Theorem for /tmp/SPASST_10228_n024.cluster.edu
% 0.89/1.57
% 0.89/1.57 SPASS V 2.2.22 in combination with yices.
% 0.89/1.57 SPASS beiseite: Proof found by SPASS and SMT.
% 0.89/1.57 Problem: /tmp/SPASST_10228_n024.cluster.edu
% 0.89/1.57 SPASS derived 3334 clauses, backtracked 1040 clauses and kept 1964 clauses.
% 0.89/1.57 SPASS backtracked 13 times (1 times due to theory inconsistency).
% 0.89/1.57 SPASS allocated 9530 KBytes.
% 0.89/1.57 SPASS spent 0:00:00.43 on the problem.
% 0.89/1.57 0:00:00.00 for the input.
% 0.89/1.57 0:00:00.02 for the FLOTTER CNF translation.
% 0.89/1.57 0:00:00.03 for inferences.
% 0.89/1.57 0:00:00.01 for the backtracking.
% 0.89/1.57 0:00:00.28 for the reduction.
% 0.89/1.57 0:00:00.04 for interacting with the SMT procedure.
% 0.89/1.57
% 0.89/1.57
% 0.89/1.57 % SZS output start CNFRefutation for /tmp/SPASST_10228_n024.cluster.edu
% See solution above
% 0.89/1.57
% 0.89/1.57 Formulae used in the proof : fof_bool fof_conj_thm_2Epred__set_2EREST__SUBSET fof_arr fof_mem_c_2Epred__set_2ECHOICE fof_mem_c_2Epred__set_2EREST fof_ap_tp fof_ax_thm_2Epred__set_2EREST__DEF fof_ax_thm_2Epred__set_2ESUBSET__DEF fof_conj_thm_2Epred__set_2EIN__DELETE
% 0.89/1.62
% 0.89/1.63 SPASS+T ended
%------------------------------------------------------------------------------