TSTP Solution File: LCL789_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL789_5 : TPTP v8.1.2. Released v6.0.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 : n002.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 : Wed May 1 03:20:08 EDT 2024
% Result : Theorem 0.62s 0.82s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 62
% Syntax : Number of formulae : 69 ( 10 unt; 59 typ; 0 def)
% Number of atoms : 10 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 48 ( 24 >; 24 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 52 ( 52 usr; 25 con; 0-5 aty)
% Number of variables : 31 ( 0 !; 0 ?; 31 :)
% ( 31 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
dB: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
type: $tType ).
tff(type_def_10,type,
fun1: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : fun1(fun1(X0,X1),fun1(fun1(X2,X0),fun1(X2,X1))) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun1(X0,fun1(X1,X2)) * X1 ) > fun1(X0,X2) ) ).
tff(func_def_2,type,
combi:
!>[X0: $tType] : fun1(X0,X0) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun1(X0,fun1(X1,X2)) * fun1(X0,X1) ) > fun1(X0,X2) ) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
it: fun1(dB,bool) ).
tff(func_def_6,type,
app: fun1(dB,fun1(dB,dB)) ).
tff(func_def_7,type,
var: nat > dB ).
tff(func_def_8,type,
dB_size: dB > nat ).
tff(func_def_9,type,
lift: fun1(dB,fun1(nat,dB)) ).
tff(func_def_10,type,
subst: fun1(dB,fun1(dB,fun1(nat,dB))) ).
tff(func_def_11,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,fun1(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_12,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,fun1(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_13,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_14,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_15,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun1(X1,fun1(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_17,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_18,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_19,type,
shift:
!>[X0: $tType] : ( ( fun1(nat,X0) * nat * X0 ) > fun1(nat,X0) ) ).
tff(func_def_20,type,
atom: nat > type ).
tff(func_def_21,type,
fun: fun1(type,fun1(type,type)) ).
tff(func_def_22,type,
type_case:
!>[X0: $tType] : ( ( fun1(nat,X0) * fun1(type,fun1(type,X0)) * type ) > X0 ) ).
tff(func_def_23,type,
type_rec:
!>[X0: $tType] : ( ( fun1(nat,X0) * fun1(type,fun1(type,fun1(X0,fun1(X0,X0)))) * type ) > X0 ) ).
tff(func_def_24,type,
type_size: type > nat ).
tff(func_def_25,type,
typing: fun1(nat,type) > fun1(dB,fun1(type,bool)) ).
tff(func_def_26,type,
typings: ( fun1(nat,type) * list(dB) ) > fun1(list(type),bool) ).
tff(func_def_27,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * X0 ) > X1 ) ).
tff(func_def_28,type,
fEx:
!>[X0: $tType] : fun1(fun1(X0,bool),bool) ).
tff(func_def_29,type,
fFalse: bool ).
tff(func_def_30,type,
fTrue: bool ).
tff(func_def_31,type,
fconj: fun1(bool,fun1(bool,bool)) ).
tff(func_def_32,type,
t1: type ).
tff(func_def_33,type,
t: type ).
tff(func_def_34,type,
t_a: type ).
tff(func_def_35,type,
t2: type ).
tff(func_def_36,type,
ts: list(type) ).
tff(func_def_37,type,
a: dB ).
tff(func_def_38,type,
as: list(dB) ).
tff(func_def_39,type,
e: fun1(nat,type) ).
tff(func_def_40,type,
ea: fun1(nat,type) ).
tff(func_def_41,type,
i: nat ).
tff(func_def_42,type,
ia: nat ).
tff(func_def_43,type,
n: nat ).
tff(func_def_44,type,
rs: list(dB) ).
tff(func_def_45,type,
t3: dB ).
tff(func_def_46,type,
u: dB ).
tff(func_def_47,type,
ua: dB ).
tff(func_def_48,type,
sK0: ( type * dB * dB * fun1(nat,type) ) > type ).
tff(func_def_49,type,
sK1: type ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
listsp:
!>[X0: $tType] : ( ( fun1(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
pp: bool > $o ).
tff(f153,plain,
$false,
inference(subsumption_resolution,[],[f148,f152]) ).
tff(f152,plain,
~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),t2)),
inference(backward_demodulation,[],[f132,f143]) ).
tff(f143,plain,
t2 = aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)),
inference(cnf_transformation,[],[f3]) ).
tff(f3,axiom,
t2 = aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)),
file('/export/starexec/sandbox/tmp/tmp.dLWa4BEX4J/Vampire---4.8_15401',fact_2_T) ).
tff(f132,plain,
~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))),
inference(cnf_transformation,[],[f115]) ).
tff(f115,plain,
~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))),
inference(flattening,[],[f114]) ).
tff(f114,negated_conjecture,
~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))),
inference(negated_conjecture,[],[f113]) ).
tff(f113,conjecture,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))),
file('/export/starexec/sandbox/tmp/tmp.dLWa4BEX4J/Vampire---4.8_15401',conj_0) ).
tff(f148,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),t2)),
inference(cnf_transformation,[],[f2]) ).
tff(f2,axiom,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),t2)),
file('/export/starexec/sandbox/tmp/tmp.dLWa4BEX4J/Vampire---4.8_15401',fact_1_uT) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL789_5 : TPTP v8.1.2. Released v6.0.0.
% 0.10/0.12 % 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.32 % Computer : n002.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Apr 30 17:00:55 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.12/0.32 This is a TF1_THM_EQU_NAR problem
% 0.12/0.33 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.dLWa4BEX4J/Vampire---4.8_15401
% 0.62/0.81 % (15513)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.62/0.81 % (15515)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.62/0.81 % (15511)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.62/0.81 % (15510)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.62/0.81 % (15514)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.62/0.81 % (15516)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.62/0.82 % (15512)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.62/0.82 % (15517)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.62/0.82 % (15513)First to succeed.
% 0.62/0.82 % (15516)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.62/0.82 % (15515)Also succeeded, but the first one will report.
% 0.62/0.82 % (15517)Refutation not found, incomplete strategy% (15517)------------------------------
% 0.62/0.82 % (15517)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.82 % (15517)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.82
% 0.62/0.82 % (15517)Memory used [KB]: 1131
% 0.62/0.82 % (15517)Time elapsed: 0.005 s
% 0.62/0.82 % (15517)Instructions burned: 7 (million)
% 0.62/0.82 % (15517)------------------------------
% 0.62/0.82 % (15517)------------------------------
% 0.62/0.82 % (15513)Refutation found. Thanks to Tanya!
% 0.62/0.82 % SZS status Theorem for Vampire---4
% 0.62/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.82 % (15513)------------------------------
% 0.62/0.82 % (15513)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.82 % (15513)Termination reason: Refutation
% 0.62/0.82
% 0.62/0.82 % (15513)Memory used [KB]: 1144
% 0.62/0.82 % (15513)Time elapsed: 0.005 s
% 0.62/0.82 % (15513)Instructions burned: 6 (million)
% 0.62/0.82 % (15513)------------------------------
% 0.62/0.82 % (15513)------------------------------
% 0.62/0.82 % (15509)Success in time 0.486 s
% 0.62/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------