TSTP Solution File: ITP010_2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ITP010_2 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n023.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 : Sun May 5 06:47:15 EDT 2024
% Result : Theorem 0.61s 0.81s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 25
% Syntax : Number of formulae : 36 ( 3 unt; 22 typ; 0 def)
% Number of atoms : 187 ( 0 equ)
% Maximal formula atoms : 12 ( 13 avg)
% Number of connectives : 76 ( 27 ~; 16 |; 21 &)
% ( 3 <=>; 8 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 124 ( 124 fml; 0 var)
% Number of types : 4 ( 2 usr)
% Number of type conns : 23 ( 14 >; 9 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 6 con; 0-3 aty)
% Number of variables : 30 ( 12 !; 18 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
del: $tType ).
tff(type_def_6,type,
tp__o: $tType ).
tff(func_def_0,type,
bool: del ).
tff(func_def_1,type,
ind: del ).
tff(func_def_2,type,
arr: ( del * del ) > del ).
tff(func_def_4,type,
k: ( del * $i ) > $i ).
tff(func_def_5,type,
i: del > $i ).
tff(func_def_6,type,
inj__o: tp__o > $i ).
tff(func_def_7,type,
surj__o: $i > tp__o ).
tff(func_def_9,type,
fo__c_2Ebool_2ET: tp__o ).
tff(func_def_10,type,
c_2Ecardinal_2Ecardleq: ( del * del ) > $i ).
tff(func_def_12,type,
fo__c_2Ebool_2EF: tp__o ).
tff(func_def_14,type,
fo__c_2Emin_2E_3D_3D_3E: ( tp__o * tp__o ) > tp__o ).
tff(func_def_16,type,
fo__c_2Ebool_2E_5C_2F: ( tp__o * tp__o ) > tp__o ).
tff(func_def_18,type,
fo__c_2Ebool_2E_2F_5C: ( tp__o * tp__o ) > tp__o ).
tff(func_def_20,type,
fo__c_2Ebool_2E_7E: tp__o > tp__o ).
tff(func_def_21,type,
c_2Emin_2E_3D: del > $i ).
tff(func_def_22,type,
c_2Ebool_2E_21: del > $i ).
tff(func_def_23,type,
sK0: del ).
tff(func_def_24,type,
sK1: del ).
tff(func_def_27,type,
sK4: ( del * $i * $i ) > $i ).
tff(pred_def_1,type,
mem: ( $i * del ) > $o ).
tff(f79,plain,
$false,
inference(subsumption_resolution,[],[f77,f78]) ).
tff(f78,plain,
p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3)),
inference(duplicate_literal_removal,[],[f70]) ).
tff(f70,plain,
( p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3)) ),
inference(cnf_transformation,[],[f64]) ).
tff(f64,plain,
( ( p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3)) )
& mem(sK3,arr(sK1,bool))
& mem(sK2,arr(sK0,bool)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f61,f63,f62]) ).
tff(f62,plain,
( ? [X0: del,X1: del,X2] :
( ? [X3] :
( ( p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) )
& mem(X3,arr(X1,bool)) )
& mem(X2,arr(X0,bool)) )
=> ( ? [X3] :
( ( p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),X3)) )
& mem(X3,arr(sK1,bool)) )
& mem(sK2,arr(sK0,bool)) ) ),
introduced(choice_axiom,[]) ).
tff(f63,plain,
( ? [X3] :
( ( p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),X3)) )
& mem(X3,arr(sK1,bool)) )
=> ( ( p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3)) )
& mem(sK3,arr(sK1,bool)) ) ),
introduced(choice_axiom,[]) ).
tff(f61,plain,
? [X0: del,X1: del,X2] :
( ? [X3] :
( ( p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) )
& mem(X3,arr(X1,bool)) )
& mem(X2,arr(X0,bool)) ),
inference(flattening,[],[f60]) ).
tff(f60,plain,
? [X0: del,X1: del,X2] :
( ? [X3] :
( ( p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
| p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) )
& mem(X3,arr(X1,bool)) )
& mem(X2,arr(X0,bool)) ),
inference(nnf_transformation,[],[f54]) ).
tff(f54,plain,
? [X0: del,X1: del,X2] :
( ? [X3] :
( ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
<~> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) )
& mem(X3,arr(X1,bool)) )
& mem(X2,arr(X0,bool)) ),
inference(ennf_transformation,[],[f49]) ).
tff(f49,plain,
~ ! [X0: del,X1: del,X2] :
( mem(X2,arr(X0,bool))
=> ! [X3] :
( mem(X3,arr(X1,bool))
=> ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3))
<=> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X0,X1),X2),X3)) ) ) ),
inference(rectify,[],[f48]) ).
tff(f48,negated_conjecture,
~ ! [X8: del,X9: del,X15] :
( mem(X15,arr(X8,bool))
=> ! [X16] :
( mem(X16,arr(X9,bool))
=> ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X8,X9),X15),X16))
<=> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X8,X9),X15),X16)) ) ) ),
inference(negated_conjecture,[],[f47]) ).
tff(f47,conjecture,
! [X8: del,X9: del,X15] :
( mem(X15,arr(X8,bool))
=> ! [X16] :
( mem(X16,arr(X9,bool))
=> ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X8,X9),X15),X16))
<=> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X8,X9),X15),X16)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.HsnJZvEMZz/Vampire---4.8_28422',conj_thm_2Ecardinal_2ECARD__NOT__LE) ).
tff(f77,plain,
~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3)),
inference(duplicate_literal_removal,[],[f69]) ).
tff(f69,plain,
( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardleq(sK0,sK1),sK2),sK3)) ),
inference(cnf_transformation,[],[f64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : ITP010_2 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.10/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 19:04:38 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a TF0_THM_EQU_NAR problem
% 0.12/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.HsnJZvEMZz/Vampire---4.8_28422
% 0.61/0.81 % (28548)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.81 % (28549)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.81 % (28550)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.81 % (28551)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.61/0.81 % (28546)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.61/0.81 % (28545)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.81 % (28552)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.61/0.81 % (28548)First to succeed.
% 0.61/0.81 % (28550)Also succeeded, but the first one will report.
% 0.61/0.81 % (28548)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28538"
% 0.61/0.81 % (28545)Also succeeded, but the first one will report.
% 0.61/0.81 % (28552)Also succeeded, but the first one will report.
% 0.61/0.81 % (28551)Also succeeded, but the first one will report.
% 0.61/0.81 % (28548)Refutation found. Thanks to Tanya!
% 0.61/0.81 % SZS status Theorem for Vampire---4
% 0.61/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.81 % (28548)------------------------------
% 0.61/0.81 % (28548)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (28548)Termination reason: Refutation
% 0.61/0.81
% 0.61/0.81 % (28548)Memory used [KB]: 1046
% 0.61/0.81 % (28548)Time elapsed: 0.004 s
% 0.61/0.81 % (28548)Instructions burned: 3 (million)
% 0.61/0.81 % (28538)Success in time 0.472 s
% 0.61/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------